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.r528-tall-171683760300098.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 ShieldIIPs-PT-020A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760300098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:43 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 ShieldIIPs-PT-020A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-020A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225651130

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:07:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:07:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:07:32] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-01 07:07:32] [INFO ] Transformed 503 places.
[2024-06-01 07:07:32] [INFO ] Transformed 483 transitions.
[2024-06-01 07:07:32] [INFO ] Found NUPN structural information;
[2024-06-01 07:07:32] [INFO ] Parsed PT model containing 503 places and 483 transitions and 2166 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 185 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 34 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-06-01 07:07:32] [INFO ] Computed 181 invariants in 22 ms
[2024-06-01 07:07:33] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-01 07:07:33] [INFO ] Invariant cache hit.
[2024-06-01 07:07:33] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:07:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 8 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1214 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30031 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 27/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1696 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1702 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30020 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 33/33 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Finished structural reductions in LTL mode , in 1 iterations and 61238 ms. Remains : 503/503 places, 483/483 transitions.
Support contains 185 out of 503 places after structural reductions.
[2024-06-01 07:08:34] [INFO ] Flatten gal took : 91 ms
[2024-06-01 07:08:34] [INFO ] Flatten gal took : 48 ms
[2024-06-01 07:08:34] [INFO ] Input system was already deterministic with 483 transitions.
RANDOM walk for 40000 steps (36 resets) in 2636 ms. (15 steps per ms) remains 3/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
[2024-06-01 07:08:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 33/48 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 33/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 455/503 variables, 165/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 455/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 483/986 variables, 503/1187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 5 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 4/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/986 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/986 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 1191 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1426 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 33/48 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 33/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 455/503 variables, 165/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 455/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 3/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 483/986 variables, 503/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/986 variables, 3/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 0/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/986 variables, 1/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/986 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/986 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 1198 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1346 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 2814ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1999 ms.
Support contains 11 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Partial Free-agglomeration rule applied 131 times.
Drop transitions (Partial Free agglomeration) removed 131 transitions
Iterating global reduction 0 with 131 rules applied. Total rules applied 135 place count 501 transition count 481
Applied a total of 135 rules in 86 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 501/503 places, 481/483 transitions.
RANDOM walk for 40000 steps (22 resets) in 1296 ms. (30 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
// Phase 1: matrix 481 rows 501 cols
[2024-06-01 07:08:40] [INFO ] Computed 181 invariants in 21 ms
[2024-06-01 07:08:40] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 472/493 variables, 171/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 472/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 2/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/501 variables, 4/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 8/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 481/982 variables, 501/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/982 variables, 4/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 2/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/982 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 1191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 993 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 501/501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 472/493 variables, 171/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 472/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 3/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/501 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 8/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 481/982 variables, 501/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 4/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 1/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/982 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/982 variables, 2/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/982 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/982 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 982/982 variables, and 1195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 501/501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1659ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 392 ms.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 481/481 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 501 transition count 481
Applied a total of 2 rules in 36 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 501/501 places, 481/481 transitions.
RANDOM walk for 40000 steps (24 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 350229 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 350229 steps, saw 160048 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 481 rows 501 cols
[2024-06-01 07:08:45] [INFO ] Computed 181 invariants in 7 ms
[2024-06-01 07:08:45] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 472/493 variables, 171/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 472/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 2/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/501 variables, 4/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 8/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 481/982 variables, 501/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/982 variables, 4/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 12/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/982 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 1201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1351 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 501/501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 472/493 variables, 171/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 472/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 13/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/501 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 8/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 481/982 variables, 501/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 1/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/982 variables, 2/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/982 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/982 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 982/982 variables, and 1205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 654 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 501/501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 2025ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 430 ms.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 16 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 501/501 places, 481/481 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 15 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-06-01 07:08:48] [INFO ] Invariant cache hit.
[2024-06-01 07:08:48] [INFO ] Implicit Places using invariants in 310 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/501 places, 481/481 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 341 ms. Remains : 500/501 places, 481/481 transitions.
RANDOM walk for 40000 steps (23 resets) in 467 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 366920 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 366920 steps, saw 162185 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 481 rows 500 cols
[2024-06-01 07:08:51] [INFO ] Computed 180 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 471/492 variables, 170/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 471/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/500 variables, 4/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 8/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 3/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 481/981 variables, 500/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/981 variables, 8/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/981 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/981 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 1194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1258 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 471/492 variables, 170/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 471/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 11/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/500 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 8/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 481/981 variables, 500/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/981 variables, 1/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/981 variables, 5/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/981 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/981 variables, 3/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/981 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/981 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/981 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/981 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 981/981 variables, and 1206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1350 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
After SMT, in 2624ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 481 ms.
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 28 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 500/500 places, 481/481 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-06-01 07:08:55] [INFO ] Invariant cache hit.
[2024-06-01 07:08:55] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-01 07:08:55] [INFO ] Invariant cache hit.
[2024-06-01 07:08:55] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2024-06-01 07:08:56] [INFO ] Redundant transitions in 40 ms returned []
Running 480 sub problems to find dead transitions.
[2024-06-01 07:08:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 176/679 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 20/720 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (OVERLAPS) 481/981 variables, 500/1220 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 1235 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30022 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 176/679 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 55/735 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 481/981 variables, 500/1235 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 480/1715 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 1715 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30023 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 55/55 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61138 ms. Remains : 500/500 places, 481/481 transitions.
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 47 ms
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:09:56] [INFO ] Input system was already deterministic with 483 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:09:56] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:09:56] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:09:56] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:09:56] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:09:56] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:09:56] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
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 4 place count 501 transition count 481
Applied a total of 4 rules in 43 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 501/503 places, 481/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
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 5 place count 499 transition count 480
Applied a total of 5 rules in 38 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 499/503 places, 480/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 480 transitions.
RANDOM walk for 23681 steps (21 resets) in 238 ms. (99 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-020A-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 22 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 501/503 places, 481/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
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 4 place count 501 transition count 481
Applied a total of 4 rules in 20 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 501/503 places, 481/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:09:57] [INFO ] Flatten gal took : 32 ms
[2024-06-01 07:09:57] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 499 transition count 480
Applied a total of 5 rules in 21 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 499/503 places, 480/483 transitions.
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:58] [INFO ] Input system was already deterministic with 480 transitions.
RANDOM walk for 6680 steps (3 resets) in 60 ms. (109 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-020A-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 23 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 501/503 places, 481/483 transitions.
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:09:58] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 503/503 places, 483/483 transitions.
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:09:58] [INFO ] Input system was already deterministic with 483 transitions.
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:09:58] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:09:58] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 07:09:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 503 places, 483 transitions and 2166 arcs took 12 ms.
Total runtime 146141 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 : ShieldIIPs-PT-020A-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-020A-CTLFireability-2023-15

BK_STOP 1717225798787

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ShieldIIPs-PT-020A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/998/ctl_0_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/998/ctl_1_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/998/ctl_2_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/998/ctl_3_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/998/ctl_4_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/998/ctl_5_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/998/ctl_6_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/998/ctl_7_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/998/ctl_8_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/998/ctl_9_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/998/ctl_10_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/998/ctl_11_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/998/ctl_12_
ctl formula name ShieldIIPs-PT-020A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/998/ctl_13_
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="ShieldIIPs-PT-020A"
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 ShieldIIPs-PT-020A, 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 r528-tall-171683760300098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020A.tgz
mv ShieldIIPs-PT-020A 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 ;