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.r488-tall-171631133100634.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 DoubleLock-PT-p3s2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133100634
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 330K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-00
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-01
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-02
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-03
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-04
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-05
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-06
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-07
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-08
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-09
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-10
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2024-11
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2023-12
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2023-13
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2023-14
FORMULA_NAME DoubleLock-PT-p3s2-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717202655161

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:44:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:44:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:44:16] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-01 00:44:16] [INFO ] Transformed 112 places.
[2024-06-01 00:44:16] [INFO ] Transformed 744 transitions.
[2024-06-01 00:44:16] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 32 transitions.
Support contains 72 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 712/712 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 712
Applied a total of 3 rules in 22 ms. Remains 89 /92 variables (removed 3) and now considering 712/712 (removed 0) transitions.
[2024-06-01 00:44:16] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2024-06-01 00:44:16] [INFO ] Computed 2 invariants in 25 ms
[2024-06-01 00:44:16] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 00:44:16] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-06-01 00:44:16] [INFO ] Invariant cache hit.
[2024-06-01 00:44:16] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 00:44:16] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-06-01 00:44:17] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-06-01 00:44:17] [INFO ] Invariant cache hit.
[2024-06-01 00:44:17] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 20816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/604 variables, 0/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
After SMT, in 51591ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 51618ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 89/92 places, 568/712 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 568
Applied a total of 2 rules in 10 ms. Remains 87 /89 variables (removed 2) and now considering 568/568 (removed 0) transitions.
[2024-06-01 00:45:08] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 87 cols
[2024-06-01 00:45:08] [INFO ] Computed 1 invariants in 6 ms
[2024-06-01 00:45:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 00:45:08] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-06-01 00:45:08] [INFO ] Invariant cache hit.
[2024-06-01 00:45:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 00:45:08] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/92 places, 568/712 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52261 ms. Remains : 87/92 places, 568/712 transitions.
Support contains 72 out of 87 places after structural reductions.
[2024-06-01 00:45:09] [INFO ] Flatten gal took : 75 ms
[2024-06-01 00:45:09] [INFO ] Flatten gal took : 42 ms
[2024-06-01 00:45:09] [INFO ] Input system was already deterministic with 568 transitions.
Reduction of identical properties reduced properties to check from 102 to 99
RANDOM walk for 40009 steps (468 resets) in 1020 ms. (39 steps per ms) remains 48/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (11 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 40/41 properties
[2024-06-01 00:45:09] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-06-01 00:45:09] [INFO ] Invariant cache hit.
[2024-06-01 00:45:09] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 384/447 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 5 (OVERLAPS) 29/476 variables, 24/127 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 2/129 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/129 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/476 variables, 0/129 constraints. Problems are: Problem set: 6 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 129 constraints, problems are : Problem set: 6 solved, 34 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 6/56 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 379/435 variables, 56/57 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 35/92 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 0/92 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 41/476 variables, 31/123 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 6/129 constraints. Problems are: Problem set: 6 solved, 34 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 34/163 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/163 constraints. Problems are: Problem set: 24 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 163 constraints, problems are : Problem set: 24 solved, 16 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 34/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 6097ms problems are : Problem set: 24 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 568/568 transitions.
Graph (complete) has 952 edges and 87 vertex of which 84 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output 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 2 place count 84 transition count 567
Applied a total of 2 rules in 32 ms. Remains 84 /87 variables (removed 3) and now considering 567/568 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 84/87 places, 567/568 transitions.
RANDOM walk for 40006 steps (470 resets) in 191 ms. (208 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (90 resets) in 49 ms. (800 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (86 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (94 resets) in 78 ms. (506 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (95 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (91 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (90 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (90 resets) in 87 ms. (454 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (90 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (88 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (90 resets) in 33 ms. (1176 steps per ms) remains 9/10 properties
[2024-06-01 00:45:16] [INFO ] Flow matrix only has 388 transitions (discarded 179 similar events)
// Phase 1: matrix 388 rows 84 cols
[2024-06-01 00:45:16] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 00:45:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 6/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 344/379 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 93/472 variables, 49/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 23/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 126 constraints, problems are : Problem set: 0 solved, 9 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 6/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 344/379 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 93/472 variables, 49/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 23/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/472 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 135 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2637ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 5298 ms.
Support contains 29 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 567/567 transitions.
Applied a total of 0 rules in 22 ms. Remains 84 /84 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 84/84 places, 567/567 transitions.
RANDOM walk for 40018 steps (469 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (91 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (89 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (89 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (94 resets) in 41 ms. (952 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (92 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (92 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (90 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (86 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
[2024-06-01 00:45:24] [INFO ] Flow matrix only has 388 transitions (discarded 179 similar events)
[2024-06-01 00:45:24] [INFO ] Invariant cache hit.
[2024-06-01 00:45:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 333/364 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 108/472 variables, 53/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 25/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 126 constraints, problems are : Problem set: 0 solved, 8 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 333/364 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 108/472 variables, 53/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 25/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/472 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 134 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1609ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 25 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 567/567 transitions.
Graph (complete) has 931 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 83 /84 variables (removed 1) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 83/84 places, 567/567 transitions.
RANDOM walk for 40014 steps (460 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (90 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (94 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (86 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (99 resets) in 36 ms. (1081 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (89 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (94 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (89 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (91 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
[2024-06-01 00:45:26] [INFO ] Flow matrix only has 388 transitions (discarded 179 similar events)
// Phase 1: matrix 388 rows 83 cols
[2024-06-01 00:45:26] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 00:45:26] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 327/357 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 114/471 variables, 53/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 125 constraints, problems are : Problem set: 0 solved, 7 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 327/357 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 114/471 variables, 53/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/471 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 132 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1468ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 24 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 567/567 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 83 transition count 566
Applied a total of 1 rules in 13 ms. Remains 83 /83 variables (removed 0) and now considering 566/567 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 83/83 places, 566/567 transitions.
RANDOM walk for 40011 steps (468 resets) in 96 ms. (412 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (88 resets) in 95 ms. (416 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (90 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (91 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
[2024-06-01 00:45:28] [INFO ] Flow matrix only has 387 transitions (discarded 179 similar events)
// Phase 1: matrix 387 rows 83 cols
[2024-06-01 00:45:28] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 00:45:28] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 327/357 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 113/470 variables, 53/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/470 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 125 constraints, problems are : Problem set: 0 solved, 5 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 327/357 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 113/470 variables, 53/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 130 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 566/566 transitions.
Applied a total of 0 rules in 10 ms. Remains 83 /83 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 83/83 places, 566/566 transitions.
RANDOM walk for 40015 steps (466 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (99 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (93 resets) in 39 ms. (1000 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (91 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (88 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
[2024-06-01 00:45:29] [INFO ] Flow matrix only has 387 transitions (discarded 179 similar events)
[2024-06-01 00:45:29] [INFO ] Invariant cache hit.
[2024-06-01 00:45:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 317/346 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 124/470 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 29/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/470 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 125 constraints, problems are : Problem set: 0 solved, 4 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 317/346 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 124/470 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 29/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1074ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2427 ms.
Support contains 23 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 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 83 transition count 565
Applied a total of 1 rules in 11 ms. Remains 83 /83 variables (removed 0) and now considering 565/566 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 83/83 places, 565/566 transitions.
RANDOM walk for 40018 steps (463 resets) in 79 ms. (500 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (95 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
[2024-06-01 00:45:33] [INFO ] Flow matrix only has 386 transitions (discarded 179 similar events)
// Phase 1: matrix 386 rows 83 cols
[2024-06-01 00:45:33] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 00:45:33] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 307/334 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 135/469 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 29/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/469 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 125 constraints, problems are : Problem set: 0 solved, 3 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 307/334 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 135/469 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 29/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/469 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 128 constraints, problems are : Problem set: 0 solved, 3 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1022ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 565/565 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 83/83 places, 565/565 transitions.
RANDOM walk for 40001 steps (468 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (88 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (92 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (93 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 578892 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :1 out of 3
Probabilistic random walk after 578892 steps, saw 414391 distinct states, run finished after 3005 ms. (steps per millisecond=192 ) properties seen :1
[2024-06-01 00:45:37] [INFO ] Flow matrix only has 386 transitions (discarded 179 similar events)
[2024-06-01 00:45:37] [INFO ] Invariant cache hit.
[2024-06-01 00:45:37] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 254/274 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 190/464 variables, 58/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/469 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/469 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 254/274 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 190/464 variables, 58/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/469 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/469 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 643ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 195 ms.
Support contains 12 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 565/565 transitions.
Graph (complete) has 924 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 82 transition count 564
Applied a total of 2 rules in 9 ms. Remains 82 /83 variables (removed 1) and now considering 564/565 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/83 places, 564/565 transitions.
RANDOM walk for 40000 steps (466 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (87 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 596219 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 2
Probabilistic random walk after 596219 steps, saw 412436 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2024-06-01 00:45:41] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
// Phase 1: matrix 385 rows 82 cols
[2024-06-01 00:45:41] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 00:45:41] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 254/274 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 188/462 variables, 57/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 31/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/467 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/467 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 124 constraints, problems are : Problem set: 0 solved, 2 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 254/274 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 188/462 variables, 57/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 31/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/467 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/467 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 237 ms.
Support contains 12 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 564/564 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 564/564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 564/564 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2024-06-01 00:45:42] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-06-01 00:45:42] [INFO ] Invariant cache hit.
[2024-06-01 00:45:42] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 00:45:42] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-06-01 00:45:42] [INFO ] Invariant cache hit.
[2024-06-01 00:45:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 00:45:42] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-06-01 00:45:42] [INFO ] Redundant transitions in 30 ms returned []
Running 562 sub problems to find dead transitions.
[2024-06-01 00:45:42] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-06-01 00:45:42] [INFO ] Invariant cache hit.
[2024-06-01 00:45:42] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 385/466 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 5 (OVERLAPS) 1/467 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 562 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 124 constraints, problems are : Problem set: 0 solved, 562 unsolved in 18639 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 385/466 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 417/540 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 6 (OVERLAPS) 1/467 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 686 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 0/0 constraints]
After SMT, in 49096ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 49101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49386 ms. Remains : 82/82 places, 564/564 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 82 transition count 385
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 179 place count 82 transition count 379
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 191 place count 76 transition count 379
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 1 with 2 rules applied. Total rules applied 193 place count 75 transition count 378
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 75 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 195 place count 74 transition count 377
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 74 transition count 377
Applied a total of 199 rules in 27 ms. Remains 74 /82 variables (removed 8) and now considering 377/564 (removed 187) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 377 rows 74 cols
[2024-06-01 00:46:31] [INFO ] Computed 1 invariants in 5 ms
[2024-06-01 00:46:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 00:46:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:46:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 00:46:32] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:46:32] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:46:32] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 326 ms.
Successfully simplified 25 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 30 ms
[2024-06-01 00:46:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 32 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Support contains 61 out of 87 places (down from 65) after GAL structural reductions.
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1074 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 82 transition count 568
Applied a total of 5 rules in 3 ms. Remains 82 /87 variables (removed 5) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 82/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 25 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 27 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 83 transition count 568
Applied a total of 4 rules in 3 ms. Remains 83 /87 variables (removed 4) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 83/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 21 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 568
Applied a total of 6 rules in 2 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 24 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Graph (complete) has 1074 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Graph (complete) has 1074 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 568
Applied a total of 6 rules in 3 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 82 transition count 568
Applied a total of 5 rules in 1 ms. Remains 82 /87 variables (removed 5) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 82/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:46:32] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 568
Applied a total of 6 rules in 2 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:46:32] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:46:33] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Graph (complete) has 1074 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:46:33] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 568
Applied a total of 6 rules in 2 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:46:33] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Graph (complete) has 1074 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:46:33] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 568/568 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 568
Applied a total of 6 rules in 2 ms. Remains 81 /87 variables (removed 6) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 81/87 places, 568/568 transitions.
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:46:33] [INFO ] Input system was already deterministic with 568 transitions.
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:46:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:46:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:46:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 568 transitions and 2272 arcs took 3 ms.
Total runtime 137125 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-00
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-02
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-03
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-04
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-06
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-08
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-09
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-10
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2024-11
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2023-12
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2023-13
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLFireability-2023-15

BK_STOP 1717202793702

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/619/ctl_0_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/619/ctl_1_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/619/ctl_2_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/619/ctl_3_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/619/ctl_4_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/619/ctl_5_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/619/ctl_6_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/619/ctl_7_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/619/ctl_8_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/619/ctl_9_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/619/ctl_10_
ctl formula name DoubleLock-PT-p3s2-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/619/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleLock-PT-p3s2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DoubleLock-PT-p3s2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631133100634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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