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-171620116900039.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-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116900039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 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:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 417K 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-02b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-01
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-03
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-06
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716236964369

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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 20:29:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-20 20:29:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:29:26] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-05-20 20:29:26] [INFO ] Transformed 1242 places.
[2024-05-20 20:29:26] [INFO ] Transformed 1621 transitions.
[2024-05-20 20:29:26] [INFO ] Found NUPN structural information;
[2024-05-20 20:29:26] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 517 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 120 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (162 resets) in 2715 ms. (14 steps per ms) remains 11/16 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 395 ms. (101 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (27 resets) in 337 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (33 resets) in 991 ms. (40 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (35 resets) in 1103 ms. (36 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (33 resets) in 252 ms. (158 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (33 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (36 resets) in 244 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (28 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (28 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (33 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
// Phase 1: matrix 1621 rows 1242 cols
[2024-05-20 20:29:29] [INFO ] Computed 121 invariants in 141 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 259/449 variables, 21/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 259/470 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 33/482 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 33/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 747/1229 variables, 90/599 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 747/1346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 13/1242 variables, 4/1350 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 13/1363 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1621/2863 variables, 1242/2605 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2605 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5088 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 1242/1242 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/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 259/449 variables, 21/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 259/470 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-20 20:29:35] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 33/482 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 33/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 747/1229 variables, 90/600 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 747/1347 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-20 20:29:37] [INFO ] Deduced a trap composed of 99 places in 729 ms of which 15 ms to minimize.
[2024-05-20 20:29:38] [INFO ] Deduced a trap composed of 53 places in 672 ms of which 17 ms to minimize.
[2024-05-20 20:29:39] [INFO ] Deduced a trap composed of 67 places in 690 ms of which 11 ms to minimize.
[2024-05-20 20:29:39] [INFO ] Deduced a trap composed of 56 places in 403 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1229/2863 variables, and 1351 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5008 ms.
Refiners :[Domain max(s): 1229/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 90/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 10637ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1242 transition count 1416
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 212 rules applied. Total rules applied 417 place count 1037 transition count 1409
Reduce places removed 1 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 21 rules applied. Total rules applied 438 place count 1036 transition count 1389
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 459 place count 1016 transition count 1388
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 234 Pre rules applied. Total rules applied 459 place count 1016 transition count 1154
Deduced a syphon composed of 234 places in 5 ms
Ensure Unique test removed 17 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 4 with 485 rules applied. Total rules applied 944 place count 765 transition count 1154
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 17 rules applied. Total rules applied 961 place count 760 transition count 1142
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 14 rules applied. Total rules applied 975 place count 748 transition count 1140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 977 place count 746 transition count 1140
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 977 place count 746 transition count 1133
Deduced a syphon composed of 7 places in 7 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 994 place count 736 transition count 1133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 994 place count 736 transition count 1130
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1000 place count 733 transition count 1130
Discarding 34 places :
Symmetric choice reduction at 7 with 34 rule applications. Total rules 1034 place count 699 transition count 1096
Iterating global reduction 7 with 34 rules applied. Total rules applied 1068 place count 699 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1069 place count 699 transition count 1095
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1069 place count 699 transition count 1085
Deduced a syphon composed of 10 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1090 place count 688 transition count 1085
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1090 place count 688 transition count 1084
Deduced a syphon composed of 1 places in 7 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 1093 place count 686 transition count 1084
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1096 place count 683 transition count 1063
Iterating global reduction 8 with 3 rules applied. Total rules applied 1099 place count 683 transition count 1063
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1099 place count 683 transition count 1061
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1103 place count 681 transition count 1061
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 8 with 127 rules applied. Total rules applied 1230 place count 617 transition count 998
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1232 place count 616 transition count 1007
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 1233 place count 616 transition count 1006
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1234 place count 616 transition count 1005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1235 place count 615 transition count 1005
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1236 place count 615 transition count 1004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1237 place count 614 transition count 1004
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1240 place count 614 transition count 1004
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1241 place count 613 transition count 1003
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1243 place count 611 transition count 1003
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1243 place count 611 transition count 1000
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1249 place count 608 transition count 1000
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 11 with 1 rules applied. Total rules applied 1250 place count 607 transition count 1000
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1254 place count 605 transition count 998
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1255 place count 605 transition count 997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1256 place count 604 transition count 997
Applied a total of 1256 rules in 1007 ms. Remains 604 /1242 variables (removed 638) and now considering 997/1621 (removed 624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1022 ms. Remains : 604/1242 places, 997/1621 transitions.
RANDOM walk for 40000 steps (322 resets) in 476 ms. (83 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (105 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (111 resets) in 293 ms. (136 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (108 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (89 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (101 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (98 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (115 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (88 resets) in 80 ms. (493 steps per ms) remains 9/10 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (100 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
// Phase 1: matrix 997 rows 604 cols
[2024-05-20 20:29:41] [INFO ] Computed 90 invariants in 47 ms
[2024-05-20 20:29:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 192/346 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/348 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 253/601 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/603 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/604 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 997/1601 variables, 604/694 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1601 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1601 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1601 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1601/1601 variables, and 695 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3231 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 604/604 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 192/346 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 20:29:45] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/348 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 253/601 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 20:29:46] [INFO ] Deduced a trap composed of 108 places in 511 ms of which 9 ms to minimize.
[2024-05-20 20:29:47] [INFO ] Deduced a trap composed of 82 places in 547 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 20:29:47] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-20 20:29:48] [INFO ] Deduced a trap composed of 81 places in 678 ms of which 17 ms to minimize.
[2024-05-20 20:29:48] [INFO ] Deduced a trap composed of 107 places in 610 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 32 places in 672 ms of which 8 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 47 places in 602 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/603 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/604 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/604 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2023-01 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-03 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-06 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-15 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 997/1601 variables, 604/702 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1601 variables, 1/703 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1601 variables, 2/705 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1601/1601 variables, and 705 constraints, problems are : Problem set: 7 solved, 2 unsolved in 34767 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 604/604 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 8/8 constraints]
After SMT, in 38166ms problems are : Problem set: 7 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 997/997 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 604 transition count 981
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 22 rules applied. Total rules applied 38 place count 586 transition count 977
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 583 transition count 977
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 41 place count 583 transition count 917
Deduced a syphon composed of 60 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 165 place count 519 transition count 917
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 517 transition count 917
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 515 transition count 915
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 515 transition count 915
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 514 transition count 914
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 514 transition count 914
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 195 place count 503 transition count 903
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 198 place count 503 transition count 900
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 201 place count 500 transition count 900
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 500 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 499 transition count 899
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 205 place count 497 transition count 897
Applied a total of 205 rules in 347 ms. Remains 497 /604 variables (removed 107) and now considering 897/997 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 497/604 places, 897/997 transitions.
RANDOM walk for 40000 steps (519 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (168 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (122 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 306267 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 306267 steps, saw 77593 distinct states, run finished after 3008 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 897 rows 497 cols
[2024-05-20 20:30:23] [INFO ] Computed 81 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/207 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 264/471 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/476 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/497 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 897/1394 variables, 497/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1394 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 20:30:24] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1394 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1394 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1394 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1394/1394 variables, and 579 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/207 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 264/471 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/476 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/497 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 897/1394 variables, 497/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1394 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1394 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1394 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1394/1394 variables, and 581 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 4483ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2279 ms.
Support contains 50 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 897/897 transitions.
Applied a total of 0 rules in 23 ms. Remains 497 /497 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 497/497 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 897/897 transitions.
Applied a total of 0 rules in 19 ms. Remains 497 /497 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2024-05-20 20:30:30] [INFO ] Invariant cache hit.
[2024-05-20 20:30:30] [INFO ] Implicit Places using invariants in 646 ms returned [3, 22, 43, 61, 79, 158, 162, 163, 174, 175, 177, 196, 215, 257, 296, 300, 301, 304, 316, 317, 318, 354, 356, 361, 381, 386, 387, 400, 406, 412, 418, 424, 430, 437, 443, 449, 455]
[2024-05-20 20:30:30] [INFO ] Actually due to overlaps returned [354, 318, 43, 61, 196, 361, 177, 174, 316, 175, 317, 356, 381, 3, 300, 301, 22, 79, 215, 386, 430, 449, 162, 163, 304, 387, 400, 406, 412, 418, 424, 437, 443, 455]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 660 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/497 places, 897/897 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 460 transition count 863
Reduce places removed 34 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 58 rules applied. Total rules applied 95 place count 426 transition count 839
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 120 place count 402 transition count 838
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 120 place count 402 transition count 829
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 138 place count 393 transition count 829
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 147 place count 384 transition count 820
Iterating global reduction 3 with 9 rules applied. Total rules applied 156 place count 384 transition count 820
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 382 transition count 816
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 382 transition count 816
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 212 place count 356 transition count 790
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 354 transition count 788
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 354 transition count 788
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 218 place count 354 transition count 786
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 353 transition count 787
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 233 place count 353 transition count 774
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 247 place count 339 transition count 774
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 248 place count 339 transition count 773
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 339 transition count 773
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 339 transition count 773
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 253 place count 338 transition count 772
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 338 transition count 772
Applied a total of 254 rules in 187 ms. Remains 338 /463 variables (removed 125) and now considering 772/897 (removed 125) transitions.
// Phase 1: matrix 772 rows 338 cols
[2024-05-20 20:30:30] [INFO ] Computed 43 invariants in 7 ms
[2024-05-20 20:30:31] [INFO ] Implicit Places using invariants in 326 ms returned [87, 110, 116, 119, 121, 127, 128, 187, 208, 224, 325, 328, 331, 334, 337]
[2024-05-20 20:30:31] [INFO ] Actually due to overlaps returned [127, 128, 116, 121, 87, 110, 187, 208, 224, 325, 328, 331, 334, 337]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 330 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 324/497 places, 772/897 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 323 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 317 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 317 transition count 765
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 313 transition count 761
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 313 transition count 761
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 313 transition count 758
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 33 place count 309 transition count 754
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 38 place count 309 transition count 749
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 43 place count 304 transition count 749
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 304 transition count 748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 303 transition count 748
Applied a total of 45 rules in 91 ms. Remains 303 /324 variables (removed 21) and now considering 748/772 (removed 24) transitions.
// Phase 1: matrix 748 rows 303 cols
[2024-05-20 20:30:31] [INFO ] Computed 29 invariants in 7 ms
[2024-05-20 20:30:31] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-20 20:30:31] [INFO ] Invariant cache hit.
[2024-05-20 20:30:32] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 303/497 places, 748/897 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2474 ms. Remains : 303/497 places, 748/897 transitions.
RANDOM walk for 40000 steps (742 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (243 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (179 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 279349 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 279349 steps, saw 136332 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-20 20:30:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/172 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 130/302 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/303 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 748/1051 variables, 303/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 20:30:36] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1051 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1051 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1051 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1051/1051 variables, and 333 constraints, problems are : Problem set: 0 solved, 2 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/172 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 130/302 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/303 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 748/1051 variables, 303/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1051 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1051 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1051 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1051/1051 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8805 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 9602ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 10178 ms.
Support contains 50 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 748/748 transitions.
Applied a total of 0 rules in 27 ms. Remains 303 /303 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 303/303 places, 748/748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 748/748 transitions.
Applied a total of 0 rules in 13 ms. Remains 303 /303 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2024-05-20 20:30:55] [INFO ] Invariant cache hit.
[2024-05-20 20:30:55] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-20 20:30:55] [INFO ] Invariant cache hit.
[2024-05-20 20:30:56] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2024-05-20 20:30:56] [INFO ] Redundant transitions in 50 ms returned []
Running 730 sub problems to find dead transitions.
[2024-05-20 20:30:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (OVERLAPS) 1/302 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-20 20:31:14] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 3 ms to minimize.
[2024-05-20 20:31:14] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2024-05-20 20:31:17] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 2 ms to minimize.
[2024-05-20 20:31:18] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 3 ms to minimize.
[2024-05-20 20:31:19] [INFO ] Deduced a trap composed of 102 places in 240 ms of which 3 ms to minimize.
[2024-05-20 20:31:22] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 2 ms to minimize.
[2024-05-20 20:31:22] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 2 ms to minimize.
[2024-05-20 20:31:23] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1051 variables, and 35 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/20 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (OVERLAPS) 1/302 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-20 20:31:35] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-05-20 20:31:41] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 8 (OVERLAPS) 1/303 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:31:53] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/1051 variables, and 43 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 0/730 constraints, Known Traps: 14/14 constraints]
After SMT, in 60632ms problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61827 ms. Remains : 303/303 places, 748/748 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 303 transition count 747
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 747
Applied a total of 2 rules in 17 ms. Remains 302 /303 variables (removed 1) and now considering 747/748 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 747 rows 302 cols
[2024-05-20 20:31:57] [INFO ] Computed 29 invariants in 6 ms
[2024-05-20 20:31:57] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 20:31:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-20 20:31:57] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 13 ms returned sat
[2024-05-20 20:32:06] [INFO ] After 8871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-20 20:32:09] [INFO ] After 11817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-20 20:32:10] [INFO ] After 12956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 13096 ms.
[2024-05-20 20:32:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-05-20 20:32:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 303 places, 748 transitions and 2940 arcs took 13 ms.
[2024-05-20 20:32:10] [INFO ] Flatten gal took : 173 ms
Total runtime 164949 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-02b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 303
TRANSITIONS: 748
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.017s, Sys 0.007s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 706
MODEL NAME: /home/mcc/execution/412/model
303 places, 748 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...
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716237734194

--------------------
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

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-02b"
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-02b, 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-171620116900039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;