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.r311-tall-171662337600871.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 ResAllocation-PT-R020C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337600871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:43 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 ResAllocation-PT-R020C002-ReachabilityFireability-2024-00
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-01
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-02
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-03
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-04
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-05
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-06
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-07
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-08
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-09
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-10
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-11
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-12
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-13
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-14
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716775840957

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R020C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 02:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 02:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:10:42] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-27 02:10:42] [INFO ] Transformed 80 places.
[2024-05-27 02:10:42] [INFO ] Transformed 42 transitions.
[2024-05-27 02:10:42] [INFO ] Found NUPN structural information;
[2024-05-27 02:10:42] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (344 resets) in 2036 ms. (19 steps per ms) remains 12/14 properties
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (64 resets) in 284 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (85 resets) in 501 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (65 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (31 resets) in 189 ms. (210 steps per ms) remains 10/12 properties
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (80 resets) in 266 ms. (149 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (81 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (42 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (72 resets) in 385 ms. (103 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (78 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (66 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (76 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
// Phase 1: matrix 42 rows 80 cols
[2024-05-27 02:10:44] [INFO ] Computed 40 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-07 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-14 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 40/120 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 42/122 variables, 80/200 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/122 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 200 constraints, problems are : Problem set: 2 solved, 8 unsolved in 491 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-09 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 40/120 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 12 ms to minimize.
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:10:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-04 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-27 02:10:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:10:45] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-27 02:10:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 11/131 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/131 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 42/122 variables, 80/211 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 6/217 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-27 02:10:45] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:10:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/219 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/219 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/219 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 219 constraints, problems are : Problem set: 4 solved, 6 unsolved in 962 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 13/13 constraints]
After SMT, in 1542ms problems are : Problem set: 4 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1410 ms.
Support contains 66 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 80/80 places, 42/42 transitions.
RANDOM walk for 40000 steps (341 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (85 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (78 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (78 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 691612 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 5
Probabilistic random walk after 691612 steps, saw 166721 distinct states, run finished after 3020 ms. (steps per millisecond=229 ) properties seen :0
[2024-05-27 02:10:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/79 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 13/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 42/122 variables, 80/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 200 constraints, problems are : Problem set: 0 solved, 5 unsolved in 230 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:10:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:10:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 13/79 variables, 15/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 42/122 variables, 80/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:50] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:10:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:51] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/122 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 211 constraints, problems are : Problem set: 0 solved, 5 unsolved in 708 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 908 ms.
Support contains 66 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 80/80 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-27 02:10:52] [INFO ] Invariant cache hit.
[2024-05-27 02:10:52] [INFO ] Implicit Places using invariants in 54 ms returned [55, 61, 63, 73]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/80 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65 ms. Remains : 76/80 places, 42/42 transitions.
RANDOM walk for 40000 steps (344 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (85 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (65 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (78 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (78 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 766989 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 5
Probabilistic random walk after 766989 steps, saw 184346 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
// Phase 1: matrix 42 rows 76 cols
[2024-05-27 02:10:55] [INFO ] Computed 36 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/76 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 42/118 variables, 76/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 188 constraints, problems are : Problem set: 0 solved, 5 unsolved in 180 ms.
Refiners :[Domain max(s): 76/76 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:10:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:10:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:10:55] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:10:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/76 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 42/118 variables, 76/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-27 02:10:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/118 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 02:10:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/118 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 204 constraints, problems are : Problem set: 0 solved, 5 unsolved in 947 ms.
Refiners :[Domain max(s): 76/76 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 1144ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1339 ms.
Support contains 66 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 76/76 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-27 02:10:58] [INFO ] Invariant cache hit.
[2024-05-27 02:10:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 02:10:58] [INFO ] Invariant cache hit.
[2024-05-27 02:10:58] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-27 02:10:58] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 02:10:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 4 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:10:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 42/118 variables, 76/207 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 207 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1355 ms.
Refiners :[Domain max(s): 76/76 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 42/118 variables, 76/207 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 40/247 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 247 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1048 ms.
Refiners :[Domain max(s): 76/76 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
After SMT, in 2412ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2509 ms. Remains : 76/76 places, 42/42 transitions.
[2024-05-27 02:11:00] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-27 02:11:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 76 places, 42 transitions and 192 arcs took 4 ms.
[2024-05-27 02:11:00] [INFO ] Flatten gal took : 25 ms
Total runtime 18612 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ResAllocation-PT-R020C002

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: 76
TRANSITIONS: 42
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 719
MODEL NAME: /home/mcc/execution/413/model
76 places, 42 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716775861627

--------------------
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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r311-tall-171662337600871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 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 ;