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.r512-smll-171654407300263.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Peterson-PT-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300263
=====================================================================

--------------------
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 1717270285345

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:31:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:31:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:31:27] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-06-01 19:31:27] [INFO ] Transformed 244 places.
[2024-06-01 19:31:27] [INFO ] Transformed 332 transitions.
[2024-06-01 19:31:27] [INFO ] Found NUPN structural information;
[2024-06-01 19:31:27] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 49 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 1883 ms. (21 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 1335 ms. (29 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2208 ms. (18 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 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
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
[2024-06-01 19:31:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 19:31:29] [INFO ] Computed 15 invariants in 14 ms
[2024-06-01 19:31:29] [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 1477 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-06-01 19:31:32] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 28 ms to minimize.
[2024-06-01 19:31:32] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:31:32] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 3 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
[2024-06-01 19:31:33] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:31:34] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:31:34] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:31:34] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:31:34] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:31:34] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:31:34] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 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, 17/276 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/276 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 308/552 variables, 244/520 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 57/577 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 5/582 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 19:31:35] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 3 ms to minimize.
[2024-06-01 19:31:35] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:31:35] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:31:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:31:35] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:31:35] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 6/588 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 19:31:36] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 1/589 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 19:31:36] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 1/590 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/590 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 590 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5017 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: 5/9 constraints, Known Traps: 25/25 constraints]
After SMT, in 7159ms 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 1 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 92 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 112 ms. Remains : 237/244 places, 325/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 599 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 849 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 404395 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 5
Probabilistic random walk after 404395 steps, saw 83532 distinct states, run finished after 3007 ms. (steps per millisecond=134 ) properties seen :0
[2024-06-01 19:31:40] [INFO ] Flow matrix only has 301 transitions (discarded 24 similar events)
// Phase 1: matrix 301 rows 237 cols
[2024-06-01 19:31:40] [INFO ] Computed 15 invariants in 4 ms
[2024-06-01 19:31:40] [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 740 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-06-01 19:31:42] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:31:42] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 3 ms to minimize.
[2024-06-01 19:31:42] [INFO ] Deduced a trap composed of 39 places in 109 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-06-01 19:31:42] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 3 ms to minimize.
[2024-06-01 19:31:42] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:31:42] [INFO ] Deduced a trap composed of 35 places in 88 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-06-01 19:31:43] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 4 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 7 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:31:43] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 3 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 68 places in 71 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-06-01 19:31:44] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:31:44] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:31:45] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-06-01 19:31:45] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:31:45] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:31:45] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:31:45] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 2 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-06-01 19:31:45] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:31:45] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:31:46] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 3/583 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 19:31:46] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/538 variables, 1/584 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 19:31:46] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/538 variables, 1/585 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/538 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/538 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 585 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5717 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: 35/35 constraints]
After SMT, in 6599ms problems are : Problem set: 1 solved, 4 unsolved
FORMULA Peterson-PT-3-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1392 ms.
Support contains 6 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 237 transition count 238
Reduce places removed 87 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 91 rules applied. Total rules applied 178 place count 150 transition count 234
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 182 place count 146 transition count 234
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 182 place count 146 transition count 192
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 266 place count 104 transition count 192
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 284 place count 95 transition count 183
Applied a total of 284 rules in 31 ms. Remains 95 /237 variables (removed 142) and now considering 183/325 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 95/237 places, 183/325 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/3 properties
FORMULA Peterson-PT-3-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
[2024-06-01 19:31:48] [INFO ] Flow matrix only has 159 transitions (discarded 24 similar events)
// Phase 1: matrix 159 rows 95 cols
[2024-06-01 19:31:48] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 19:31:48] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/43 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/45 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/128 variables, 45/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 18/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 30/158 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 54/212 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/212 variables, 12/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/212 variables, 39/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/212 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 22/234 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/234 variables, 22/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/234 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/236 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/236 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/236 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/238 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/238 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/238 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 16/254 variables, 26/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/254 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/254 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 262 constraints, problems are : Problem set: 0 solved, 2 unsolved in 220 ms.
Refiners :[Domain max(s): 95/95 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/43 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/45 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/128 variables, 45/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 18/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 30/158 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 12/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:31:49] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/158 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/158 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 54/212 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/212 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/212 variables, 39/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/212 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 22/234 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/234 variables, 22/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:31:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/234 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/234 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/236 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/236 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/236 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/238 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/238 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:31:49] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:31:49] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/238 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/238 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 16/254 variables, 26/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:31:49] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:31:49] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/254 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/254 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 0/254 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 636 ms.
Refiners :[Domain max(s): 95/95 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 863ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 183/183 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 95 transition count 180
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 92 transition count 180
Applied a total of 6 rules in 12 ms. Remains 92 /95 variables (removed 3) and now considering 180/183 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 92/95 places, 180/183 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 69095 steps, run visited all 2 properties in 226 ms. (steps per millisecond=305 )
Probabilistic random walk after 69095 steps, saw 13940 distinct states, run finished after 232 ms. (steps per millisecond=297 ) 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 22875 ms.
ITS solved all properties within timeout

BK_STOP 1717270310162

--------------------
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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r512-smll-171654407300263"
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 ;