Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r210-tall-174894547400342.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ShieldIIPt-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547400342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 512K May 29 14:32 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749026036144

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 08:33:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-04 08:33:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:33:57] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-06-04 08:33:57] [INFO ] Transformed 2103 places.
[2025-06-04 08:33:57] [INFO ] Transformed 1953 transitions.
[2025-06-04 08:33:57] [INFO ] Found NUPN structural information;
[2025-06-04 08:33:57] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 331 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 2103 transition count 1441
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 514 rules applied. Total rules applied 1026 place count 1591 transition count 1439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1027 place count 1590 transition count 1439
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 1027 place count 1590 transition count 1318
Deduced a syphon composed of 121 places in 21 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1269 place count 1469 transition count 1318
Performed 809 Post agglomeration using F-continuation condition.Transition count delta: 809
Deduced a syphon composed of 809 places in 1 ms
Reduce places removed 809 places and 0 transitions.
Iterating global reduction 3 with 1618 rules applied. Total rules applied 2887 place count 660 transition count 509
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 3065 place count 571 transition count 568
Applied a total of 3065 rules in 369 ms. Remains 571 /2103 variables (removed 1532) and now considering 568/1953 (removed 1385) transitions.
// Phase 1: matrix 568 rows 571 cols
[2025-06-04 08:33:58] [INFO ] Computed 271 invariants in 22 ms
[2025-06-04 08:33:58] [INFO ] Implicit Places using invariants in 599 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 629 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 569/2103 places, 568/1953 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 567
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 567
Applied a total of 2 rules in 15 ms. Remains 568 /569 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 568 cols
[2025-06-04 08:33:58] [INFO ] Computed 269 invariants in 10 ms
[2025-06-04 08:33:59] [INFO ] Implicit Places using invariants in 350 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 567/2103 places, 567/1953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 566
Applied a total of 2 rules in 12 ms. Remains 566 /567 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 566 cols
[2025-06-04 08:33:59] [INFO ] Computed 268 invariants in 4 ms
[2025-06-04 08:33:59] [INFO ] Implicit Places using invariants in 332 ms returned []
[2025-06-04 08:33:59] [INFO ] Invariant cache hit.
[2025-06-04 08:33:59] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-04 08:34:03] [INFO ] Implicit Places using invariants and state equation in 3496 ms returned []
Implicit Place search using SMT with State Equation took 3832 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 566/2103 places, 566/1953 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 5228 ms. Remains : 566/2103 places, 566/1953 transitions.
Discarding 267 transitions out of 566. Remains 299
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 3322 ms. (12 steps per ms) remains 121/298 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 121/121 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 121/121 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 121/121 properties
[2025-06-04 08:34:04] [INFO ] Invariant cache hit.
[2025-06-04 08:34:04] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 12/249 variables, 118/355 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 12/367 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 317/566 variables, 150/517 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 317/834 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1131/1132 variables, and 1666 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5021 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 12/249 variables, 118/355 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 12/367 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 317/566 variables, 150/517 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 317/834 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 121/1787 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/1132 variables, and 1787 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5016 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 10138ms problems are : Problem set: 0 solved, 121 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 237 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 566/566 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 565
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 18 place count 566 transition count 565
Applied a total of 18 rules in 64 ms. Remains 566 /566 variables (removed 0) and now considering 565/566 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 566/566 places, 565/566 transitions.
RANDOM walk for 4000000 steps (8 resets) in 49999 ms. (80 steps per ms) remains 27/121 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1695 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1661 ms. (240 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1645 ms. (243 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1678 ms. (238 steps per ms) remains 25/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1662 ms. (240 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1653 ms. (241 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1630 ms. (245 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1672 ms. (239 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1638 ms. (244 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1643 ms. (243 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1668 ms. (239 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1617 ms. (247 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1660 ms. (240 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1683 ms. (237 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1669 ms. (239 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1676 ms. (238 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1648 ms. (242 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1811 ms. (220 steps per ms) remains 21/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1885 ms. (212 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1949 ms. (205 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1698 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1703 ms. (234 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1677 ms. (238 steps per ms) remains 21/21 properties
// Phase 1: matrix 565 rows 566 cols
[2025-06-04 08:34:38] [INFO ] Computed 268 invariants in 3 ms
[2025-06-04 08:34:38] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 5/49 variables, 23/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 517/566 variables, 245/317 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 517/834 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1917 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 5/49 variables, 23/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 517/566 variables, 245/317 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 517/834 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 21/1687 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1687 constraints, problems are : Problem set: 0 solved, 21 unsolved in 16506 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 18446ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 5638 ms.
Support contains 44 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 566 transition count 565
Applied a total of 10 rules in 53 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 566/566 places, 565/565 transitions.
RANDOM walk for 4000000 steps (8 resets) in 37795 ms. (105 steps per ms) remains 19/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1682 ms. (237 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1688 ms. (236 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1694 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1702 ms. (234 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1691 ms. (236 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1708 ms. (234 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1692 ms. (236 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1689 ms. (236 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1701 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1688 ms. (236 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1694 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1685 ms. (237 steps per ms) remains 10/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1649 ms. (242 steps per ms) remains 10/10 properties
// Phase 1: matrix 565 rows 566 cols
[2025-06-04 08:35:19] [INFO ] Computed 268 invariants in 9 ms
[2025-06-04 08:35:19] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 538/566 variables, 255/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 538/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1062 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 538/566 variables, 255/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 538/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 10/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1676 constraints, problems are : Problem set: 0 solved, 10 unsolved in 20735 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 21825ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 34025 ms.
Support contains 22 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 565
Applied a total of 1 rules in 32 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 566/566 places, 565/565 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30156 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 16254 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16224 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16259 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 16620 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16619 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16656 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16253 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 16222 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16595 ms. (241 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16811 ms. (237 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 6695609 steps, run timeout after 150001 ms. (steps per millisecond=44 ) properties seen :0 out of 10
Probabilistic random walk after 6695609 steps, saw 5219426 distinct states, run finished after 150006 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 565 rows 566 cols
[2025-06-04 08:39:36] [INFO ] Computed 268 invariants in 2 ms
[2025-06-04 08:39:36] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 538/566 variables, 255/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 538/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1236 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 538/566 variables, 255/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 538/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 10/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1676 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4615 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 5873ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 14998 ms.
Support contains 22 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Applied a total of 0 rules in 23 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 566/566 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Applied a total of 0 rules in 12 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2025-06-04 08:39:57] [INFO ] Invariant cache hit.
[2025-06-04 08:39:57] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-06-04 08:39:57] [INFO ] Invariant cache hit.
[2025-06-04 08:39:57] [INFO ] State equation strengthened by 266 read => feed constraints.
[2025-06-04 08:39:59] [INFO ] Implicit Places using invariants and state equation in 2527 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
[2025-06-04 08:39:59] [INFO ] Redundant transitions in 34 ms returned []
Running 564 sub problems to find dead transitions.
[2025-06-04 08:39:59] [INFO ] Invariant cache hit.
[2025-06-04 08:39:59] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 565/565 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/566 variables, 268/833 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30031 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 565/565 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/566 variables, 268/833 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1131 variables, 564/2230 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 2230 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30017 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63141 ms. Remains : 566/566 places, 565/565 transitions.
RANDOM walk for 400000 steps (8 resets) in 4752 ms. (84 steps per ms) remains 11/22 properties
Running SMT prover for 11 properties.
[2025-06-04 08:41:01] [INFO ] Invariant cache hit.
[2025-06-04 08:41:01] [INFO ] [Real]Absence check using 268 positive place invariants in 38 ms returned sat
[2025-06-04 08:41:01] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2025-06-04 08:41:01] [INFO ] State equation strengthened by 266 read => feed constraints.
[2025-06-04 08:41:02] [INFO ] After 271ms SMT Verify possible using 266 Read/Feed constraints in real domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-04 08:41:02] [INFO ] After 792ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-04 08:41:02] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-04 08:41:02] [INFO ] [Nat]Absence check using 268 positive place invariants in 40 ms returned sat
[2025-06-04 08:41:02] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2025-06-04 08:41:03] [INFO ] After 266ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-04 08:41:03] [INFO ] After 801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2025-06-04 08:41:03] [INFO ] After 1268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
RANDOM walk for 4000000 steps (8 resets) in 40913 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3381375 steps (8 resets) in 18273 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3591660 steps (8 resets) in 18746 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3813349 steps (8 resets) in 19057 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3609262 steps (8 resets) in 18528 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 16165 ms. (247 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16208 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 16174 ms. (247 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16306 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16649 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 16336 ms. (244 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 7901319 steps, run timeout after 168001 ms. (steps per millisecond=47 ) properties seen :0 out of 10
Probabilistic random walk after 7901319 steps, saw 6148241 distinct states, run finished after 168003 ms. (steps per millisecond=47 ) properties seen :0
[2025-06-04 08:44:48] [INFO ] Invariant cache hit.
[2025-06-04 08:44:48] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 538/566 variables, 255/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 538/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1057 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 538/566 variables, 255/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 538/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 10/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1676 constraints, problems are : Problem set: 0 solved, 10 unsolved in 25416 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 26493ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 776 steps, including 0 resets, run visited all 10 properties in 39 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 49 ms.
Able to resolve query QuasiLiveness after proving 299 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 677632 ms.
ITS solved all properties within timeout

BK_STOP 1749026715252

--------------------
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 QuasiLiveness -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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ShieldIIPt-PT-030B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tall-174894547400342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;