About the Execution of GreatSPN+red for FireWire-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
430.724 | 11630.00 | 28313.00 | 44.90 | TTTFTTTTFTTTTTTT | normal |
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-171734898000199.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-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000199
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 89K 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-04-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717365770149
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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:02:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:02:51] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 22:02:51] [INFO ] Transformed 113 places.
[2024-06-02 22:02:51] [INFO ] Transformed 364 transitions.
[2024-06-02 22:02:51] [INFO ] Found NUPN structural information;
[2024-06-02 22:02:51] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (2242 resets) in 2127 ms. (18 steps per ms) remains 14/15 properties
FORMULA FireWire-PT-04-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (15 resets) in 1028 ms. (38 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (16 resets) in 300 ms. (132 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (928 resets) in 320 ms. (124 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (591 resets) in 702 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 482 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1096 resets) in 341 ms. (116 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (17 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (567 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1071 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (26 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1508 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (540 resets) in 128 ms. (310 steps per ms) remains 13/14 properties
FORMULA FireWire-PT-04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (195 resets) in 87 ms. (454 steps per ms) remains 12/13 properties
FORMULA FireWire-PT-04-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 22:02:53] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 22:02:53] [INFO ] Computed 8 invariants in 12 ms
[2024-06-02 22:02:53] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FireWire-PT-04-ReachabilityFireability-2024-03 is UNSAT
FORMULA FireWire-PT-04-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 28/112 variables, 8/92 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 28/120 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 275/387 variables, 112/232 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 39/271 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/272 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/389 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/389 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 274 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1039 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem FireWire-PT-04-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-04-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-04-ReachabilityFireability-2024-04 is UNSAT
FORMULA FireWire-PT-04-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 33/112 variables, 8/87 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 33/120 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 22:02:55] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 31 ms to minimize.
[2024-06-02 22:02:55] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/122 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 22:02:55] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/123 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/123 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 275/387 variables, 112/235 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 39/274 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 5/279 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/279 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/388 variables, 1/280 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/281 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 4/285 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1/389 variables, 1/286 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/286 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/389 variables, 0/286 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 286 constraints, problems are : Problem set: 3 solved, 9 unsolved in 2295 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 3710ms problems are : Problem set: 3 solved, 9 unsolved
Parikh walk visited 0 properties in 1409 ms.
Support contains 75 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 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 113 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 113 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 112 transition count 298
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 112 transition count 298
Applied a total of 12 rules in 48 ms. Remains 112 /113 variables (removed 1) and now considering 298/308 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 112/113 places, 298/308 transitions.
RANDOM walk for 40000 steps (2239 resets) in 347 ms. (114 steps per ms) remains 6/9 properties
FORMULA FireWire-PT-04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (15 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1184 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (17 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1179 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1762 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (589 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
[2024-06-02 22:02:59] [INFO ] Flow matrix only has 274 transitions (discarded 24 similar events)
// Phase 1: matrix 274 rows 112 cols
[2024-06-02 22:02:59] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:02:59] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 36/109 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 274/385 variables, 111/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 39/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/386 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/386 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 271 constraints, problems are : Problem set: 0 solved, 6 unsolved in 367 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 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/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 36/109 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:02:59] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 22:02:59] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:02:59] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/111 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 274/385 variables, 111/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 39/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/386 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/386 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 280 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1318 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1768ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 476 ms.
Support contains 73 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 298/298 transitions.
Applied a total of 0 rules in 22 ms. Remains 112 /112 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 112/112 places, 298/298 transitions.
RANDOM walk for 40000 steps (2298 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (21 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1248 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (16 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1245 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1789 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (560 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 1955 steps, run visited all 6 properties in 29 ms. (steps per millisecond=67 )
Probabilistic random walk after 1955 steps, saw 1151 distinct states, run finished after 33 ms. (steps per millisecond=59 ) properties seen :6
FORMULA FireWire-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 10408 ms.
ITS solved all properties within timeout
BK_STOP 1717365781779
--------------------
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="FireWire-PT-04"
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-04, 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-171734898000199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-04.tgz
mv FireWire-PT-04 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 '
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 ;