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.r466-smll-171620124200008.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 ASLink-PT-01a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124200008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 201K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717181848648

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:57:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 18:57:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:57:31] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2024-05-31 18:57:31] [INFO ] Transformed 431 places.
[2024-05-31 18:57:31] [INFO ] Transformed 735 transitions.
[2024-05-31 18:57:31] [INFO ] Found NUPN structural information;
[2024-05-31 18:57:31] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 522 ms.
Structural test allowed to assert that 45 places are NOT stable. Took 29 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
RANDOM walk for 40000 steps (766 resets) in 2578 ms. (15 steps per ms) remains 17/386 properties
BEST_FIRST walk for 4001 steps (27 resets) in 114 ms. (34 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (27 resets) in 56 ms. (70 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (29 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (29 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (28 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (25 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (35 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (26 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (27 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (33 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (25 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
// Phase 1: matrix 728 rows 431 cols
[2024-05-31 18:57:33] [INFO ] Computed 80 invariants in 87 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 29/46 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 29/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 65/111 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 65/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 309/420 variables, 52/185 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 309/494 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 11/431 variables, 6/500 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 11/511 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 942 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3027 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 29/46 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 29/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 65/111 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 65/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 309/420 variables, 52/185 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 309/494 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-31 18:57:37] [INFO ] Deduced a trap composed of 138 places in 629 ms of which 85 ms to minimize.
[2024-05-31 18:57:38] [INFO ] Deduced a trap composed of 160 places in 427 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 11/431 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 11/513 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 728/1159 variables, 431/944 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1159 variables, 17/961 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1159 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 961 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5021 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 8247ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 425 transition count 697
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 68 place count 394 transition count 697
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 68 place count 394 transition count 668
Deduced a syphon composed of 29 places in 15 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 137 place count 354 transition count 668
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 354 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 353 transition count 667
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 349 transition count 650
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 148 place count 348 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 154 place count 347 transition count 645
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 344 transition count 645
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 343 transition count 637
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 343 transition count 637
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 629
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 629
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 613
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 613
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 597
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 597
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 589
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 589
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 581
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 581
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 573
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 573
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 565
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 565
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 557
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 557
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 549
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 549
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 541
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 541
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 330 transition count 533
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 330 transition count 533
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 329 transition count 525
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 329 transition count 525
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 328 transition count 517
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 328 transition count 517
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 203 place count 321 transition count 510
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 321 transition count 510
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 320 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 206 place count 319 transition count 509
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 206 place count 319 transition count 508
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 208 place count 318 transition count 508
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 209 place count 317 transition count 508
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 8 with 2 rules applied. Total rules applied 211 place count 316 transition count 507
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 212 place count 315 transition count 506
Iterating global reduction 8 with 1 rules applied. Total rules applied 213 place count 315 transition count 506
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 214 place count 315 transition count 505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 215 place count 314 transition count 505
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 216 place count 314 transition count 505
Applied a total of 216 rules in 743 ms. Remains 314 /431 variables (removed 117) and now considering 505/728 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 764 ms. Remains : 314/431 places, 505/728 transitions.
RANDOM walk for 4000000 steps (85624 resets) in 19221 ms. (208 steps per ms) remains 1/17 properties
BEST_FIRST walk for 4000001 steps (37502 resets) in 4171 ms. (958 steps per ms) remains 1/1 properties
// Phase 1: matrix 505 rows 314 cols
[2024-05-31 18:57:49] [INFO ] Computed 59 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/147 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/205 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/211 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 102/313 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/314 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 505/819 variables, 314/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/819 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/819 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/147 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/205 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/211 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 102/313 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/314 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 505/819 variables, 314/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/819 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/819 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/819 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 505/505 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 314 transition count 504
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 312 transition count 504
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 312 transition count 501
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 308 transition count 501
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 307 transition count 501
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 307 transition count 500
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 306 transition count 500
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 305 transition count 499
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 305 transition count 499
Applied a total of 16 rules in 59 ms. Remains 305 /314 variables (removed 9) and now considering 499/505 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 305/314 places, 499/505 transitions.
RANDOM walk for 4000000 steps (85851 resets) in 9078 ms. (440 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (37391 resets) in 4028 ms. (992 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2077014 steps, run timeout after 9001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 2077014 steps, saw 623868 distinct states, run finished after 9007 ms. (steps per millisecond=230 ) properties seen :0
// Phase 1: matrix 499 rows 305 cols
[2024-05-31 18:58:03] [INFO ] Computed 56 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/48 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/190 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 44/234 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/302 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/305 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 499/804 variables, 305/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/804 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/804 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 361 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/48 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/190 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 44/234 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/302 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/305 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 499/804 variables, 305/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/804 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/804 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/804 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 732ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 499/499 transitions.
Applied a total of 0 rules in 21 ms. Remains 305 /305 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 305/305 places, 499/499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 499/499 transitions.
Applied a total of 0 rules in 23 ms. Remains 305 /305 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-05-31 18:58:04] [INFO ] Invariant cache hit.
[2024-05-31 18:58:04] [INFO ] Implicit Places using invariants in 537 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 140, 151, 152, 153, 171, 173, 176, 194, 195, 196, 197, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269]
[2024-05-31 18:58:04] [INFO ] Actually due to overlaps returned [171, 153, 30, 48, 176, 152, 195, 151, 173, 194, 0, 18, 19, 66, 197, 239, 257, 269, 139, 140, 196, 209, 215, 221, 227, 233, 245, 251, 263]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 550 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 276/305 places, 499/499 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 275 transition count 453
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 229 transition count 453
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 93 place count 229 transition count 442
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 116 place count 217 transition count 442
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 128 place count 213 transition count 434
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 136 place count 205 transition count 434
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 151 place count 190 transition count 419
Iterating global reduction 4 with 15 rules applied. Total rules applied 166 place count 190 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 169 place count 190 transition count 416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 169 place count 190 transition count 415
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 189 transition count 415
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 174 place count 186 transition count 412
Iterating global reduction 5 with 3 rules applied. Total rules applied 177 place count 186 transition count 412
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 185 transition count 411
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 185 transition count 411
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 184 transition count 410
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 184 transition count 410
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 217 place count 166 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 166 transition count 391
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 219 place count 165 transition count 390
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 165 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 165 transition count 389
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 223 place count 165 transition count 387
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 226 place count 162 transition count 387
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 229 place count 162 transition count 387
Applied a total of 229 rules in 83 ms. Remains 162 /276 variables (removed 114) and now considering 387/499 (removed 112) transitions.
// Phase 1: matrix 387 rows 162 cols
[2024-05-31 18:58:04] [INFO ] Computed 20 invariants in 3 ms
[2024-05-31 18:58:05] [INFO ] Implicit Places using invariants in 221 ms returned [73, 90, 96, 99, 101]
[2024-05-31 18:58:05] [INFO ] Actually due to overlaps returned [90, 96, 101, 73]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 224 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 158/305 places, 387/499 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 154 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 154 transition count 383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 153 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 153 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 151 transition count 380
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 151 transition count 377
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 148 transition count 377
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 148 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 147 transition count 376
Applied a total of 22 rules in 37 ms. Remains 147 /158 variables (removed 11) and now considering 376/387 (removed 11) transitions.
// Phase 1: matrix 376 rows 147 cols
[2024-05-31 18:58:05] [INFO ] Computed 16 invariants in 3 ms
[2024-05-31 18:58:05] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-31 18:58:05] [INFO ] Invariant cache hit.
[2024-05-31 18:58:05] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/305 places, 376/499 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1528 ms. Remains : 147/305 places, 376/499 transitions.
RANDOM walk for 4000000 steps (115817 resets) in 6112 ms. (654 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (62302 resets) in 3698 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 59817 steps, run visited all 1 properties in 217 ms. (steps per millisecond=275 )
Probabilistic random walk after 59817 steps, saw 27162 distinct states, run finished after 229 ms. (steps per millisecond=261 ) properties seen :1
Able to resolve query StableMarking after proving 387 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 37243 ms.
ITS solved all properties within timeout

BK_STOP 1717181888451

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="ASLink-PT-01a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ASLink-PT-01a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r466-smll-171620124200008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;