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.r267-smll-171654406000263.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 Peterson-PT-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716768802213

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 00:13:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 00:13:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:13:24] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2024-05-27 00:13:24] [INFO ] Transformed 244 places.
[2024-05-27 00:13:24] [INFO ] Transformed 332 transitions.
[2024-05-27 00:13:24] [INFO ] Found NUPN structural information;
[2024-05-27 00:13:24] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 655 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 57 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1534 ms. (26 steps per ms) remains 9/13 properties
FORMULA Peterson-PT-3-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1785 ms. (22 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2645 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
[2024-05-27 00:13:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 00:13:27] [INFO ] Computed 15 invariants in 34 ms
[2024-05-27 00:13:27] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem Peterson-PT-3-ReachabilityFireability-2024-04 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityFireability-2024-14 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 11/255 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 4/259 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 308/552 variables, 244/503 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 57/560 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1957 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 217/217 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 4/221 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/222 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/222 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem Peterson-PT-3-ReachabilityFireability-2024-08 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 27/244 variables, 7/229 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 27/256 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 3/259 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-27 00:13:31] [INFO ] Deduced a trap composed of 9 places in 320 ms of which 34 ms to minimize.
[2024-05-27 00:13:31] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 4 ms to minimize.
[2024-05-27 00:13:31] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-27 00:13:31] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-05-27 00:13:31] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
[2024-05-27 00:13:32] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 3 ms to minimize.
[2024-05-27 00:13:32] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-05-27 00:13:32] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 2 ms to minimize.
[2024-05-27 00:13:32] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 15 ms to minimize.
[2024-05-27 00:13:32] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-27 00:13:32] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-27 00:13:33] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-27 00:13:33] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 3 ms to minimize.
[2024-05-27 00:13:33] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-27 00:13:33] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 4 ms to minimize.
[2024-05-27 00:13:33] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-27 00:13:33] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-27 00:13:33] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-27 00:13:34] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-27 00:13:34] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 3 ms to minimize.
Problem Peterson-PT-3-ReachabilityFireability-2024-13 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 20/279 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-27 00:13:34] [INFO ] Deduced a trap composed of 52 places in 261 ms of which 47 ms to minimize.
[2024-05-27 00:13:34] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 3 ms to minimize.
[2024-05-27 00:13:35] [INFO ] Deduced a trap composed of 31 places in 825 ms of which 3 ms to minimize.
SMT process timed out in 7945ms, After SMT, problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 206 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 243 transition count 331
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 243 transition count 327
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 239 transition count 327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 237 transition count 325
Applied a total of 14 rules in 67 ms. Remains 237 /244 variables (removed 7) and now considering 325/332 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 237/244 places, 325/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 525 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 945 ms. (42 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 407970 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 5
Probabilistic random walk after 407970 steps, saw 84219 distinct states, run finished after 3007 ms. (steps per millisecond=135 ) properties seen :0
[2024-05-27 00:13:39] [INFO ] Flow matrix only has 301 transitions (discarded 24 similar events)
// Phase 1: matrix 301 rows 237 cols
[2024-05-27 00:13:39] [INFO ] Computed 15 invariants in 9 ms
[2024-05-27 00:13:39] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/234 variables, 8/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 28/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/237 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 301/538 variables, 237/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 57/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/538 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 546 constraints, problems are : Problem set: 0 solved, 5 unsolved in 778 ms.
Refiners :[Domain max(s): 237/237 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 237/237 constraints, ReadFeed: 57/57 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/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem Peterson-PT-3-ReachabilityFireability-2024-07 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 28/234 variables, 8/217 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 28/245 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 00:13:40] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-27 00:13:41] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 3 ms to minimize.
[2024-05-27 00:13:41] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/249 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 00:13:41] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 3 ms to minimize.
[2024-05-27 00:13:41] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 3 ms to minimize.
[2024-05-27 00:13:41] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/252 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/252 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/237 variables, 3/255 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 3/258 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 00:13:41] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-05-27 00:13:42] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-27 00:13:42] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2024-05-27 00:13:42] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
[2024-05-27 00:13:42] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 4 ms to minimize.
[2024-05-27 00:13:42] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 39 ms to minimize.
[2024-05-27 00:13:43] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 44 ms to minimize.
[2024-05-27 00:13:43] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-27 00:13:43] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 4 ms to minimize.
[2024-05-27 00:13:43] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 37 ms to minimize.
[2024-05-27 00:13:43] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 5 ms to minimize.
[2024-05-27 00:13:43] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 17/275 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:13:44] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-27 00:13:45] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-27 00:13:45] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 7/282 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 301/538 variables, 237/519 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 57/576 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 4/580 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 00:13:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 1/581 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 00:13:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-27 00:13:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/538 variables, 2/583 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/538 variables, 0/583 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/538 variables, 0/583 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 583 constraints, problems are : Problem set: 1 solved, 4 unsolved in 6358 ms.
Refiners :[Domain max(s): 237/237 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 237/237 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 33/33 constraints]
After SMT, in 7289ms problems are : Problem set: 1 solved, 4 unsolved
FORMULA Peterson-PT-3-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1262 ms.
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 325/325 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 237 transition count 235
Reduce places removed 90 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 182 place count 147 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 145 transition count 233
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 184 place count 145 transition count 189
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 272 place count 101 transition count 189
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 290 place count 92 transition count 180
Applied a total of 290 rules in 48 ms. Remains 92 /237 variables (removed 145) and now considering 180/325 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 92/237 places, 180/325 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 69095 steps, run visited all 2 properties in 185 ms. (steps per millisecond=373 )
Probabilistic random walk after 69095 steps, saw 13940 distinct states, run finished after 193 ms. (steps per millisecond=358 ) properties seen :2
FORMULA Peterson-PT-3-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 23821 ms.
ITS solved all properties within timeout

BK_STOP 1716768828258

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r267-smll-171654406000263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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