fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r553-tall-171734901200214
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FireWire-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
428.432 20427.00 39481.00 92.30 FTFFFTTFFTFFTFFT 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.r553-tall-171734901200214.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K 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 48K 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 25K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 90K 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-06-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717354247136

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:50:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:50:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:50:48] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:50:48] [INFO ] Transformed 116 places.
[2024-06-02 18:50:48] [INFO ] Transformed 368 transitions.
[2024-06-02 18:50:48] [INFO ] Found NUPN structural information;
[2024-06-02 18:50:48] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2019 resets) in 2085 ms. (19 steps per ms) remains 7/9 properties
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (570 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (485 resets) in 83 ms. (476 steps per ms) remains 6/7 properties
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (763 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (974 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (517 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (523 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
[2024-06-02 18:50:49] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 18:50:49] [INFO ] Computed 9 invariants in 8 ms
[2024-06-02 18:50:49] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem FireWire-PT-06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 73/116 variables, 9/52 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 73/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 18:50:49] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 8 ms to minimize.
[2024-06-02 18:50:49] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:50:49] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:50:50] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 279/395 variables, 116/245 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 40/285 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/396 variables, 1/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/396 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 286 constraints, problems are : Problem set: 2 solved, 4 unsolved in 923 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 94/116 variables, 9/31 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 94/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 18:50:50] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:50:50] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 279/395 variables, 116/247 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 40/287 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 4/291 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/292 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 292 constraints, problems are : Problem set: 2 solved, 4 unsolved in 814 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 1837ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 1130 ms.
Support contains 22 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 312/312 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 116 transition count 309
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 116 transition count 308
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 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 9 place count 113 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 111 transition count 310
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 111 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 111 transition count 298
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 110 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 110 transition count 296
Applied a total of 31 rules in 104 ms. Remains 110 /116 variables (removed 6) and now considering 296/312 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 110/116 places, 296/312 transitions.
RANDOM walk for 40000 steps (2149 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (590 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (757 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (631 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (562 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1029163 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :1 out of 4
Probabilistic random walk after 1029163 steps, saw 211762 distinct states, run finished after 3015 ms. (steps per millisecond=341 ) properties seen :1
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 18:50:55] [INFO ] Flow matrix only has 269 transitions (discarded 27 similar events)
// Phase 1: matrix 269 rows 110 cols
[2024-06-02 18:50:55] [INFO ] Computed 9 invariants in 5 ms
[2024-06-02 18:50:55] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/379 variables, 110/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 42/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 269/379 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 932 ms.
Support contains 21 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 296/296 transitions.
Applied a total of 0 rules in 26 ms. Remains 110 /110 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 110/110 places, 296/296 transitions.
RANDOM walk for 40000 steps (2151 resets) in 102 ms. (388 steps per ms) remains 2/3 properties
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (588 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (734 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2024-06-02 18:50:57] [INFO ] Flow matrix only has 269 transitions (discarded 27 similar events)
[2024-06-02 18:50:57] [INFO ] Invariant cache hit.
[2024-06-02 18:50:57] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:50:57] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:50:57] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:50:57] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2024-06-02 18:50:57] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/379 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/379 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 20 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 110/110 places, 296/296 transitions.
RANDOM walk for 40000 steps (2128 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (600 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (663 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1274044 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 2
Probabilistic random walk after 1274044 steps, saw 255386 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
[2024-06-02 18:51:01] [INFO ] Flow matrix only has 269 transitions (discarded 27 similar events)
[2024-06-02 18:51:01] [INFO ] Invariant cache hit.
[2024-06-02 18:51:01] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:51:01] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:51:01] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:51:01] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:51:01] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/379 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/379 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 133 ms.
Support contains 20 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 110/110 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-02 18:51:02] [INFO ] Flow matrix only has 269 transitions (discarded 27 similar events)
[2024-06-02 18:51:02] [INFO ] Invariant cache hit.
[2024-06-02 18:51:02] [INFO ] Implicit Places using invariants in 67 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/110 places, 296/296 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 109 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 295
Applied a total of 2 rules in 10 ms. Remains 108 /109 variables (removed 1) and now considering 295/296 (removed 1) transitions.
[2024-06-02 18:51:02] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
// Phase 1: matrix 268 rows 108 cols
[2024-06-02 18:51:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:51:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:51:02] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
[2024-06-02 18:51:02] [INFO ] Invariant cache hit.
[2024-06-02 18:51:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:02] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [36, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 191 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/110 places, 295/296 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 294
Applied a total of 2 rules in 17 ms. Remains 105 /106 variables (removed 1) and now considering 294/295 (removed 1) transitions.
[2024-06-02 18:51:02] [INFO ] Flow matrix only has 267 transitions (discarded 27 similar events)
// Phase 1: matrix 267 rows 105 cols
[2024-06-02 18:51:02] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:51:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:51:02] [INFO ] Flow matrix only has 267 transitions (discarded 27 similar events)
[2024-06-02 18:51:02] [INFO ] Invariant cache hit.
[2024-06-02 18:51:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:02] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 105/110 places, 294/296 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 484 ms. Remains : 105/110 places, 294/296 transitions.
RANDOM walk for 40000 steps (2373 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (602 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (835 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2135259 steps, run timeout after 3001 ms. (steps per millisecond=711 ) properties seen :1 out of 2
Probabilistic random walk after 2135259 steps, saw 443035 distinct states, run finished after 3001 ms. (steps per millisecond=711 ) properties seen :1
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 18:51:05] [INFO ] Flow matrix only has 267 transitions (discarded 27 similar events)
[2024-06-02 18:51:05] [INFO ] Invariant cache hit.
[2024-06-02 18:51:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/103 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:51:05] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 267/370 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/372 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/103 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 267/370 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/372 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 294/294 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 2 place count 104 transition count 293
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 4 place count 103 transition count 295
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 6 place count 103 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 103 transition count 290
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 103 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 102 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 101 transition count 288
Applied a total of 12 rules in 34 ms. Remains 101 /105 variables (removed 4) and now considering 288/294 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 101/105 places, 288/294 transitions.
RANDOM walk for 40000 steps (2456 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (561 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1050026 steps, run visited all 1 properties in 1373 ms. (steps per millisecond=764 )
Probabilistic random walk after 1050026 steps, saw 197880 distinct states, run finished after 1377 ms. (steps per millisecond=762 ) properties seen :1
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 19276 ms.
ITS solved all properties within timeout

BK_STOP 1717354267563

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901200214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-06.tgz
mv FireWire-PT-06 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;