About the Execution of GreatSPN+red for DoubleLock-PT-p3s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15223.147 | 835949.00 | 2682299.00 | 839.30 | ?F???T?F??????F? | normal |
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.r135-tall-171631131500634.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 greatspnxred
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 r135-tall-171631131500634
=====================================================================
--------------------
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 1716397661120
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:07:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 17:07:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:07:42] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-22 17:07:42] [INFO ] Transformed 112 places.
[2024-05-22 17:07:42] [INFO ] Transformed 744 transitions.
[2024-05-22 17:07:42] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 20 places in 3 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 21 ms. Remains 89 /92 variables (removed 3) and now considering 712/712 (removed 0) transitions.
[2024-05-22 17:07:42] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2024-05-22 17:07:42] [INFO ] Computed 2 invariants in 21 ms
[2024-05-22 17:07:42] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 17:07:42] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:07:42] [INFO ] Invariant cache hit.
[2024-05-22 17:07:42] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 17:07:43] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-05-22 17:07:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:07:43] [INFO ] Invariant cache hit.
[2024-05-22 17:07:43] [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 21711 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 30040 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 52551ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 52593ms
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 11 ms. Remains 87 /89 variables (removed 2) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:08:35] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 87 cols
[2024-05-22 17:08:35] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 17:08:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 17:08:35] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:08:35] [INFO ] Invariant cache hit.
[2024-05-22 17:08:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:08:35] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 247 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 53342 ms. Remains : 87/92 places, 568/712 transitions.
Support contains 72 out of 87 places after structural reductions.
[2024-05-22 17:08:36] [INFO ] Flatten gal took : 69 ms
[2024-05-22 17:08:36] [INFO ] Flatten gal took : 40 ms
[2024-05-22 17:08:36] [INFO ] Input system was already deterministic with 568 transitions.
Reduction of identical properties reduced properties to check from 102 to 99
RANDOM walk for 40007 steps (476 resets) in 1851 ms. (21 steps per ms) remains 44/99 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (10 resets) in 77 ms. (51 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (10 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
[2024-05-22 17:08:37] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:08:37] [INFO ] Invariant cache hit.
[2024-05-22 17:08:37] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 383/443 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 36 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) 33/476 variables, 27/127 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 2/129 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/129 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/476 variables, 0/129 constraints. Problems are: Problem set: 6 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 129 constraints, problems are : Problem set: 6 solved, 30 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 6/54 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 377/431 variables, 54/55 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 36/91 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 0/91 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 45/476 variables, 33/124 constraints. Problems are: Problem set: 6 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 5/129 constraints. Problems are: Problem set: 6 solved, 30 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, 30/159 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/159 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/476 variables, 0/159 constraints. Problems are: Problem set: 24 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 159 constraints, problems are : Problem set: 24 solved, 12 unsolved in 1758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 30/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 2730ms problems are : Problem set: 24 solved, 12 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 33 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.2 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 29 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 29 ms. Remains : 84/87 places, 567/568 transitions.
RANDOM walk for 40005 steps (474 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (94 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (92 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (92 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (97 resets) in 72 ms. (548 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (87 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (88 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (91 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (88 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (92 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (87 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (104 resets) in 60 ms. (655 steps per ms) remains 9/11 properties
[2024-05-22 17:08:40] [INFO ] Flow matrix only has 388 transitions (discarded 179 similar events)
// Phase 1: matrix 388 rows 84 cols
[2024-05-22 17:08:40] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 17:08:40] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
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) 341/376 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 96/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 305 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) 341/376 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 96/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 901 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 1243ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 1 properties in 5454 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 34 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 34 ms. Remains : 84/84 places, 567/567 transitions.
RANDOM walk for 40001 steps (469 resets) in 86 ms. (459 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (88 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (88 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (87 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (90 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (93 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (93 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (89 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
[2024-05-22 17:08:47] [INFO ] Flow matrix only has 388 transitions (discarded 179 similar events)
[2024-05-22 17:08:47] [INFO ] Invariant cache hit.
[2024-05-22 17:08:47] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 335/368 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 104/472 variables, 51/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 23/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 126 constraints, problems are : Problem set: 0 solved, 7 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 335/368 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 104/472 variables, 51/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 23/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/472 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 133 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2558ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 27 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 14 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 14 ms. Remains : 84/84 places, 567/567 transitions.
RANDOM walk for 40013 steps (473 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (93 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (91 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (87 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (97 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (91 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (95 resets) in 28 ms. (1379 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (89 resets) in 28 ms. (1379 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 254942 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :3 out of 7
Probabilistic random walk after 254942 steps, saw 179494 distinct states, run finished after 3007 ms. (steps per millisecond=84 ) properties seen :3
[2024-05-22 17:08:53] [INFO ] Flow matrix only has 388 transitions (discarded 179 similar events)
[2024-05-22 17:08:53] [INFO ] Invariant cache hit.
[2024-05-22 17:08:53] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 258/279 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 188/467 variables, 58/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/472 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/472 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 126 constraints, problems are : Problem set: 0 solved, 4 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 258/279 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 188/467 variables, 58/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/472 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/472 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 130 constraints, problems are : Problem set: 0 solved, 4 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 833ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1260 ms.
Support contains 13 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 82 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 82 transition count 564
Applied a total of 4 rules in 19 ms. Remains 82 /84 variables (removed 2) and now considering 564/567 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 82/84 places, 564/567 transitions.
RANDOM walk for 40005 steps (467 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (91 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (88 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 249232 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 249232 steps, saw 175593 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-22 17:08:58] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
// Phase 1: matrix 385 rows 82 cols
[2024-05-22 17:08:58] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 17:08:58] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 258/279 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 183/462 variables, 56/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 31/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/467 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/467 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 124 constraints, problems are : Problem set: 0 solved, 4 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 258/279 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 183/462 variables, 56/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 31/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/467 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/467 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 128 constraints, problems are : Problem set: 0 solved, 4 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 699ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1349 ms.
Support contains 13 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 27 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 27 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 10 ms. Remains 82 /82 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2024-05-22 17:09:00] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:09:00] [INFO ] Invariant cache hit.
[2024-05-22 17:09:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 17:09:00] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:09:00] [INFO ] Invariant cache hit.
[2024-05-22 17:09:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:09:00] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-22 17:09:00] [INFO ] Redundant transitions in 29 ms returned []
Running 562 sub problems to find dead transitions.
[2024-05-22 17:09:00] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:09:00] [INFO ] Invariant cache hit.
[2024-05-22 17:09:00] [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 18884 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 30049 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 49359ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 49364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49660 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 1 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
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 76 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 193 place count 75 transition count 378
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 197 place count 75 transition count 378
Applied a total of 197 rules in 26 ms. Remains 75 /82 variables (removed 7) and now considering 378/564 (removed 186) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 378 rows 75 cols
[2024-05-22 17:09:50] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 17:09:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:09:50] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
TRAPS : Iteration 0
[2024-05-22 17:09:50] [INFO ] After 101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 17:09:50] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 17:09:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:09:50] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 17:09:50] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 17:09:50] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 539 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-05-22 17:09:50] [INFO ] Flatten gal took : 28 ms
[2024-05-22 17:09:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 17:09:50] [INFO ] Flatten gal took : 28 ms
[2024-05-22 17:09:51] [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-05-22 17:09:51] [INFO ] Flatten gal took : 25 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 26 ms
[2024-05-22 17:09:51] [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 2 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-05-22 17:09:51] [INFO ] Flatten gal took : 29 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 22 ms
[2024-05-22 17:09:51] [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-05-22 17:09:51] [INFO ] Flatten gal took : 19 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 21 ms
[2024-05-22 17:09:51] [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.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 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 12 ms. Remains : 81/87 places, 568/568 transitions.
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 18 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 18 ms
[2024-05-22 17:09:51] [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-05-22 17:09:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 18 ms
[2024-05-22 17:09:51] [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 3 ms. Remains : 81/87 places, 568/568 transitions.
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 15 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 17:09:51] [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 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-05-22 17:09:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 17:09:51] [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-05-22 17:09:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 15 ms
[2024-05-22 17:09:51] [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.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 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-05-22 17:09:51] [INFO ] Flatten gal took : 15 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 17:09:51] [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-05-22 17:09:51] [INFO ] Flatten gal took : 13 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 17:09:51] [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.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 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-05-22 17:09:51] [INFO ] Flatten gal took : 13 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 15 ms
[2024-05-22 17:09:51] [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-05-22 17:09:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 17:09:51] [INFO ] Flatten gal took : 15 ms
[2024-05-22 17:09:52] [INFO ] Input system was already deterministic with 568 transitions.
[2024-05-22 17:09:52] [INFO ] Flatten gal took : 15 ms
[2024-05-22 17:09:52] [INFO ] Flatten gal took : 16 ms
[2024-05-22 17:09:52] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-22 17:09:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 568 transitions and 2272 arcs took 4 ms.
Total runtime 129825 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p3s2
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 87
TRANSITIONS: 568
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 625
MODEL NAME: /home/mcc/execution/414/model
87 places, 568 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716398497069
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="greatspnxred"
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 greatspnxred"
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 r135-tall-171631131500634"
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 '
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 ;