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.r355-tall-171683759300695.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 ShieldPPPt-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759300695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 685K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717032732203

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 01:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 01:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:32:13] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-05-30 01:32:13] [INFO ] Transformed 2503 places.
[2024-05-30 01:32:13] [INFO ] Transformed 1803 transitions.
[2024-05-30 01:32:13] [INFO ] Found NUPN structural information;
[2024-05-30 01:32:13] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2323 ms. (17 steps per ms) remains 11/16 properties
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 876 ms. (45 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1223 ms. (32 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 622 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 614 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 510 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 605 ms. (66 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 577 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 11/11 properties
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-30 01:32:16] [INFO ] Computed 1101 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 432/762 variables, 326/656 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/762 variables, 432/1088 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1741/2503 variables, 775/1863 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1741/3604 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1802/4305 variables, 2503/6107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4305 variables, 0/6107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/4305 variables, 0/6107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4305/4305 variables, and 6107 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4319 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 432/762 variables, 326/656 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/762 variables, 432/1088 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1741/2503 variables, 775/1863 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1741/3604 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1802/4305 variables, 2503/6107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4305 variables, 11/6118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4305/4305 variables, and 6118 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5011 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 9567ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 330 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 306 times.
Drop transitions (Partial Free agglomeration) removed 306 transitions
Iterating global reduction 0 with 306 rules applied. Total rules applied 310 place count 2501 transition count 1800
Applied a total of 310 rules in 647 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 2501/2503 places, 1800/1802 transitions.
RANDOM walk for 40000 steps (8 resets) in 1418 ms. (28 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 540 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 545 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 508 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 453 ms. (88 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 76265 steps, run timeout after 3004 ms. (steps per millisecond=25 ) properties seen :3 out of 11
Probabilistic random walk after 76265 steps, saw 74708 distinct states, run finished after 3007 ms. (steps per millisecond=25 ) properties seen :3
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-30 01:32:31] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-30 01:32:31] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 284/476 variables, 203/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 284/679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2025/2501 variables, 898/1577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2025/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 72/6175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 0/6175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/4301 variables, 0/6175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4301/4301 variables, and 6175 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3064 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 284/476 variables, 203/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 284/679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2025/2501 variables, 898/1577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2025/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 72/6175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 8/6183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:32:39] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 19 ms to minimize.
[2024-05-30 01:32:39] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4301 variables, 2/6185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4301 variables, 0/6185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/4301 variables, 0/6185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4301/4301 variables, and 6185 constraints, problems are : Problem set: 0 solved, 8 unsolved in 12805 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 15968ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 25205 ms.
Support contains 30 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 2501 transition count 1800
Applied a total of 82 rules in 205 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 2501/2501 places, 1800/1800 transitions.
RANDOM walk for 40000 steps (8 resets) in 817 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 136580 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 1
Probabilistic random walk after 136580 steps, saw 132813 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-30 01:33:16] [INFO ] Computed 1101 invariants in 15 ms
[2024-05-30 01:33:16] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 52/82 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2419/2501 variables, 1066/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2419/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 99/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 0/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4301 variables, 0/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4301/4301 variables, and 6202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1287 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 52/82 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2419/2501 variables, 1066/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2419/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 99/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 1/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4301 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4301 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4301/4301 variables, and 6203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2115 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6205 ms.
Support contains 30 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 108 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 95 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-30 01:33:26] [INFO ] Invariant cache hit.
[2024-05-30 01:33:28] [INFO ] Implicit Places using invariants in 1774 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1788 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 119 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2024-05-30 01:33:28] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-30 01:33:30] [INFO ] Implicit Places using invariants in 1801 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1806 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2495 transition count 1797
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2495 transition count 1797
Applied a total of 2 rules in 181 ms. Remains 2495 /2496 variables (removed 1) and now considering 1797/1798 (removed 1) transitions.
// Phase 1: matrix 1797 rows 2495 cols
[2024-05-30 01:33:30] [INFO ] Computed 1098 invariants in 15 ms
[2024-05-30 01:33:31] [INFO ] Implicit Places using invariants in 1407 ms returned []
[2024-05-30 01:33:31] [INFO ] Invariant cache hit.
[2024-05-30 01:33:33] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-30 01:33:38] [INFO ] Implicit Places using invariants and state equation in 7080 ms returned []
Implicit Place search using SMT with State Equation took 8491 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2495/2501 places, 1797/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 12481 ms. Remains : 2495/2501 places, 1797/1800 transitions.
RANDOM walk for 40000 steps (8 resets) in 574 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 440 ms. (90 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 145482 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 1
Probabilistic random walk after 145482 steps, saw 140589 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-30 01:33:42] [INFO ] Invariant cache hit.
[2024-05-30 01:33:42] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/80 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2415/2495 variables, 1064/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2495 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1797/4292 variables, 2495/3593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4292 variables, 97/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4292 variables, 0/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4292 variables, 0/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4292/4292 variables, and 3690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2495/2495 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/80 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2415/2495 variables, 1064/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2495 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1797/4292 variables, 2495/3593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4292 variables, 97/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4292 variables, 1/3691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4292 variables, 0/3691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4292 variables, 0/3691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4292/4292 variables, and 3691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2061 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2495/2495 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3177ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4188 ms.
Support contains 30 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 1797/1797 transitions.
Applied a total of 0 rules in 99 ms. Remains 2495 /2495 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2495/2495 places, 1797/1797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 1797/1797 transitions.
Applied a total of 0 rules in 88 ms. Remains 2495 /2495 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
[2024-05-30 01:33:49] [INFO ] Invariant cache hit.
[2024-05-30 01:33:51] [INFO ] Implicit Places using invariants in 1392 ms returned []
[2024-05-30 01:33:51] [INFO ] Invariant cache hit.
[2024-05-30 01:33:52] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-30 01:33:58] [INFO ] Implicit Places using invariants and state equation in 6981 ms returned []
Implicit Place search using SMT with State Equation took 8375 ms to find 0 implicit places.
[2024-05-30 01:33:58] [INFO ] Redundant transitions in 132 ms returned []
Running 1796 sub problems to find dead transitions.
[2024-05-30 01:33:58] [INFO ] Invariant cache hit.
[2024-05-30 01:33:58] [INFO ] State equation strengthened by 97 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2494/4292 variables, and 0 constraints, problems are : Problem set: 0 solved, 1796 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1098 constraints, State Equation: 0/2495 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 1796/1796 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1796 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2494/4292 variables, and 0 constraints, problems are : Problem set: 0 solved, 1796 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1098 constraints, State Equation: 0/2495 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 0/1796 constraints, Known Traps: 0/0 constraints]
After SMT, in 60955ms problems are : Problem set: 0 solved, 1796 unsolved
Search for dead transitions found 0 dead transitions in 60975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69592 ms. Remains : 2495/2495 places, 1797/1797 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 96 times.
Drop transitions (Partial Free agglomeration) removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 2495 transition count 1797
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 2495 transition count 1701
Applied a total of 192 rules in 259 ms. Remains 2495 /2495 variables (removed 0) and now considering 1701/1797 (removed 96) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1701 rows 2495 cols
[2024-05-30 01:34:59] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-30 01:34:59] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 01:35:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 179 ms returned sat
[2024-05-30 01:35:01] [INFO ] After 985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 01:35:01] [INFO ] After 1263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 01:35:01] [INFO ] After 1892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2491 ms.
[2024-05-30 01:35:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-30 01:35:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2495 places, 1797 transitions and 8250 arcs took 13 ms.
[2024-05-30 01:35:02] [INFO ] Flatten gal took : 304 ms
Total runtime 168922 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-100A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2495
TRANSITIONS: 1797
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.048s, Sys 0.003s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 625
MODEL NAME: /home/mcc/execution/410/model
2495 places, 1797 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:
++ 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="ShieldPPPt-PT-100A"
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 ShieldPPPt-PT-100A, 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 r355-tall-171683759300695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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