About the Execution of GreatSPN+red for ASLink-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13287.991 | 3600000.00 | 7772505.00 | 8372.30 | FFTT?T?TTFF??T?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r003-smll-171620116900055.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 ASLink-PT-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116900055
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 544K 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 ASLink-PT-03b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2023-04
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2023-13
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-03b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716250940263
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 00:22:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 00:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 00:22:23] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2024-05-21 00:22:23] [INFO ] Transformed 1638 places.
[2024-05-21 00:22:23] [INFO ] Transformed 2094 transitions.
[2024-05-21 00:22:23] [INFO ] Found NUPN structural information;
[2024-05-21 00:22:23] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 617 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (118 resets) in 2950 ms. (13 steps per ms) remains 12/16 properties
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (18 resets) in 319 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (21 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (19 resets) in 1612 ms. (24 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (22 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (18 resets) in 1156 ms. (34 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (21 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (20 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (21 resets) in 294 ms. (135 steps per ms) remains 11/12 properties
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (19 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (19 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (22 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (19 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
// Phase 1: matrix 2094 rows 1638 cols
[2024-05-21 00:22:26] [INFO ] Computed 160 invariants in 196 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 361/541 variables, 32/212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 361/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 20/561 variables, 5/578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1064/1625 variables, 118/716 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1625 variables, 1064/1780 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1625 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 13/1638 variables, 5/1785 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1638 variables, 13/1798 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1638 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3732/3732 variables, and 3436 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5078 ms.
Refiners :[Domain max(s): 1638/1638 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 123/123 constraints, State Equation: 1638/1638 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/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 361/541 variables, 32/212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 361/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 20/561 variables, 5/578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1064/1625 variables, 118/716 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1625 variables, 1064/1780 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 00:22:35] [INFO ] Deduced a trap composed of 20 places in 1210 ms of which 133 ms to minimize.
[2024-05-21 00:22:36] [INFO ] Deduced a trap composed of 30 places in 1253 ms of which 13 ms to minimize.
[2024-05-21 00:22:38] [INFO ] Deduced a trap composed of 24 places in 1426 ms of which 14 ms to minimize.
SMT process timed out in 11567ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 295 place count 1638 transition count 1799
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 303 rules applied. Total rules applied 598 place count 1343 transition count 1791
Reduce places removed 2 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 2 with 30 rules applied. Total rules applied 628 place count 1341 transition count 1763
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 661 place count 1313 transition count 1758
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 309 Pre rules applied. Total rules applied 661 place count 1313 transition count 1449
Deduced a syphon composed of 309 places in 4 ms
Ensure Unique test removed 23 places
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 4 with 641 rules applied. Total rules applied 1302 place count 981 transition count 1449
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 18 rules applied. Total rules applied 1320 place count 974 transition count 1438
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 18 rules applied. Total rules applied 1338 place count 963 transition count 1431
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1345 place count 956 transition count 1431
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1345 place count 956 transition count 1422
Deduced a syphon composed of 9 places in 14 ms
Ensure Unique test removed 8 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1371 place count 939 transition count 1422
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 1371 place count 939 transition count 1416
Deduced a syphon composed of 6 places in 13 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1383 place count 933 transition count 1416
Discarding 50 places :
Symmetric choice reduction at 7 with 50 rule applications. Total rules 1433 place count 883 transition count 1366
Iterating global reduction 7 with 50 rules applied. Total rules applied 1483 place count 883 transition count 1366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1484 place count 883 transition count 1365
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 14 Pre rules applied. Total rules applied 1484 place count 883 transition count 1351
Deduced a syphon composed of 14 places in 13 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 29 rules applied. Total rules applied 1513 place count 868 transition count 1351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1513 place count 868 transition count 1350
Deduced a syphon composed of 1 places in 13 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1516 place count 866 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1517 place count 865 transition count 1344
Iterating global reduction 8 with 1 rules applied. Total rules applied 1518 place count 865 transition count 1344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1518 place count 865 transition count 1343
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1520 place count 864 transition count 1343
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 26 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 8 with 130 rules applied. Total rules applied 1650 place count 799 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1651 place count 798 transition count 1277
Iterating global reduction 8 with 1 rules applied. Total rules applied 1652 place count 798 transition count 1277
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1653 place count 798 transition count 1276
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 1660 place count 798 transition count 1269
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1667 place count 791 transition count 1269
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1669 place count 791 transition count 1267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1671 place count 789 transition count 1267
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1672 place count 789 transition count 1267
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1673 place count 789 transition count 1267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1674 place count 788 transition count 1266
Applied a total of 1674 rules in 1507 ms. Remains 788 /1638 variables (removed 850) and now considering 1266/2094 (removed 828) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1529 ms. Remains : 788/1638 places, 1266/2094 transitions.
RANDOM walk for 40000 steps (248 resets) in 1057 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (65 resets) in 170 ms. (233 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (68 resets) in 538 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (61 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (71 resets) in 344 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (63 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (57 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (63 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (60 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (70 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 170 ms. (233 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 155459 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 11
Probabilistic random walk after 155459 steps, saw 44361 distinct states, run finished after 3020 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 1266 rows 788 cols
[2024-05-21 00:22:43] [INFO ] Computed 120 invariants in 83 ms
[2024-05-21 00:22:44] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 191/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/373 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 409/782 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/783 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 5/788 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/788 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1266/2054 variables, 788/908 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2054 variables, 8/916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2054 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/2054 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 916 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6642 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 788/788 constraints, ReadFeed: 8/8 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 191/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/373 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 409/782 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 00:22:52] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 6 ms to minimize.
[2024-05-21 00:22:52] [INFO ] Deduced a trap composed of 67 places in 327 ms of which 5 ms to minimize.
[2024-05-21 00:22:53] [INFO ] Deduced a trap composed of 36 places in 354 ms of which 6 ms to minimize.
[2024-05-21 00:22:53] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 4 ms to minimize.
[2024-05-21 00:22:53] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 5 ms to minimize.
[2024-05-21 00:22:54] [INFO ] Deduced a trap composed of 83 places in 549 ms of which 6 ms to minimize.
[2024-05-21 00:22:54] [INFO ] Deduced a trap composed of 82 places in 437 ms of which 5 ms to minimize.
[2024-05-21 00:22:55] [INFO ] Deduced a trap composed of 83 places in 435 ms of which 6 ms to minimize.
[2024-05-21 00:22:55] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 4 ms to minimize.
[2024-05-21 00:22:56] [INFO ] Deduced a trap composed of 60 places in 508 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 00:22:56] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/783 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 00:22:57] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 5/788 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 00:22:59] [INFO ] Deduced a trap composed of 57 places in 333 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/788 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-03b-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2023-13 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2023-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 1266/2054 variables, 788/921 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2054 variables, 8/929 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2054/2054 variables, and 934 constraints, problems are : Problem set: 6 solved, 5 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 788/788 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 13/13 constraints]
After SMT, in 52021ms problems are : Problem set: 6 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 145 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1266/1266 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 788 transition count 1261
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 783 transition count 1258
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 780 transition count 1257
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 17 place count 780 transition count 1241
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 49 place count 764 transition count 1241
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 760 transition count 1237
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 760 transition count 1236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 759 transition count 1236
Applied a total of 59 rules in 109 ms. Remains 759 /788 variables (removed 29) and now considering 1236/1266 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 759/788 places, 1236/1266 transitions.
RANDOM walk for 40000 steps (297 resets) in 346 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (75 resets) in 419 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (74 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (73 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (73 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (68 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 204002 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 5
Probabilistic random walk after 204002 steps, saw 59036 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1236 rows 759 cols
[2024-05-21 00:23:39] [INFO ] Computed 120 invariants in 18 ms
[2024-05-21 00:23:39] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 197/342 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/344 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 409/753 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/754 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5/759 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/759 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1236/1995 variables, 759/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1995 variables, 11/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1995 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1995 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1995/1995 variables, and 890 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2224 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 759/759 constraints, ReadFeed: 11/11 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/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 197/342 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/344 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 409/753 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 00:23:42] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:23:42] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 2 ms to minimize.
[2024-05-21 00:23:42] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/754 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/759 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/759 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1236/1995 variables, 759/882 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1995 variables, 11/893 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1995 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 00:24:23] [INFO ] Deduced a trap composed of 78 places in 454 ms of which 6 ms to minimize.
[2024-05-21 00:24:23] [INFO ] Deduced a trap composed of 84 places in 463 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1995 variables, 2/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1995/1995 variables, and 900 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75011 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 759/759 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 77343ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 145 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1236/1236 transitions.
Applied a total of 0 rules in 28 ms. Remains 759 /759 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 759/759 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1236/1236 transitions.
Applied a total of 0 rules in 26 ms. Remains 759 /759 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2024-05-21 00:24:57] [INFO ] Invariant cache hit.
[2024-05-21 00:24:57] [INFO ] Implicit Places using invariants in 727 ms returned [3, 25, 26, 27, 32, 45, 212, 213, 215, 241, 260, 373, 375, 376, 425, 500, 529, 536, 549, 555, 556, 599, 604, 625, 648, 655, 662, 668, 674, 680, 687, 693, 699, 705, 711, 739, 742]
[2024-05-21 00:24:57] [INFO ] Actually due to overlaps returned [45, 241, 604, 213, 375, 555, 625, 25, 215, 376, 556, 599, 3, 212, 529, 260, 373, 425, 549, 680, 699, 711, 26, 27, 32, 536, 648, 655, 662, 668, 674, 687, 693, 705, 739]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 742 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 724/759 places, 1236/1236 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 723 transition count 1212
Reduce places removed 24 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 37 rules applied. Total rules applied 62 place count 699 transition count 1199
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 75 place count 686 transition count 1199
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 75 place count 686 transition count 1180
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 113 place count 667 transition count 1180
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 665 transition count 1180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 115 place count 665 transition count 1179
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 664 transition count 1179
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 130 place count 651 transition count 1166
Iterating global reduction 4 with 13 rules applied. Total rules applied 143 place count 651 transition count 1166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 143 place count 651 transition count 1165
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 650 transition count 1165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 148 place count 647 transition count 1162
Iterating global reduction 4 with 3 rules applied. Total rules applied 151 place count 647 transition count 1162
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 197 place count 624 transition count 1139
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 624 transition count 1131
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 213 place count 616 transition count 1131
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 616 transition count 1130
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 616 transition count 1130
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 616 transition count 1130
Applied a total of 216 rules in 183 ms. Remains 616 /724 variables (removed 108) and now considering 1130/1236 (removed 106) transitions.
// Phase 1: matrix 1130 rows 616 cols
[2024-05-21 00:24:57] [INFO ] Computed 82 invariants in 12 ms
[2024-05-21 00:24:58] [INFO ] Implicit Places using invariants in 638 ms returned [125, 150, 287, 288, 295, 306, 307, 424, 436]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 640 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 607/759 places, 1130/1236 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 605 transition count 1128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 605 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 604 transition count 1127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 604 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 603 transition count 1126
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 603 transition count 1126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 600 transition count 1123
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 600 transition count 1118
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 24 place count 595 transition count 1118
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 595 transition count 1118
Applied a total of 25 rules in 100 ms. Remains 595 /607 variables (removed 12) and now considering 1118/1130 (removed 12) transitions.
// Phase 1: matrix 1118 rows 595 cols
[2024-05-21 00:24:58] [INFO ] Computed 73 invariants in 11 ms
[2024-05-21 00:24:59] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-21 00:24:59] [INFO ] Invariant cache hit.
[2024-05-21 00:24:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 00:25:00] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 595/759 places, 1118/1236 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3957 ms. Remains : 595/759 places, 1118/1236 transitions.
RANDOM walk for 40000 steps (332 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (84 resets) in 210 ms. (189 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (86 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (87 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (81 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 278274 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 5
Probabilistic random walk after 278274 steps, saw 50197 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-21 00:25:04] [INFO ] Invariant cache hit.
[2024-05-21 00:25:04] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 159/304 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 291/595 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1118/1713 variables, 595/668 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1713 variables, 5/673 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1713 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1713 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1713/1713 variables, and 673 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1620 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 595/595 constraints, ReadFeed: 5/5 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/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 159/304 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 291/595 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 00:25:06] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 4 ms to minimize.
[2024-05-21 00:25:06] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 4 ms to minimize.
[2024-05-21 00:25:07] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1118/1713 variables, 595/671 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1713 variables, 5/676 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1713 variables, 5/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 00:25:31] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 3 ms to minimize.
[2024-05-21 00:25:32] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 3 ms to minimize.
[2024-05-21 00:25:49] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1713 variables, 3/684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1713 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1713 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1713/1713 variables, and 684 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49379 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 595/595 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 51091ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 27606 ms.
Support contains 145 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1118/1118 transitions.
Applied a total of 0 rules in 20 ms. Remains 595 /595 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 595/595 places, 1118/1118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1118/1118 transitions.
Applied a total of 0 rules in 16 ms. Remains 595 /595 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
[2024-05-21 00:26:23] [INFO ] Invariant cache hit.
[2024-05-21 00:26:23] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-21 00:26:23] [INFO ] Invariant cache hit.
[2024-05-21 00:26:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 00:26:25] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 2554 ms to find 0 implicit places.
[2024-05-21 00:26:25] [INFO ] Redundant transitions in 93 ms returned []
Running 1106 sub problems to find dead transitions.
[2024-05-21 00:26:25] [INFO ] Invariant cache hit.
[2024-05-21 00:26:25] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/591 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 3 (OVERLAPS) 4/595 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
SMT process timed out in 30790ms, After SMT, problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 30810ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33495 ms. Remains : 595/595 places, 1118/1118 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2578 edges and 595 vertex of which 594 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 594 transition count 1117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 593 transition count 1117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 593 transition count 1115
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 591 transition count 1115
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 590 transition count 1115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 586 transition count 1111
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 586 transition count 1110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 585 transition count 1110
Applied a total of 18 rules in 76 ms. Remains 585 /595 variables (removed 10) and now considering 1110/1118 (removed 8) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1110 rows 585 cols
[2024-05-21 00:26:56] [INFO ] Computed 71 invariants in 20 ms
[2024-05-21 00:26:56] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 00:26:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-21 00:26:57] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 44 ms returned sat
[2024-05-21 00:27:16] [INFO ] After 19142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-21 00:27:28] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-05-21 00:27:28] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 3 ms to minimize.
[2024-05-21 00:27:28] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 4 ms to minimize.
[2024-05-21 00:27:29] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2024-05-21 00:27:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1585 ms
[2024-05-21 00:27:31] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 3 ms to minimize.
[2024-05-21 00:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
TRAPS : Iteration 1
[2024-05-21 00:27:33] [INFO ] Deduced a trap composed of 36 places in 480 ms of which 6 ms to minimize.
[2024-05-21 00:27:34] [INFO ] Deduced a trap composed of 36 places in 472 ms of which 11 ms to minimize.
[2024-05-21 00:27:34] [INFO ] Deduced a trap composed of 187 places in 425 ms of which 6 ms to minimize.
[2024-05-21 00:27:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2132 ms
TRAPS : Iteration 2
[2024-05-21 00:27:56] [INFO ] After 59298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-21 00:28:15] [INFO ] After 78610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 78967 ms.
[2024-05-21 00:28:15] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-21 00:28:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 595 places, 1118 transitions and 4247 arcs took 16 ms.
[2024-05-21 00:28:16] [INFO ] Flatten gal took : 210 ms
Total runtime 353224 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ASLink-PT-03b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 595
TRANSITIONS: 1118
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.033s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 732
MODEL NAME: /home/mcc/execution/414/model
595 places, 1118 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="ASLink-PT-03b"
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 ASLink-PT-03b, 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 r003-smll-171620116900055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03b.tgz
mv ASLink-PT-03b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;