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.r549-tall-171734898200271.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 FireWire-PT-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-13-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717369906112

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:11:47] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 23:11:47] [INFO ] Transformed 205 places.
[2024-06-02 23:11:47] [INFO ] Transformed 610 transitions.
[2024-06-02 23:11:47] [INFO ] Found NUPN structural information;
[2024-06-02 23:11:47] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
RANDOM walk for 40000 steps (1194 resets) in 2524 ms. (15 steps per ms) remains 13/16 properties
FORMULA FireWire-PT-13-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-13-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-13-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (54 resets) in 244 ms. (163 steps per ms) remains 12/13 properties
FORMULA FireWire-PT-13-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (569 resets) in 407 ms. (98 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (246 resets) in 1011 ms. (39 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (258 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (218 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (251 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (239 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (307 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (15 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (251 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (61 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (29 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
[2024-06-02 23:11:49] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
// Phase 1: matrix 504 rows 205 cols
[2024-06-02 23:11:49] [INFO ] Computed 10 invariants in 18 ms
[2024-06-02 23:11:49] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FireWire-PT-13-ReachabilityFireability-2024-05 is UNSAT
FORMULA FireWire-PT-13-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-13-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-13-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-13-ReachabilityFireability-2024-15 is UNSAT
FORMULA FireWire-PT-13-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 92/202 variables, 10/120 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 92/212 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 503/705 variables, 202/414 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 72/486 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 3/708 variables, 3/489 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 3/492 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/708 variables, 0/492 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/709 variables, 1/493 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/709 variables, 0/493 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/709 variables, 0/493 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 709/709 variables, and 493 constraints, problems are : Problem set: 3 solved, 9 unsolved in 1394 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem FireWire-PT-13-ReachabilityFireability-2024-03 is UNSAT
FORMULA FireWire-PT-13-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 107/202 variables, 10/105 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 107/212 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 23:11:51] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 19 ms to minimize.
[2024-06-02 23:11:51] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:11:51] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:11:51] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 4/216 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/216 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 503/705 variables, 202/418 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 72/490 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 4/494 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 23:11:52] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 1/495 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 0/495 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/708 variables, 3/498 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/708 variables, 3/501 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/708 variables, 4/505 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 23:11:53] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 1/506 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 0/506 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/709 variables, 1/507 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/709 variables, 0/507 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/709 variables, 0/507 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 709/709 variables, and 507 constraints, problems are : Problem set: 4 solved, 8 unsolved in 4834 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 6/6 constraints]
After SMT, in 6547ms problems are : Problem set: 4 solved, 8 unsolved
Parikh walk visited 0 properties in 34175 ms.
Support contains 92 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 542/542 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 536
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 536
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 200 transition count 532
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 200 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 200 transition count 531
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 18 place count 198 transition count 529
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 198 transition count 523
Applied a total of 24 rules in 80 ms. Remains 198 /205 variables (removed 7) and now considering 523/542 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 198/205 places, 523/542 transitions.
RANDOM walk for 40000 steps (1225 resets) in 416 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (43 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (283 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (257 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (262 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (261 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (372 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (63 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 466507 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :2 out of 8
Probabilistic random walk after 466507 steps, saw 117597 distinct states, run finished after 3013 ms. (steps per millisecond=154 ) properties seen :2
FORMULA FireWire-PT-13-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-13-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 23:12:33] [INFO ] Flow matrix only has 493 transitions (discarded 30 similar events)
// Phase 1: matrix 493 rows 198 cols
[2024-06-02 23:12:33] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 23:12:33] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 135/192 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/195 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 493/688 variables, 195/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 72/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/691 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/691 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 691/691 variables, and 280 constraints, problems are : Problem set: 0 solved, 6 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 135/192 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:12:34] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:12:34] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:12:34] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/195 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 493/688 variables, 195/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/691 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/691 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:12:35] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 4 ms to minimize.
[2024-06-02 23:12:35] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/691 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/691 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/691 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 691/691 variables, and 291 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2248 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 2861ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4734 ms.
Support contains 57 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 523/523 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 519
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 519
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 194 transition count 513
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 194 transition count 513
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 192 transition count 509
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 192 transition count 509
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 191 transition count 506
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 191 transition count 506
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 190 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 190 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 189 transition count 506
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 189 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 189 transition count 503
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 189 transition count 507
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 29 place count 187 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 187 transition count 499
Applied a total of 33 rules in 86 ms. Remains 187 /198 variables (removed 11) and now considering 499/523 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 187/198 places, 499/523 transitions.
RANDOM walk for 40000 steps (1279 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 56 ms. (701 steps per ms) remains 5/6 properties
FORMULA FireWire-PT-13-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (285 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (274 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (393 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
[2024-06-02 23:12:41] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
// Phase 1: matrix 467 rows 187 cols
[2024-06-02 23:12:41] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:12:41] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 131/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/184 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 467/651 variables, 184/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 71/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/654 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 268 constraints, problems are : Problem set: 0 solved, 5 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 71/71 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 131/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 467/651 variables, 184/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 71/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/654 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:12:43] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/654 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/654 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/654 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 279 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 2444ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3724 ms.
Support contains 50 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 499/499 transitions.
Applied a total of 0 rules in 9 ms. Remains 187 /187 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 187/187 places, 499/499 transitions.
RANDOM walk for 40000 steps (1266 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (62 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (286 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (268 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (384 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (71 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 537469 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :1 out of 5
Probabilistic random walk after 537469 steps, saw 136660 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :1
FORMULA FireWire-PT-13-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 23:12:50] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 23:12:50] [INFO ] Invariant cache hit.
[2024-06-02 23:12:50] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/184 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 467/651 variables, 184/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 71/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/654 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 268 constraints, problems are : Problem set: 0 solved, 4 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 467/651 variables, 184/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 71/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:12:52] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/654 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/654 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 277 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2784 ms.
Support contains 49 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 499/499 transitions.
Applied a total of 0 rules in 12 ms. Remains 187 /187 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 187/187 places, 499/499 transitions.
RANDOM walk for 40000 steps (1263 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (271 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (281 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (381 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 608717 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 4
Probabilistic random walk after 608717 steps, saw 150344 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-06-02 23:12:58] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 23:12:58] [INFO ] Invariant cache hit.
[2024-06-02 23:12:58] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/184 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 467/651 variables, 184/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 71/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/654 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 268 constraints, problems are : Problem set: 0 solved, 4 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 467/651 variables, 184/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 71/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:13:00] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/654 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/654 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 277 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 1984ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2655 ms.
Support contains 49 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 499/499 transitions.
Applied a total of 0 rules in 9 ms. Remains 187 /187 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 187/187 places, 499/499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 499/499 transitions.
Applied a total of 0 rules in 9 ms. Remains 187 /187 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 23:13:03] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 23:13:03] [INFO ] Invariant cache hit.
[2024-06-02 23:13:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:13:03] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 23:13:03] [INFO ] Invariant cache hit.
[2024-06-02 23:13:03] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:13:03] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [19, 77, 135]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 419 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/187 places, 499/499 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 437 ms. Remains : 184/187 places, 499/499 transitions.
RANDOM walk for 40000 steps (1262 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (308 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (274 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (381 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (80 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 575070 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 4
Probabilistic random walk after 575070 steps, saw 141493 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
[2024-06-02 23:13:07] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
// Phase 1: matrix 467 rows 184 cols
[2024-06-02 23:13:07] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:13:07] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 463/640 variables, 177/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 70/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/651 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/651 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 262 constraints, problems are : Problem set: 0 solved, 4 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 184/184 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:13:07] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:13:07] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:13:07] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 463/640 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 70/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 11/651 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:13:08] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:13:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/651 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/651 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 271 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1750 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 184/184 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 2171ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2626 ms.
Support contains 49 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 499/499 transitions.
Applied a total of 0 rules in 21 ms. Remains 184 /184 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 184/184 places, 499/499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 499/499 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 23:13:11] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 23:13:11] [INFO ] Invariant cache hit.
[2024-06-02 23:13:12] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:13:12] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 23:13:12] [INFO ] Invariant cache hit.
[2024-06-02 23:13:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:13:12] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-06-02 23:13:12] [INFO ] Redundant transitions in 28 ms returned []
Running 498 sub problems to find dead transitions.
[2024-06-02 23:13:12] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 23:13:12] [INFO ] Invariant cache hit.
[2024-06-02 23:13:12] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:13:17] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:13:17] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 467/651 variables, 184/198 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 71/269 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:13:23] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 2 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:13:27] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:13:38] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/651 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/651 variables, and 273 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 184/184 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 467/651 variables, 184/202 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 71/273 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 498/771 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 771 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 184/184 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 11/11 constraints]
After SMT, in 60605ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61011 ms. Remains : 184/184 places, 499/499 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 58 edges and 184 vertex of which 5 / 184 are part of one of the 1 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 50 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 179 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 16 place count 179 transition count 435
Applied a total of 16 rules in 23 ms. Remains 179 /184 variables (removed 5) and now considering 435/499 (removed 64) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 435 rows 179 cols
[2024-06-02 23:14:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:14:13] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:14:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:13] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 23:14:13] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 23:14:13] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 1
[2024-06-02 23:14:14] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:14:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
TRAPS : Iteration 2
[2024-06-02 23:14:14] [INFO ] After 1292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:14:14] [INFO ] After 1580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1707 ms.
[2024-06-02 23:14:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-02 23:14:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 499 transitions and 1882 arcs took 5 ms.
[2024-06-02 23:14:14] [INFO ] Flatten gal took : 64 ms
Total runtime 147632 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-13

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 760
MODEL NAME: /home/mcc/execution/414/model
184 places, 499 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-13-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA FireWire-PT-13-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA FireWire-PT-13-ReachabilityFireability-2024-11 CANNOT_COMPUTE
FORMULA FireWire-PT-13-ReachabilityFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717370482466

--------------------
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
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-13"
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 FireWire-PT-13, 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 r549-tall-171734898200271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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