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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 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 332K 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-020B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717226008148

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-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:29] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-06-01 07:13:29] [INFO ] Transformed 1203 places.
[2024-06-01 07:13:29] [INFO ] Transformed 1183 transitions.
[2024-06-01 07:13:29] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:29] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 167 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 112 place count 1091 transition count 1071
Iterating global reduction 0 with 112 rules applied. Total rules applied 224 place count 1091 transition count 1071
Applied a total of 224 rules in 155 ms. Remains 1091 /1203 variables (removed 112) and now considering 1071/1183 (removed 112) transitions.
// Phase 1: matrix 1071 rows 1091 cols
[2024-06-01 07:13:29] [INFO ] Computed 181 invariants in 36 ms
[2024-06-01 07:13:30] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-06-01 07:13:30] [INFO ] Invariant cache hit.
[2024-06-01 07:13:31] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 1070 sub problems to find dead transitions.
[2024-06-01 07:13:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1090 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
SMT process timed out in 30308ms, After SMT, problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 30334ms
Starting structural reductions in LTL mode, iteration 1 : 1091/1203 places, 1071/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32065 ms. Remains : 1091/1203 places, 1071/1183 transitions.
Support contains 167 out of 1091 places after structural reductions.
[2024-06-01 07:14:02] [INFO ] Flatten gal took : 107 ms
[2024-06-01 07:14:02] [INFO ] Flatten gal took : 62 ms
[2024-06-01 07:14:02] [INFO ] Input system was already deterministic with 1071 transitions.
Support contains 165 out of 1091 places (down from 167) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 2227 ms. (17 steps per ms) remains 9/90 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
[2024-06-01 07:14:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 431/462 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 629/1091 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1071/2162 variables, 1091/1272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2162 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/2162 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2162/2162 variables, and 1272 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1199 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1091/1091 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 431/462 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 16 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 8 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 5/70 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 629/1091 variables, 116/186 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 20/206 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 6284ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1091 transition count 977
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 997 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 996 transition count 976
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 190 place count 996 transition count 875
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 392 place count 895 transition count 875
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 417 place count 870 transition count 850
Iterating global reduction 3 with 25 rules applied. Total rules applied 442 place count 870 transition count 850
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 442 place count 870 transition count 839
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 464 place count 859 transition count 839
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 332
Deduced a syphon composed of 332 places in 3 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 3 with 664 rules applied. Total rules applied 1128 place count 527 transition count 507
Partial Free-agglomeration rule applied 128 times.
Drop transitions (Partial Free agglomeration) removed 128 transitions
Iterating global reduction 3 with 128 rules applied. Total rules applied 1256 place count 527 transition count 507
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1257 place count 526 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1258 place count 525 transition count 506
Applied a total of 1258 rules in 257 ms. Remains 525 /1091 variables (removed 566) and now considering 506/1071 (removed 565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 525/1091 places, 506/1071 transitions.
RANDOM walk for 40000 steps (19 resets) in 958 ms. (41 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/5 properties
// Phase 1: matrix 506 rows 525 cols
[2024-06-01 07:14:10] [INFO ] Computed 180 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/162 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 281/443 variables, 100/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/447 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 453/900 variables, 447/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 75/975 variables, 39/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 13/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/975 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/976 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/976 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/976 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/978 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/978 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 44/1022 variables, 28/683 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1022 variables, 8/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1022 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/1024 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1024 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1024 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/1026 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1026 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1026 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 5/1031 variables, 4/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1031 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1031 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/1031 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 705 constraints, problems are : Problem set: 0 solved, 4 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/162 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 281/443 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/447 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 453/900 variables, 447/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 3 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 7/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/900 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 75/975 variables, 39/673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/975 variables, 13/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/975 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/975 variables, 12/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/975 variables, 4/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/975 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1/976 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/976 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/976 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/978 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/978 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/978 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/978 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 44/1022 variables, 28/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1022 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1022 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1022 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 2/1024 variables, 3/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1024 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1024 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 2/1026 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1026 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1026 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 5/1031 variables, 4/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1031 variables, 2/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1031 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 41 (OVERLAPS) 0/1031 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1031 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1031 variables, 2/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1031 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 0/1031 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1031/1031 variables, and 765 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7239 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 56/56 constraints]
After SMT, in 8186ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 3952 ms.
Support contains 14 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 506/506 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 525 transition count 502
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 521 transition count 502
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 28 place count 511 transition count 492
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 511 transition count 492
Applied a total of 33 rules in 72 ms. Remains 511 /525 variables (removed 14) and now considering 492/506 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 511/525 places, 492/506 transitions.
RANDOM walk for 40000 steps (16 resets) in 427 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 243672 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 3
Probabilistic random walk after 243672 steps, saw 181804 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 492 rows 511 cols
[2024-06-01 07:14:26] [INFO ] Computed 180 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/106 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 327/433 variables, 119/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 439/872 variables, 433/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 75/947 variables, 39/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/947 variables, 13/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/947 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/948 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/948 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/948 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/950 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 44/994 variables, 28/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/994 variables, 8/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/994 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/996 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/996 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/996 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/998 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/998 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/998 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 5/1003 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1003 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1003 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1003 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 691 constraints, problems are : Problem set: 0 solved, 3 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/106 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 327/433 variables, 119/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 439/872 variables, 433/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/872 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 8/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/872 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 75/947 variables, 39/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/947 variables, 13/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/947 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/947 variables, 8/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/947 variables, 4/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/947 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/948 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/950 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/950 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/950 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 44/994 variables, 28/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/994 variables, 8/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/994 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/994 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 2/996 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/996 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/996 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/996 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 2/998 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/998 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/998 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 5/1003 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1003 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1003 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1003 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1003 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 0/1003 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 727 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 33/33 constraints]
After SMT, in 4803ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3226 ms.
Support contains 14 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 12 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 511/511 places, 492/492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 11 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
[2024-06-01 07:14:34] [INFO ] Invariant cache hit.
[2024-06-01 07:14:34] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 07:14:34] [INFO ] Invariant cache hit.
[2024-06-01 07:14:34] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2024-06-01 07:14:34] [INFO ] Redundant transitions in 24 ms returned []
Running 488 sub problems to find dead transitions.
[2024-06-01 07:14:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (OVERLAPS) 3/511 variables, 146/188 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 12/240 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1003 variables, and 240 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/511 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (OVERLAPS) 3/511 variables, 146/192 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 48/240 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 8 (OVERLAPS) 492/1003 variables, 511/755 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 488/1243 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 1243 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 64/64 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60930 ms. Remains : 511/511 places, 492/492 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 42 ms
[2024-06-01 07:15:35] [INFO ] Input system was already deterministic with 1071 transitions.
Computed a total of 257 stabilizing places and 257 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1067 transition count 1047
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1067 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1066 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1066 transition count 1046
Applied a total of 50 rules in 70 ms. Remains 1066 /1091 variables (removed 25) and now considering 1046/1071 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 1066/1091 places, 1046/1071 transitions.
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 34 ms
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:15:35] [INFO ] Input system was already deterministic with 1046 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1067 transition count 1047
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1067 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1066 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1066 transition count 1046
Applied a total of 50 rules in 62 ms. Remains 1066 /1091 variables (removed 25) and now considering 1046/1071 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 1066/1091 places, 1046/1071 transitions.
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:15:35] [INFO ] Input system was already deterministic with 1046 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1066 transition count 1046
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1066 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1065 transition count 1045
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1065 transition count 1045
Applied a total of 52 rules in 63 ms. Remains 1065 /1091 variables (removed 26) and now considering 1045/1071 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 1065/1091 places, 1045/1071 transitions.
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:15:35] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:15:35] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1090 transition count 974
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 97 rules applied. Total rules applied 193 place count 994 transition count 973
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 194 place count 993 transition count 973
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 194 place count 993 transition count 871
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 398 place count 891 transition count 871
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 426 place count 863 transition count 843
Iterating global reduction 3 with 28 rules applied. Total rules applied 454 place count 863 transition count 843
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 454 place count 863 transition count 830
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 480 place count 850 transition count 830
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1164 place count 508 transition count 488
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1166 place count 506 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1167 place count 505 transition count 486
Applied a total of 1167 rules in 133 ms. Remains 505 /1091 variables (removed 586) and now considering 486/1071 (removed 585) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 133 ms. Remains : 505/1091 places, 486/1071 transitions.
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:15:36] [INFO ] Input system was already deterministic with 486 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 1090 transition count 975
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 995 transition count 975
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 190 place count 995 transition count 872
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 396 place count 892 transition count 872
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 422 place count 866 transition count 846
Iterating global reduction 2 with 26 rules applied. Total rules applied 448 place count 866 transition count 846
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 448 place count 866 transition count 835
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 470 place count 855 transition count 835
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 2 with 684 rules applied. Total rules applied 1154 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1156 place count 511 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1157 place count 510 transition count 491
Applied a total of 1157 rules in 111 ms. Remains 510 /1091 variables (removed 581) and now considering 491/1071 (removed 580) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 510/1091 places, 491/1071 transitions.
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:15:36] [INFO ] Input system was already deterministic with 491 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1090 transition count 970
Reduce places removed 100 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 201 place count 990 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 989 transition count 969
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 202 place count 989 transition count 868
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 404 place count 888 transition count 868
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 432 place count 860 transition count 840
Iterating global reduction 3 with 28 rules applied. Total rules applied 460 place count 860 transition count 840
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 460 place count 860 transition count 827
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 486 place count 847 transition count 827
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 3 with 690 rules applied. Total rules applied 1176 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1178 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1179 place count 499 transition count 480
Applied a total of 1179 rules in 100 ms. Remains 499 /1091 variables (removed 592) and now considering 480/1071 (removed 591) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 499/1091 places, 480/1071 transitions.
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:36] [INFO ] Input system was already deterministic with 480 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 59 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:15:36] [INFO ] Input system was already deterministic with 1044 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1090 transition count 971
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 991 transition count 971
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 991 transition count 870
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 890 transition count 870
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 428 place count 862 transition count 842
Iterating global reduction 2 with 28 rules applied. Total rules applied 456 place count 862 transition count 842
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 456 place count 862 transition count 829
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 482 place count 849 transition count 829
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 2 with 690 rules applied. Total rules applied 1172 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1174 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1175 place count 501 transition count 482
Applied a total of 1175 rules in 92 ms. Remains 501 /1091 variables (removed 590) and now considering 482/1071 (removed 589) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92 ms. Remains : 501/1091 places, 482/1071 transitions.
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:36] [INFO ] Input system was already deterministic with 482 transitions.
RANDOM walk for 329 steps (0 resets) in 7 ms. (41 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-020B-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1064 transition count 1044
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1064 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1063 transition count 1043
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1063 transition count 1043
Applied a total of 56 rules in 67 ms. Remains 1063 /1091 variables (removed 28) and now considering 1043/1071 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 1063/1091 places, 1043/1071 transitions.
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:15:36] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:15:36] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 60 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:15:37] [INFO ] Input system was already deterministic with 1044 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1067 transition count 1047
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1067 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1066 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1066 transition count 1046
Applied a total of 50 rules in 62 ms. Remains 1066 /1091 variables (removed 25) and now considering 1046/1071 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 1066/1091 places, 1046/1071 transitions.
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:15:37] [INFO ] Input system was already deterministic with 1046 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1090 transition count 969
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 989 transition count 969
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 989 transition count 868
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 888 transition count 868
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 432 place count 860 transition count 840
Iterating global reduction 2 with 28 rules applied. Total rules applied 460 place count 860 transition count 840
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 460 place count 860 transition count 827
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 486 place count 847 transition count 827
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 2 with 690 rules applied. Total rules applied 1176 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1178 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 480
Applied a total of 1179 rules in 84 ms. Remains 499 /1091 variables (removed 592) and now considering 480/1071 (removed 591) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 499/1091 places, 480/1071 transitions.
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:37] [INFO ] Input system was already deterministic with 480 transitions.
RANDOM walk for 3065 steps (0 resets) in 32 ms. (92 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-020B-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Applied a total of 52 rules in 41 ms. Remains 1065 /1091 variables (removed 26) and now considering 1045/1071 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 1065/1091 places, 1045/1071 transitions.
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:15:37] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1090 transition count 973
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 993 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 992 transition count 972
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 196 place count 992 transition count 871
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 398 place count 891 transition count 871
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 424 place count 865 transition count 845
Iterating global reduction 3 with 26 rules applied. Total rules applied 450 place count 865 transition count 845
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 450 place count 865 transition count 835
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 470 place count 855 transition count 835
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1154 place count 513 transition count 493
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1156 place count 511 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1157 place count 510 transition count 491
Applied a total of 1157 rules in 94 ms. Remains 510 /1091 variables (removed 581) and now considering 491/1071 (removed 580) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 510/1091 places, 491/1071 transitions.
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:15:37] [INFO ] Input system was already deterministic with 491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 72 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:15:37] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:15:37] [INFO ] Input system was already deterministic with 1044 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 58 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-06-01 07:15:38] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:15:38] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:15:38] [INFO ] Input system was already deterministic with 1044 transitions.
[2024-06-01 07:15:38] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:15:38] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:15:38] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 07:15:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1091 places, 1071 transitions and 3342 arcs took 5 ms.
Total runtime 128891 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-020B-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-020B-CTLFireability-2023-15

BK_STOP 1717226138569

--------------------
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-020B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1126/ctl_0_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1126/ctl_1_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1126/ctl_2_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1126/ctl_3_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1126/ctl_4_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1126/ctl_5_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1126/ctl_6_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1126/ctl_7_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1126/ctl_8_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1126/ctl_9_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1126/ctl_10_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1126/ctl_11_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1126/ctl_12_
ctl formula name ShieldIIPs-PT-020B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1126/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-020B"
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-020B, 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-171683760400106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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