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.r575-smll-171734919600087.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 MedleyA-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16:33 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 MedleyA-PT-11-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717362689074

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:11:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:11:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:11:32] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2024-06-02 21:11:32] [INFO ] Transformed 150 places.
[2024-06-02 21:11:32] [INFO ] Transformed 478 transitions.
[2024-06-02 21:11:32] [INFO ] Found NUPN structural information;
[2024-06-02 21:11:32] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
RANDOM walk for 40000 steps (3148 resets) in 3307 ms. (12 steps per ms) remains 13/16 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (554 resets) in 412 ms. (96 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (435 resets) in 1717 ms. (23 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (535 resets) in 366 ms. (108 steps per ms) remains 12/13 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (556 resets) in 283 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (540 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (541 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (555 resets) in 272 ms. (146 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (492 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (443 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (548 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (540 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (424 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (471 resets) in 308 ms. (129 steps per ms) remains 12/12 properties
[2024-06-02 21:11:34] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 21:11:34] [INFO ] Computed 23 invariants in 21 ms
[2024-06-02 21:11:34] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 19/117 variables, 9/109 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 19/128 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 30/147 variables, 12/140 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 30/170 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 394/541 variables, 147/317 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 171/488 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 6/547 variables, 3/491 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 3/494 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 1 solved, 11 unsolved in 2391 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 21/115 variables, 9/104 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 21/125 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 32/147 variables, 13/138 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 32/170 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 21:11:38] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 26 ms to minimize.
[2024-06-02 21:11:38] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 3 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 6/176 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 394/541 variables, 147/323 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 171/494 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 1/495 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 21:11:40] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:11:40] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:11:40] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-06-02 21:11:41] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:11:41] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:11:41] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 6/501 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 21:11:41] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:11:42] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 6 ms to minimize.
[2024-06-02 21:11:42] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 3/504 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 21:11:42] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:11:42] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:11:43] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
SMT process timed out in 8409ms, After SMT, problems are : Problem set: 3 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 126 transition count 435
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 126 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 126 transition count 432
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 126 transition count 432
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 122 transition count 426
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 122 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 122 transition count 418
Applied a total of 70 rules in 202 ms. Remains 122 /150 variables (removed 28) and now considering 418/469 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 122/150 places, 418/469 transitions.
RANDOM walk for 40000 steps (3278 resets) in 1628 ms. (24 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (425 resets) in 627 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (567 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (577 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (566 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (573 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (505 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (560 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (454 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
[2024-06-02 21:11:44] [INFO ] Flow matrix only has 350 transitions (discarded 68 similar events)
// Phase 1: matrix 350 rows 122 cols
[2024-06-02 21:11:44] [INFO ] Computed 23 invariants in 4 ms
[2024-06-02 21:11:44] [INFO ] State equation strengthened by 167 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 22/122 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 350/472 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/472 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 312 constraints, problems are : Problem set: 0 solved, 8 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 122/122 constraints, ReadFeed: 167/167 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:11:46] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/122 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:11:46] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:11:46] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 3 ms to minimize.
[2024-06-02 21:11:46] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:11:46] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:11:47] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:11:47] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 350/472 variables, 122/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 167/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:11:48] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:11:49] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:11:49] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/472 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 330 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6423 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 122/122 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 10/10 constraints]
After SMT, in 7690ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 2186 ms.
Support contains 71 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 418/418 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 114 transition count 405
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 114 transition count 405
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 114 transition count 405
Applied a total of 17 rules in 32 ms. Remains 114 /122 variables (removed 8) and now considering 405/418 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 114/122 places, 405/418 transitions.
RANDOM walk for 40000 steps (3263 resets) in 337 ms. (118 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (432 resets) in 470 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (564 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (581 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 448483 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 3
Probabilistic random walk after 448483 steps, saw 91431 distinct states, run finished after 3009 ms. (steps per millisecond=149 ) properties seen :0
[2024-06-02 21:11:58] [INFO ] Flow matrix only has 337 transitions (discarded 68 similar events)
// Phase 1: matrix 337 rows 114 cols
[2024-06-02 21:11:58] [INFO ] Computed 23 invariants in 3 ms
[2024-06-02 21:11:58] [INFO ] State equation strengthened by 167 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/114 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 337/451 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 167/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 304 constraints, problems are : Problem set: 0 solved, 3 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 167/167 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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/114 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:11:58] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:11:59] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:11:59] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 337/451 variables, 114/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 167/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:12:00] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:12:00] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:12:00] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:12:01] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/451 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/451 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 314 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4160 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 4758ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 671 ms.
Support contains 71 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 405/405 transitions.
Applied a total of 0 rules in 10 ms. Remains 114 /114 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 114/114 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 405/405 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-06-02 21:12:03] [INFO ] Flow matrix only has 337 transitions (discarded 68 similar events)
[2024-06-02 21:12:03] [INFO ] Invariant cache hit.
[2024-06-02 21:12:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:12:03] [INFO ] Flow matrix only has 337 transitions (discarded 68 similar events)
[2024-06-02 21:12:03] [INFO ] Invariant cache hit.
[2024-06-02 21:12:03] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-06-02 21:12:03] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 21:12:03] [INFO ] Redundant transitions in 40 ms returned []
Running 404 sub problems to find dead transitions.
[2024-06-02 21:12:03] [INFO ] Flow matrix only has 337 transitions (discarded 68 similar events)
[2024-06-02 21:12:03] [INFO ] Invariant cache hit.
[2024-06-02 21:12:03] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/114 variables, 9/23 constraints. Problems are: Problem set: 104 solved, 300 unsolved
[2024-06-02 21:12:09] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-06-02 21:12:09] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:12:09] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:12:09] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:12:09] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2024-06-02 21:12:10] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:12:10] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:12:10] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:12:10] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:12:10] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:12:10] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:12:10] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:12:11] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 20/43 constraints. Problems are: Problem set: 104 solved, 300 unsolved
[2024-06-02 21:12:13] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:12:13] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 19 ms to minimize.
[2024-06-02 21:12:13] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2024-06-02 21:12:15] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:12:15] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:12:16] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 20/63 constraints. Problems are: Problem set: 104 solved, 300 unsolved
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:12:17] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:12:19] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:12:19] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-06-02 21:12:19] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 6/69 constraints. Problems are: Problem set: 104 solved, 300 unsolved
[2024-06-02 21:12:21] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/70 constraints. Problems are: Problem set: 104 solved, 300 unsolved
[2024-06-02 21:12:23] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 1/71 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/71 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 337/451 variables, 114/185 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 167/352 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/352 constraints. Problems are: Problem set: 104 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 352 constraints, problems are : Problem set: 104 solved, 300 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 104 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 14/14 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 9/23 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 48/71 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/71 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 337/451 variables, 114/185 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 167/352 constraints. Problems are: Problem set: 104 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 300/652 constraints. Problems are: Problem set: 104 solved, 300 unsolved
[2024-06-02 21:12:51] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:12:51] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:12:52] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:12:52] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 2 ms to minimize.
[2024-06-02 21:12:54] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:12:54] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:12:58] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:12:59] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:13:00] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 12/664 constraints. Problems are: Problem set: 104 solved, 300 unsolved
[2024-06-02 21:13:04] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2024-06-02 21:13:05] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
SMT process timed out in 61172ms, After SMT, problems are : Problem set: 104 solved, 300 unsolved
Search for dead transitions found 104 dead transitions in 61187ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 114/114 places, 301/405 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-02 21:13:05] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61594 ms. Remains : 114/114 places, 301/405 transitions.
RANDOM walk for 40000 steps (3284 resets) in 432 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (445 resets) in 605 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (571 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (559 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 618732 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 3
Probabilistic random walk after 618732 steps, saw 117039 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 301 rows 114 cols
[2024-06-02 21:13:08] [INFO ] Computed 23 invariants in 5 ms
[2024-06-02 21:13:08] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/114 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 301/415 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 131/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/415 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 268 constraints, problems are : Problem set: 0 solved, 3 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 131/131 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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/114 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:13:09] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:13:09] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:13:09] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 301/415 variables, 114/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 131/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:13:10] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:13:10] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/415 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 276 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2484 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 2953ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 402 ms.
Support contains 71 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 301/301 transitions.
Applied a total of 0 rules in 24 ms. Remains 114 /114 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 114/114 places, 301/301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 301/301 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-02 21:13:11] [INFO ] Invariant cache hit.
[2024-06-02 21:13:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 21:13:12] [INFO ] Invariant cache hit.
[2024-06-02 21:13:12] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-02 21:13:12] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-02 21:13:12] [INFO ] Redundant transitions in 4 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 21:13:12] [INFO ] Invariant cache hit.
[2024-06-02 21:13:12] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:13:17] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:13:17] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:13:17] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:13:17] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:13:17] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:13:18] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:13:18] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:13:18] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:13:18] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:13:18] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:13:19] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:13:19] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:13:19] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:13:21] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:13:21] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:13:23] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 301/415 variables, 114/162 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 131/293 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 293 constraints, problems are : Problem set: 0 solved, 300 unsolved in 27778 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/415 variables, 114/162 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 131/293 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 300/593 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:13:50] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:13:51] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:13:52] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:13:52] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:13:52] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:13:56] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 6/599 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 21:14:01] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:14:07] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:14:07] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:14:08] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:14:08] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 9/608 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/415 variables, and 608 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 40/40 constraints]
After SMT, in 58299ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 58306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58722 ms. Remains : 114/114 places, 301/301 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 114 transition count 287
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 114 transition count 286
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 113 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 283
Applied a total of 20 rules in 31 ms. Remains 112 /114 variables (removed 2) and now considering 283/301 (removed 18) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 283 rows 112 cols
[2024-06-02 21:14:10] [INFO ] Computed 23 invariants in 2 ms
[2024-06-02 21:14:10] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:14:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:14:10] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:14:11] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 21:14:12] [INFO ] After 1208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 21:14:12] [INFO ] After 1831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2001 ms.
[2024-06-02 21:14:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2024-06-02 21:14:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 301 transitions and 1626 arcs took 14 ms.
[2024-06-02 21:14:13] [INFO ] Flatten gal took : 154 ms
Total runtime 161735 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-11

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 114
TRANSITIONS: 301
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]


----------------------------------------------------------------------
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: 1046
MODEL NAME: /home/mcc/execution/413/model
114 places, 301 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.
Building monolithic NSF...
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717363129971

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-11"
export BK_EXAMINATION="ReachabilityFireability"
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 MedleyA-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919600087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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