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.r492-smll-171636266300161.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 EisenbergMcGuire-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 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 EisenbergMcGuire-PT-05-CTLCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2023-12
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717221953130

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:05:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:05:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:05:56] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2024-06-01 06:05:56] [INFO ] Transformed 295 places.
[2024-06-01 06:05:56] [INFO ] Transformed 800 transitions.
[2024-06-01 06:05:56] [INFO ] Found NUPN structural information;
[2024-06-01 06:05:56] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 679 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
FORMULA EisenbergMcGuire-PT-05-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 277 transition count 710
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 277 transition count 710
Applied a total of 36 rules in 118 ms. Remains 277 /295 variables (removed 18) and now considering 710/800 (removed 90) transitions.
[2024-06-01 06:05:56] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-06-01 06:05:56] [INFO ] Computed 16 invariants in 50 ms
[2024-06-01 06:05:57] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-06-01 06:05:57] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:05:57] [INFO ] Invariant cache hit.
[2024-06-01 06:05:58] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:05:58] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-06-01 06:05:58] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:05:58] [INFO ] Invariant cache hit.
[2024-06-01 06:05:58] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:06:07] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 35 ms to minimize.
[2024-06-01 06:06:07] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:06:07] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:06:08] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:06:08] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:06:08] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:06:08] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 4 ms to minimize.
[2024-06-01 06:06:08] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 4 ms to minimize.
[2024-06-01 06:06:09] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:06:09] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 9 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:06:10] [INFO ] Deduced a trap composed of 80 places in 273 ms of which 5 ms to minimize.
[2024-06-01 06:06:11] [INFO ] Deduced a trap composed of 78 places in 262 ms of which 5 ms to minimize.
[2024-06-01 06:06:11] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 6 ms to minimize.
[2024-06-01 06:06:11] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:06:11] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 4 ms to minimize.
[2024-06-01 06:06:12] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 5 ms to minimize.
[2024-06-01 06:06:12] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:06:12] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:06:13] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:06:13] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 15 ms to minimize.
[2024-06-01 06:06:13] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 4 ms to minimize.
[2024-06-01 06:06:14] [INFO ] Deduced a trap composed of 63 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:06:15] [INFO ] Deduced a trap composed of 59 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:06:15] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:06:15] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:06:16] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:06:16] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:06:16] [INFO ] Deduced a trap composed of 85 places in 262 ms of which 5 ms to minimize.
[2024-06-01 06:06:16] [INFO ] Deduced a trap composed of 79 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:06:16] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:06:17] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:06:17] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:06:17] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 6 ms to minimize.
[2024-06-01 06:06:18] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:06:18] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:06:18] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:06:18] [INFO ] Deduced a trap composed of 74 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:06:19] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:06:25] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:06:26] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:06:27] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 4 ms to minimize.
[2024-06-01 06:06:27] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:06:27] [INFO ] Deduced a trap composed of 68 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:06:28] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:06:28] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:06:28] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:06:29] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:06:29] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 6 ms to minimize.
[2024-06-01 06:06:29] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 5 ms to minimize.
SMT process timed out in 30856ms, After SMT, problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 30912ms
Starting structural reductions in LTL mode, iteration 1 : 277/295 places, 710/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33096 ms. Remains : 277/295 places, 710/800 transitions.
Support contains 88 out of 277 places after structural reductions.
[2024-06-01 06:06:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 06:06:30] [INFO ] Flatten gal took : 129 ms
FORMULA EisenbergMcGuire-PT-05-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:06:30] [INFO ] Flatten gal took : 67 ms
[2024-06-01 06:06:30] [INFO ] Input system was already deterministic with 710 transitions.
Support contains 79 out of 277 places (down from 88) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2572 ms. (15 steps per ms) remains 17/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
[2024-06-01 06:06:31] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:06:31] [INFO ] Invariant cache hit.
[2024-06-01 06:06:31] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 236/268 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 9/277 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 375/652 variables, 277/293 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/652 variables, 124/417 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/652 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 417 constraints, problems are : Problem set: 1 solved, 16 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 240/268 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 9/277 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-01 06:06:33] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 6 ms to minimize.
[2024-06-01 06:06:33] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:06:33] [INFO ] Deduced a trap composed of 69 places in 226 ms of which 5 ms to minimize.
[2024-06-01 06:06:34] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:06:34] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:06:34] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 18 ms to minimize.
[2024-06-01 06:06:34] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 5 ms to minimize.
[2024-06-01 06:06:35] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 5 ms to minimize.
[2024-06-01 06:06:35] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:06:35] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 5 ms to minimize.
[2024-06-01 06:06:35] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:06:36] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:06:36] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:06:36] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:06:36] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 5 ms to minimize.
[2024-06-01 06:06:37] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 4 ms to minimize.
[2024-06-01 06:06:37] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:06:37] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:06:37] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:06:37] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 6103ms, After SMT, problems are : Problem set: 1 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 277 transition count 706
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 273 transition count 705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 10 place count 272 transition count 638
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 144 place count 205 transition count 638
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 203 transition count 628
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 203 transition count 628
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 186 place count 184 transition count 609
Applied a total of 186 rules in 175 ms. Remains 184 /277 variables (removed 93) and now considering 609/710 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 184/277 places, 609/710 transitions.
RANDOM walk for 40000 steps (8 resets) in 840 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 628584 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :15 out of 16
Probabilistic random walk after 628584 steps, saw 127273 distinct states, run finished after 3011 ms. (steps per millisecond=208 ) properties seen :15
[2024-06-01 06:06:41] [INFO ] Flow matrix only has 274 transitions (discarded 335 similar events)
// Phase 1: matrix 274 rows 184 cols
[2024-06-01 06:06:41] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:06:41] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 167/277 variables, 110/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/298 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 19/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 32/330 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 51/381 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/385 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/385 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 73/458 variables, 55/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/458 variables, 61/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/458 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/458 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 167/277 variables, 110/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/298 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 19/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 32/330 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 51/381 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/385 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/385 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:06:41] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:06:42] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/385 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/385 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 73/458 variables, 55/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/458 variables, 61/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/458 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/458 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 609/609 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 184 transition count 599
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 174 transition count 599
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 173 transition count 598
Applied a total of 22 rules in 66 ms. Remains 173 /184 variables (removed 11) and now considering 598/609 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 173/184 places, 598/609 transitions.
RANDOM walk for 40000 steps (8 resets) in 437 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 829518 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Probabilistic random walk after 829518 steps, saw 161370 distinct states, run finished after 3006 ms. (steps per millisecond=275 ) properties seen :0
[2024-06-01 06:06:45] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
// Phase 1: matrix 263 rows 173 cols
[2024-06-01 06:06:45] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 06:06:45] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/102 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 159/261 variables, 102/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 24/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/282 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 19/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 32/314 variables, 14/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 12/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/362 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/366 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 70/436 variables, 52/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 61/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/436 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/102 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 159/261 variables, 102/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 24/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/282 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 19/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 32/314 variables, 14/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 12/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/362 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/366 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/366 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 70/436 variables, 52/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 61/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:06:46] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:06:46] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:06:46] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:06:46] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:06:46] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:06:46] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/436 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/436 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/436 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 598/598 transitions.
Applied a total of 0 rules in 30 ms. Remains 173 /173 variables (removed 0) and now considering 598/598 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 173/173 places, 598/598 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 598/598 transitions.
Applied a total of 0 rules in 24 ms. Remains 173 /173 variables (removed 0) and now considering 598/598 (removed 0) transitions.
[2024-06-01 06:06:47] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
[2024-06-01 06:06:47] [INFO ] Invariant cache hit.
[2024-06-01 06:06:47] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-06-01 06:06:47] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
[2024-06-01 06:06:47] [INFO ] Invariant cache hit.
[2024-06-01 06:06:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:06:48] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2024-06-01 06:06:48] [INFO ] Redundant transitions in 61 ms returned []
Running 593 sub problems to find dead transitions.
[2024-06-01 06:06:48] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
[2024-06-01 06:06:48] [INFO ] Invariant cache hit.
[2024-06-01 06:06:48] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:06:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:06:54] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:06:55] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:06:56] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:06:56] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:06:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:06:57] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:06:58] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:06:58] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:06:59] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:06:59] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:06:59] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:07:00] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:07:00] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:07:01] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2024-06-01 06:07:01] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:07:01] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:07:01] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:07:02] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:07:02] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:07:02] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:07:02] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:07:03] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:07:03] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:07:03] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:07:08] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:07:09] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:07:09] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:07:10] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:07:10] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:07:10] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:07:11] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:07:12] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:07:12] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:07:12] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:07:12] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:07:13] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:07:13] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:07:13] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:07:14] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:07:17] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:07:17] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 4 ms to minimize.
[2024-06-01 06:07:18] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:07:18] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:07:18] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:07:18] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/436 variables, and 83 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 67/83 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:07:22] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:07:22] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:07:22] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:07:24] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:07:24] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:07:24] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:07:24] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:07:25] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:07:25] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:07:26] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:07:27] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 5 ms to minimize.
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:07:32] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:07:33] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:07:33] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:07:33] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:07:33] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:07:33] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:07:34] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:07:34] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:07:35] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 2 ms to minimize.
[2024-06-01 06:07:36] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:07:38] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:07:38] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:07:39] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 55 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:07:40] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:07:41] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:07:42] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:07:42] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:07:43] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:07:44] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:07:45] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:07:48] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:07:48] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:07:48] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:07:49] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 60687ms, After SMT, problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 60700ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61965 ms. Remains : 173/173 places, 598/598 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 524 edges and 173 vertex of which 23 / 173 are part of one of the 5 SCC in 10 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 67 transitions
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 390 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 155 transition count 174
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 121 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 69 place count 121 transition count 164
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 93 place count 107 transition count 164
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 169 place count 69 transition count 126
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 189 place count 69 transition count 106
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 209 place count 59 transition count 162
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 214 place count 59 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 59 transition count 153
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 59 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 222 place count 57 transition count 151
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 240 place count 57 transition count 151
Applied a total of 240 rules in 123 ms. Remains 57 /173 variables (removed 116) and now considering 151/598 (removed 447) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 151 rows 57 cols
[2024-06-01 06:07:49] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 06:07:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:07:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:07:49] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:07:49] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:07:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:07:49] [INFO ] After 13ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:07:49] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:07:49] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 388 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-06-01 06:07:49] [INFO ] Flatten gal took : 69 ms
[2024-06-01 06:07:49] [INFO ] Flatten gal took : 56 ms
[2024-06-01 06:07:49] [INFO ] Input system was already deterministic with 710 transitions.
Support contains 66 out of 277 places (down from 73) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 170 place count 191 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 212 place count 171 transition count 596
Applied a total of 212 rules in 68 ms. Remains 171 /277 variables (removed 106) and now considering 596/710 (removed 114) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 171/277 places, 596/710 transitions.
[2024-06-01 06:07:49] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:07:49] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:07:49] [INFO ] Input system was already deterministic with 596 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 334 steps, run visited all 1 properties in 5 ms. (steps per millisecond=66 )
Probabilistic random walk after 334 steps, saw 272 distinct states, run finished after 10 ms. (steps per millisecond=33 ) properties seen :1
FORMULA EisenbergMcGuire-PT-05-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 10 place count 272 transition count 628
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 164 place count 195 transition count 628
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 166 place count 193 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 193 transition count 618
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 206 place count 174 transition count 599
Applied a total of 206 rules in 59 ms. Remains 174 /277 variables (removed 103) and now considering 599/710 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 174/277 places, 599/710 transitions.
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 32 ms
[2024-06-01 06:07:50] [INFO ] Input system was already deterministic with 599 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 700
Applied a total of 4 rules in 12 ms. Remains 275 /277 variables (removed 2) and now considering 700/710 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 275/277 places, 700/710 transitions.
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 29 ms
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 36 ms
[2024-06-01 06:07:50] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 700
Applied a total of 4 rules in 12 ms. Remains 275 /277 variables (removed 2) and now considering 700/710 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 275/277 places, 700/710 transitions.
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 32 ms
[2024-06-01 06:07:50] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 700
Applied a total of 4 rules in 11 ms. Remains 275 /277 variables (removed 2) and now considering 700/710 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 275/277 places, 700/710 transitions.
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:07:50] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 170 place count 191 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 212 place count 171 transition count 596
Applied a total of 212 rules in 41 ms. Remains 171 /277 variables (removed 106) and now considering 596/710 (removed 114) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 171/277 places, 596/710 transitions.
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:07:50] [INFO ] Input system was already deterministic with 596 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 700
Applied a total of 4 rules in 10 ms. Remains 275 /277 variables (removed 2) and now considering 700/710 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 275/277 places, 700/710 transitions.
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:07:50] [INFO ] Flatten gal took : 30 ms
[2024-06-01 06:07:50] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 277 transition count 706
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 273 transition count 706
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 8 place count 273 transition count 633
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 154 place count 200 transition count 633
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 198 transition count 623
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 198 transition count 623
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 192 place count 181 transition count 606
Applied a total of 192 rules in 50 ms. Remains 181 /277 variables (removed 96) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 181/277 places, 606/710 transitions.
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 23 ms
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 26 ms
[2024-06-01 06:07:51] [INFO ] Input system was already deterministic with 606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 700
Applied a total of 4 rules in 10 ms. Remains 275 /277 variables (removed 2) and now considering 700/710 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 275/277 places, 700/710 transitions.
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:07:51] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 700
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 700
Applied a total of 4 rules in 13 ms. Remains 275 /277 variables (removed 2) and now considering 700/710 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 275/277 places, 700/710 transitions.
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 24 ms
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:07:51] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 277/277 places, 710/710 transitions.
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 29 ms
[2024-06-01 06:07:51] [INFO ] Input system was already deterministic with 710 transitions.
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:07:51] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:07:51] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 06:07:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 710 transitions and 3240 arcs took 8 ms.
Total runtime 115819 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 : EisenbergMcGuire-PT-05-CTLCardinality-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2024-11
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLCardinality-2023-15

BK_STOP 1717222071966

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1155/ctl_0_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1155/ctl_1_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1155/ctl_2_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1155/ctl_3_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1155/ctl_4_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1155/ctl_5_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1155/ctl_6_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1155/ctl_7_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1155/ctl_8_
ctl formula name EisenbergMcGuire-PT-05-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1155/ctl_9_
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="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-05, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266300161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;