About the Execution of LTSMin+red for FireWire-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 689.907 | 65472.00 | 93045.00 | 200.60 | ????F?????TFF?T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901200249.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-11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200249
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 125K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-11-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717355156212
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:05:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:05:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:05:57] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 19:05:57] [INFO ] Transformed 169 places.
[2024-06-02 19:05:57] [INFO ] Transformed 508 transitions.
[2024-06-02 19:05:57] [INFO ] Found NUPN structural information;
[2024-06-02 19:05:57] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
FORMULA FireWire-PT-11-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 443/443 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 169 transition count 437
Applied a total of 6 rules in 25 ms. Remains 169 /169 variables (removed 0) and now considering 437/443 (removed 6) transitions.
[2024-06-02 19:05:57] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 169 cols
[2024-06-02 19:05:57] [INFO ] Computed 10 invariants in 20 ms
[2024-06-02 19:05:57] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-02 19:05:57] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 19:05:57] [INFO ] Invariant cache hit.
[2024-06-02 19:05:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:05:58] [INFO ] Implicit Places using invariants and state equation in 369 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/169 places, 437/443 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 729 ms. Remains : 168/169 places, 437/443 transitions.
Support contains 79 out of 168 places after structural reductions.
[2024-06-02 19:05:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:05:58] [INFO ] Flatten gal took : 56 ms
[2024-06-02 19:05:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-11-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:05:58] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:05:58] [INFO ] Input system was already deterministic with 437 transitions.
Support contains 55 out of 168 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (1083 resets) in 2781 ms. (14 steps per ms) remains 11/35 properties
BEST_FIRST walk for 40004 steps (231 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (211 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (182 resets) in 286 ms. (139 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (214 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (198 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (207 resets) in 91 ms. (434 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (207 resets) in 91 ms. (434 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (214 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (25 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
[2024-06-02 19:06:00] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 168 cols
[2024-06-02 19:06:00] [INFO ] Computed 9 invariants in 6 ms
[2024-06-02 19:06:00] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 137/153 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 137/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/161 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 400/561 variables, 161/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 56/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 11/572 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 7/401 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/573 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/573 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/573 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 403 constraints, problems are : Problem set: 0 solved, 7 unsolved in 631 ms.
Refiners :[Domain max(s): 168/168 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 137/153 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 137/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:06:00] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 9 ms to minimize.
[2024-06-02 19:06:00] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/162 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/161 variables, 2/164 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 8/172 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 400/561 variables, 161/333 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 56/389 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 6/395 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 19:06:01] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:06:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 2/397 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 19:06:01] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 11/572 variables, 7/405 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/572 variables, 7/412 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/572 variables, 1/413 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/573 variables, 1/414 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/573 variables, 0/414 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/573 variables, 0/414 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 414 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1877 ms.
Refiners :[Domain max(s): 168/168 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 2550ms problems are : Problem set: 1 solved, 6 unsolved
Parikh walk visited 1 properties in 570 ms.
Support contains 9 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 437/437 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 168 transition count 434
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 3 place count 168 transition count 429
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 163 transition count 429
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 160 transition count 423
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 160 transition count 423
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 157 transition count 432
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 31 place count 157 transition count 426
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 34 place count 157 transition count 423
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 157 transition count 431
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 52 place count 152 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 152 transition count 417
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 152 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 151 transition count 416
Applied a total of 60 rules in 121 ms. Remains 151 /168 variables (removed 17) and now considering 416/437 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 151/168 places, 416/437 transitions.
RANDOM walk for 40000 steps (1283 resets) in 1323 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (284 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (296 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (242 resets) in 40 ms. (975 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (249 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
[2024-06-02 19:06:03] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
// Phase 1: matrix 379 rows 151 cols
[2024-06-02 19:06:03] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 19:06:03] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 370/504 variables, 134/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 56/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:06:03] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/528 variables, 15/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/530 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/530 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 217 constraints, problems are : Problem set: 0 solved, 4 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 370/504 variables, 134/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 56/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 24/528 variables, 15/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/530 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/530 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 221 constraints, problems are : Problem set: 0 solved, 4 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 909ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 658 ms.
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 416/416 transitions.
Applied a total of 0 rules in 10 ms. Remains 151 /151 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 151/151 places, 416/416 transitions.
RANDOM walk for 40000 steps (1267 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (280 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (220 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1321717 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :1 out of 2
Probabilistic random walk after 1321717 steps, saw 318193 distinct states, run finished after 3006 ms. (steps per millisecond=439 ) properties seen :1
[2024-06-02 19:06:08] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 19:06:08] [INFO ] Invariant cache hit.
[2024-06-02 19:06:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/325 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/439 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 36/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/440 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 80/520 variables, 40/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/529 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/530 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/325 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/439 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 36/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/440 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/520 variables, 40/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/529 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/530 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/530 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 416/416 transitions.
Applied a total of 0 rules in 10 ms. Remains 151 /151 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 151/151 places, 416/416 transitions.
RANDOM walk for 40000 steps (1265 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (237 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1460331 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :0 out of 1
Probabilistic random walk after 1460331 steps, saw 348513 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
[2024-06-02 19:06:11] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 19:06:11] [INFO ] Invariant cache hit.
[2024-06-02 19:06:11] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/325 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/439 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 36/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/440 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 80/520 variables, 40/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/529 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/530 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/325 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/439 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 36/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/440 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/520 variables, 40/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/529 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/530 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/530 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 151/151 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 416/416 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-02 19:06:12] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 19:06:12] [INFO ] Invariant cache hit.
[2024-06-02 19:06:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 19:06:12] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 19:06:12] [INFO ] Invariant cache hit.
[2024-06-02 19:06:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:06:12] [INFO ] Implicit Places using invariants and state equation in 333 ms returned [56, 149]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 438 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 149/151 places, 416/416 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 450 ms. Remains : 149/151 places, 416/416 transitions.
RANDOM walk for 40000 steps (1274 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (223 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1459709 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :0 out of 1
Probabilistic random walk after 1459709 steps, saw 348354 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
[2024-06-02 19:06:15] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
// Phase 1: matrix 379 rows 149 cols
[2024-06-02 19:06:15] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 19:06:15] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 241/321 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/437 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 36/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/438 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 80/518 variables, 40/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/527 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/527 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/527 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/528 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 241/321 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/437 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 36/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/438 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/518 variables, 40/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/527 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/527 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/527 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/528 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 16 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 149/149 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 9 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-02 19:06:16] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 19:06:16] [INFO ] Invariant cache hit.
[2024-06-02 19:06:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 19:06:16] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 19:06:16] [INFO ] Invariant cache hit.
[2024-06-02 19:06:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:06:16] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-06-02 19:06:16] [INFO ] Redundant transitions in 23 ms returned []
Running 410 sub problems to find dead transitions.
[2024-06-02 19:06:16] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 19:06:16] [INFO ] Invariant cache hit.
[2024-06-02 19:06:16] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-06-02 19:06:18] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:06:18] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:06:18] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:06:18] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:06:19] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:06:19] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:06:19] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/219 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-06-02 19:06:26] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:06:26] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:06:26] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 222 constraints, problems are : Problem set: 0 solved, 410 unsolved in 19415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-06-02 19:06:37] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (OVERLAPS) 379/528 variables, 149/167 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 410/633 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 633 constraints, problems are : Problem set: 0 solved, 410 unsolved in 23264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 11/11 constraints]
After SMT, in 43088ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 43097ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43455 ms. Remains : 149/149 places, 416/416 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 149 vertex of which 29 / 149 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 142 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 123 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 14 place count 123 transition count 262
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 122 transition count 261
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 18 place count 121 transition count 260
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 19 place count 121 transition count 259
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 21 place count 120 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 119 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 119 transition count 219
Free-agglomeration rule applied 7 times with reduction of 4 identical transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 119 transition count 208
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 39 place count 112 transition count 206
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 112 transition count 206
Applied a total of 43 rules in 42 ms. Remains 112 /149 variables (removed 37) and now considering 206/416 (removed 210) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:06:59] [INFO ] Flow matrix only has 204 transitions (discarded 2 similar events)
// Phase 1: matrix 204 rows 112 cols
[2024-06-02 19:06:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:06:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:06:59] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:06:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:06:59] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:06:59] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:06:59] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 284 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 437 transitions.
Support contains 46 out of 168 places (down from 50) after GAL structural reductions.
Computed a total of 24 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 8 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 167 transition count 430
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 161 transition count 430
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 158 transition count 424
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 158 transition count 424
Applied a total of 18 rules in 30 ms. Remains 158 /168 variables (removed 10) and now considering 424/437 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 158/168 places, 424/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 167 transition count 430
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 161 transition count 430
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 158 transition count 424
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 158 transition count 424
Applied a total of 18 rules in 17 ms. Remains 158 /168 variables (removed 10) and now considering 424/437 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 158/168 places, 424/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 167 transition count 431
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 162 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 159 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 159 transition count 425
Applied a total of 16 rules in 36 ms. Remains 159 /168 variables (removed 9) and now considering 425/437 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 159/168 places, 425/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 167 transition count 431
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 162 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 159 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 159 transition count 425
Applied a total of 16 rules in 14 ms. Remains 159 /168 variables (removed 9) and now considering 425/437 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 159/168 places, 425/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 167 transition count 430
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 161 transition count 430
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 158 transition count 424
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 158 transition count 424
Applied a total of 18 rules in 23 ms. Remains 158 /168 variables (removed 10) and now considering 424/437 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 158/168 places, 424/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:07:00] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:07:00] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 167 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 167 transition count 435
Applied a total of 2 rules in 4 ms. Remains 167 /168 variables (removed 1) and now considering 435/437 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 167/168 places, 435/437 transitions.
[2024-06-02 19:07:01] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:07:01] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:07:01] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 9 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:07:01] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:07:01] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:07:01] [INFO ] Input system was already deterministic with 431 transitions.
[2024-06-02 19:07:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:07:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:07:01] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 19 ms.
[2024-06-02 19:07:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 437 transitions and 1598 arcs took 4 ms.
Total runtime 64058 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-00
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-02
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-03
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-05
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-06
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-07
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-08
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-09
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-13
Could not compute solution for formula : FireWire-PT-11-CTLCardinality-2024-15
BK_STOP 1717355221684
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name FireWire-PT-11-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/628/ctl_0_
ctl formula name FireWire-PT-11-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/628/ctl_1_
ctl formula name FireWire-PT-11-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/628/ctl_2_
ctl formula name FireWire-PT-11-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/628/ctl_3_
ctl formula name FireWire-PT-11-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/628/ctl_4_
ctl formula name FireWire-PT-11-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/628/ctl_5_
ctl formula name FireWire-PT-11-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/628/ctl_6_
ctl formula name FireWire-PT-11-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/628/ctl_7_
ctl formula name FireWire-PT-11-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/628/ctl_8_
ctl formula name FireWire-PT-11-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/628/ctl_9_
ctl formula name FireWire-PT-11-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/628/ctl_10_
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-11"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-11, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901200249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-11.tgz
mv FireWire-PT-11 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;