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.r179-tall-171640600700047.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 FlexibleBarrier-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600700047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 241K May 18 16:42 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 FlexibleBarrier-PT-08b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716417460050

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:37:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 22:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:37:41] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-22 22:37:41] [INFO ] Transformed 920 places.
[2024-05-22 22:37:41] [INFO ] Transformed 1057 transitions.
[2024-05-22 22:37:41] [INFO ] Found NUPN structural information;
[2024-05-22 22:37:41] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (633 resets) in 2168 ms. (18 steps per ms) remains 6/16 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 571 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (59 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (74 resets) in 563 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (75 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (71 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
// Phase 1: matrix 1057 rows 920 cols
[2024-05-22 22:37:42] [INFO ] Computed 10 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 811/920 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/920 variables, 811/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1057/1977 variables, 920/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1977 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1977 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1977/1977 variables, and 1850 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1378 ms.
Refiners :[Domain max(s): 920/920 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 920/920 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/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 811/920 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/920 variables, 811/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:37:44] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:37:45] [INFO ] Deduced a trap composed of 282 places in 169 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/920 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/920 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1057/1977 variables, 920/1852 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1977 variables, 6/1858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1977 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:37:47] [INFO ] Deduced a trap composed of 280 places in 174 ms of which 4 ms to minimize.
[2024-05-22 22:37:47] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1977 variables, 2/1860 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1977 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1977 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1977/1977 variables, and 1860 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5017 ms.
Refiners :[Domain max(s): 920/920 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 920/920 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 6577ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 109 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 920 transition count 915
Reduce places removed 142 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 166 rules applied. Total rules applied 308 place count 778 transition count 891
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 332 place count 754 transition count 891
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 332 place count 754 transition count 812
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 490 place count 675 transition count 812
Discarding 256 places :
Symmetric choice reduction at 3 with 256 rule applications. Total rules 746 place count 419 transition count 556
Iterating global reduction 3 with 256 rules applied. Total rules applied 1002 place count 419 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1003 place count 419 transition count 555
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1003 place count 419 transition count 552
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1009 place count 416 transition count 552
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 1035 place count 390 transition count 526
Iterating global reduction 4 with 26 rules applied. Total rules applied 1061 place count 390 transition count 526
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1076 place count 390 transition count 511
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 1196 place count 330 transition count 451
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1210 place count 323 transition count 464
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1211 place count 323 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1212 place count 322 transition count 463
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1217 place count 322 transition count 463
Applied a total of 1217 rules in 203 ms. Remains 322 /920 variables (removed 598) and now considering 463/1057 (removed 594) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 322/920 places, 463/1057 transitions.
RANDOM walk for 40000 steps (1413 resets) in 567 ms. (70 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (56 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (127 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (127 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
[2024-05-22 22:37:49] [INFO ] Flow matrix only has 459 transitions (discarded 4 similar events)
// Phase 1: matrix 459 rows 322 cols
[2024-05-22 22:37:49] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:37:49] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 214/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 459/781 variables, 322/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/781 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 781/781 variables, and 333 constraints, problems are : Problem set: 0 solved, 5 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 322/322 constraints, ReadFeed: 1/1 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/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 214/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 459/781 variables, 322/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 5/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 22:37:50] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/781 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/781 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/781 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 781/781 variables, and 339 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 322/322 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1838ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1846 ms.
Support contains 108 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 463/463 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 320 transition count 461
Applied a total of 4 rules in 18 ms. Remains 320 /322 variables (removed 2) and now considering 461/463 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 320/322 places, 461/463 transitions.
RANDOM walk for 40000 steps (1399 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (61 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (127 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (127 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 541162 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 5
Probabilistic random walk after 541162 steps, saw 127675 distinct states, run finished after 3013 ms. (steps per millisecond=179 ) properties seen :0
[2024-05-22 22:37:56] [INFO ] Flow matrix only has 457 transitions (discarded 4 similar events)
// Phase 1: matrix 457 rows 320 cols
[2024-05-22 22:37:56] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 22:37:56] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 212/320 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 457/777 variables, 320/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/777 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/777 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 331 constraints, problems are : Problem set: 0 solved, 5 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 320/320 constraints, ReadFeed: 1/1 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/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 212/320 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 22:37:57] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 457/777 variables, 320/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 5/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 22:37:58] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/777 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/777 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/777 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 338 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 320/320 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 2028ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1741 ms.
Support contains 107 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 461/461 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 319 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 318 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 318 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 318 transition count 458
Applied a total of 5 rules in 22 ms. Remains 318 /320 variables (removed 2) and now considering 458/461 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 318/320 places, 458/461 transitions.
RANDOM walk for 40000 steps (1409 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (51 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (65 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (124 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 533868 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 4
Probabilistic random walk after 533868 steps, saw 126359 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-05-22 22:38:03] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 318 cols
[2024-05-22 22:38:03] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:38:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 454/772 variables, 318/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/772 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/772 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 329 constraints, problems are : Problem set: 0 solved, 4 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 constraints, ReadFeed: 1/1 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/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 22:38:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 454/772 variables, 318/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 22:38:04] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/772 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 772/772 variables, and 335 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1301 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1690ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1853 ms.
Support contains 107 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 458/458 transitions.
Applied a total of 0 rules in 17 ms. Remains 318 /318 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 318/318 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 458/458 transitions.
Applied a total of 0 rules in 11 ms. Remains 318 /318 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-05-22 22:38:07] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2024-05-22 22:38:07] [INFO ] Invariant cache hit.
[2024-05-22 22:38:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 22:38:07] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2024-05-22 22:38:07] [INFO ] Invariant cache hit.
[2024-05-22 22:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:38:07] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-22 22:38:07] [INFO ] Redundant transitions in 29 ms returned []
Running 456 sub problems to find dead transitions.
[2024-05-22 22:38:07] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2024-05-22 22:38:07] [INFO ] Invariant cache hit.
[2024-05-22 22:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 22:38:12] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:38:12] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:38:14] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 1 ms to minimize.
[2024-05-22 22:38:14] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-05-22 22:38:14] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:38:15] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:38:15] [INFO ] Deduced a trap composed of 121 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 22:38:17] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:38:17] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:38:18] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 22:38:23] [INFO ] Deduced a trap composed of 217 places in 117 ms of which 2 ms to minimize.
[2024-05-22 22:38:23] [INFO ] Deduced a trap composed of 109 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 22:38:26] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 22:38:28] [INFO ] Deduced a trap composed of 108 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 8 (OVERLAPS) 454/772 variables, 318/342 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/772 variables, and 343 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 454/772 variables, 318/342 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 456/799 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 22:38:49] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-22 22:38:58] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/772 variables, and 801 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 16/16 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60734 ms. Remains : 318/318 places, 458/458 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 318 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 315 transition count 451
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 315 transition count 451
Applied a total of 10 rules in 15 ms. Remains 315 /318 variables (removed 3) and now considering 451/458 (removed 7) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 451 rows 315 cols
[2024-05-22 22:39:08] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 22:39:08] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 22:39:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 22:39:08] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 22:39:08] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-22 22:39:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-22 22:39:09] [INFO ] After 944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 22:39:09] [INFO ] After 1286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1431 ms.
[2024-05-22 22:39:09] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-22 22:39:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 318 places, 458 transitions and 1467 arcs took 4 ms.
[2024-05-22 22:39:09] [INFO ] Flatten gal took : 61 ms
Total runtime 88636 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-08b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/401/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 318
TRANSITIONS: 458
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.002s]


SAVING FILE /home/mcc/execution/401/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: 711
MODEL NAME: /home/mcc/execution/401/model
318 places, 458 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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r179-tall-171640600700047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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