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.r464-smll-171620117700055.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700055
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:41:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:41:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:41:06] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2024-05-31 21:41:06] [INFO ] Transformed 1638 places.
[2024-05-31 21:41:06] [INFO ] Transformed 2094 transitions.
[2024-05-31 21:41:06] [INFO ] Found NUPN structural information;
[2024-05-31 21:41:06] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 678 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 87 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (117 resets) in 3298 ms. (12 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 40004 steps (20 resets) in 614 ms. (65 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (20 resets) in 405 ms. (98 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (18 resets) in 935 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (20 resets) in 282 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (19 resets) in 576 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (15 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (19 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (17 resets) in 298 ms. (133 steps per ms) remains 9/12 properties
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (17 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
// Phase 1: matrix 2094 rows 1638 cols
[2024-05-31 21:41:10] [INFO ] Computed 160 invariants in 198 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 365/527 variables, 32/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 365/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 20/547 variables, 5/564 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 20/584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1078/1625 variables, 118/702 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1625 variables, 1078/1780 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1625 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 13/1638 variables, 5/1785 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1638 variables, 13/1798 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1638 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 2094/3732 variables, 1638/3436 constraints. Problems are: Problem set: 0 solved, 9 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, 9 unsolved in 5124 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: 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/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 365/527 variables, 32/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 365/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 20/547 variables, 5/564 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 20/584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1078/1625 variables, 118/702 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1625 variables, 1078/1780 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 21:41:17] [INFO ] Deduced a trap composed of 169 places in 686 ms of which 90 ms to minimize.
[2024-05-31 21:41:18] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 12 ms to minimize.
[2024-05-31 21:41:19] [INFO ] Deduced a trap composed of 101 places in 979 ms of which 5 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 37 places in 770 ms of which 12 ms to minimize.
[2024-05-31 21:41:20] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 5 ms to minimize.
SMT process timed out in 10935ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 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 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 303 rules applied. Total rules applied 303 place count 1638 transition count 1791
Reduce places removed 303 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 311 rules applied. Total rules applied 614 place count 1335 transition count 1783
Reduce places removed 2 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 27 rules applied. Total rules applied 641 place count 1333 transition count 1758
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 671 place count 1308 transition count 1753
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 315 Pre rules applied. Total rules applied 671 place count 1308 transition count 1438
Deduced a syphon composed of 315 places in 6 ms
Ensure Unique test removed 23 places
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 653 rules applied. Total rules applied 1324 place count 970 transition count 1438
Discarding 7 places :
Implicit places reduction removed 7 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 19 rules applied. Total rules applied 1343 place count 963 transition count 1426
Reduce places removed 12 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 19 rules applied. Total rules applied 1362 place count 951 transition count 1419
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1369 place count 944 transition count 1419
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1369 place count 944 transition count 1410
Deduced a syphon composed of 9 places in 9 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 1395 place count 927 transition count 1410
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 1395 place count 927 transition count 1404
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1407 place count 921 transition count 1404
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 1458 place count 870 transition count 1353
Iterating global reduction 7 with 51 rules applied. Total rules applied 1509 place count 870 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1510 place count 870 transition count 1352
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 14 Pre rules applied. Total rules applied 1510 place count 870 transition count 1338
Deduced a syphon composed of 14 places in 8 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 1539 place count 855 transition count 1338
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1539 place count 855 transition count 1337
Deduced a syphon composed of 1 places in 8 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 1542 place count 853 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1543 place count 852 transition count 1331
Iterating global reduction 8 with 1 rules applied. Total rules applied 1544 place count 852 transition count 1331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1544 place count 852 transition count 1330
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1546 place count 851 transition count 1330
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 6 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 8 with 136 rules applied. Total rules applied 1682 place count 783 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1683 place count 782 transition count 1261
Iterating global reduction 8 with 1 rules applied. Total rules applied 1684 place count 782 transition count 1261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1686 place count 781 transition count 1270
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 1687 place count 781 transition count 1269
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 1694 place count 781 transition count 1262
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1701 place count 774 transition count 1262
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1703 place count 774 transition count 1260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1705 place count 772 transition count 1260
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 1706 place count 772 transition count 1260
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 1707 place count 772 transition count 1260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1708 place count 771 transition count 1259
Applied a total of 1708 rules in 1476 ms. Remains 771 /1638 variables (removed 867) and now considering 1259/2094 (removed 835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1498 ms. Remains : 771/1638 places, 1259/2094 transitions.
RANDOM walk for 40000 steps (258 resets) in 527 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (63 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (68 resets) in 241 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 436 ms. (91 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (66 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (63 resets) in 275 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (63 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (65 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 146164 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 9
Probabilistic random walk after 146164 steps, saw 50313 distinct states, run finished after 3007 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 1259 rows 771 cols
[2024-05-31 21:41:26] [INFO ] Computed 120 invariants in 59 ms
[2024-05-31 21:41:26] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 189/351 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 412/765 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/766 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 5/771 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/771 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1259/2030 variables, 771/891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2030 variables, 10/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2030 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/2030 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2030/2030 variables, and 901 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3345 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 771/771 constraints, ReadFeed: 10/10 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/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 189/351 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 412/765 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 21:41:30] [INFO ] Deduced a trap composed of 83 places in 263 ms of which 4 ms to minimize.
[2024-05-31 21:41:30] [INFO ] Deduced a trap composed of 101 places in 366 ms of which 18 ms to minimize.
[2024-05-31 21:41:31] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 2 ms to minimize.
[2024-05-31 21:41:31] [INFO ] Deduced a trap composed of 82 places in 315 ms of which 4 ms to minimize.
[2024-05-31 21:41:31] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 2 ms to minimize.
[2024-05-31 21:41:32] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 21:41:32] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/766 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 21:41:33] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/766 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 5/771 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/771 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 9 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 14 (OVERLAPS) 1259/2030 variables, 771/899 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2030 variables, 10/909 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2030/2030 variables, and 912 constraints, problems are : Problem set: 6 solved, 3 unsolved in 31785 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 771/771 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 8/8 constraints]
After SMT, in 35350ms problems are : Problem set: 6 solved, 3 unsolved
Parikh walk visited 0 properties in 13964 ms.
Support contains 124 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1259/1259 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 771 transition count 1254
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 766 transition count 1253
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 765 transition count 1252
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 13 place count 765 transition count 1231
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 55 place count 744 transition count 1231
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 741 transition count 1228
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 741 transition count 1226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 739 transition count 1226
Applied a total of 65 rules in 128 ms. Remains 739 /771 variables (removed 32) and now considering 1226/1259 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 739/771 places, 1226/1259 transitions.
RANDOM walk for 40000 steps (286 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (78 resets) in 454 ms. (87 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (74 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227377 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227377 steps, saw 80715 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 1226 rows 739 cols
[2024-05-31 21:42:19] [INFO ] Computed 120 invariants in 24 ms
[2024-05-31 21:42:19] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 205/329 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/332 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 402/734 variables, 86/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/735 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/739 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1226/1965 variables, 739/859 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1965 variables, 13/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1965 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1965 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1965/1965 variables, and 872 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1962 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 89/89 constraints, State Equation: 739/739 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 205/329 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/332 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:42:21] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 402/734 variables, 86/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:42:21] [INFO ] Deduced a trap composed of 82 places in 310 ms of which 4 ms to minimize.
[2024-05-31 21:42:22] [INFO ] Deduced a trap composed of 81 places in 288 ms of which 5 ms to minimize.
[2024-05-31 21:42:22] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 4 ms to minimize.
[2024-05-31 21:42:22] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/735 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/739 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/739 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1226/1965 variables, 739/864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1965 variables, 13/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1965 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:42:34] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1965 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1965 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1965 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1965/1965 variables, and 881 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15506 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 89/89 constraints, State Equation: 739/739 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 17563ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3218 ms.
Support contains 124 out of 739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 739/739 places, 1226/1226 transitions.
Applied a total of 0 rules in 26 ms. Remains 739 /739 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 739/739 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 739/739 places, 1226/1226 transitions.
Applied a total of 0 rules in 24 ms. Remains 739 /739 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-05-31 21:42:39] [INFO ] Invariant cache hit.
[2024-05-31 21:42:40] [INFO ] Implicit Places using invariants in 983 ms returned [3, 24, 25, 26, 31, 44, 203, 204, 205, 207, 231, 250, 358, 360, 361, 409, 483, 512, 519, 532, 538, 539, 581, 586, 606, 629, 636, 643, 649, 655, 661, 667, 673, 679, 685, 691, 719, 722]
[2024-05-31 21:42:40] [INFO ] Actually due to overlaps returned [44, 231, 586, 205, 360, 538, 606, 24, 204, 207, 361, 539, 581, 3, 512, 203, 250, 358, 409, 532, 661, 679, 691, 25, 26, 31, 519, 629, 636, 643, 649, 655, 667, 673, 685, 719]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 999 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 703/739 places, 1226/1226 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 702 transition count 1202
Reduce places removed 24 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 35 rules applied. Total rules applied 60 place count 678 transition count 1191
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 71 place count 667 transition count 1191
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 71 place count 667 transition count 1171
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 111 place count 647 transition count 1171
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 644 transition count 1171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 114 place count 644 transition count 1170
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 643 transition count 1170
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 129 place count 630 transition count 1157
Iterating global reduction 4 with 13 rules applied. Total rules applied 142 place count 630 transition count 1157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 142 place count 630 transition count 1156
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 144 place count 629 transition count 1156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 626 transition count 1153
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 626 transition count 1153
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 4 with 52 rules applied. Total rules applied 202 place count 600 transition count 1127
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 600 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 599 transition count 1126
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 213 place count 599 transition count 1117
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 222 place count 590 transition count 1117
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 590 transition count 1115
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 590 transition count 1115
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 590 transition count 1115
Applied a total of 226 rules in 194 ms. Remains 590 /703 variables (removed 113) and now considering 1115/1226 (removed 111) transitions.
// Phase 1: matrix 1115 rows 590 cols
[2024-05-31 21:42:41] [INFO ] Computed 80 invariants in 11 ms
[2024-05-31 21:42:41] [INFO ] Implicit Places using invariants in 586 ms returned [118, 143, 267, 268, 275, 285, 286, 401, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 588 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 581/739 places, 1115/1226 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 579 transition count 1113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 579 transition count 1113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 578 transition count 1112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 578 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 577 transition count 1111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 577 transition count 1111
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 574 transition count 1108
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 574 transition count 1103
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 24 place count 569 transition count 1103
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 569 transition count 1103
Applied a total of 25 rules in 99 ms. Remains 569 /581 variables (removed 12) and now considering 1103/1115 (removed 12) transitions.
// Phase 1: matrix 1103 rows 569 cols
[2024-05-31 21:42:41] [INFO ] Computed 71 invariants in 10 ms
[2024-05-31 21:42:42] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-31 21:42:42] [INFO ] Invariant cache hit.
[2024-05-31 21:42:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 21:42:43] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 569/739 places, 1103/1226 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3941 ms. Remains : 569/739 places, 1103/1226 transitions.
RANDOM walk for 40000 steps (333 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (87 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (76 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 345420 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 3
Probabilistic random walk after 345420 steps, saw 65147 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-31 21:42:47] [INFO ] Invariant cache hit.
[2024-05-31 21:42:47] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/252 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/569 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1103/1672 variables, 569/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1672 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1672 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1672 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1672/1672 variables, and 644 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 569/569 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/252 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 317/569 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:42:48] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-31 21:42:49] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:42:49] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 4 ms to minimize.
[2024-05-31 21:42:49] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1103/1672 variables, 569/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1672 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1672 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:43:12] [INFO ] Deduced a trap composed of 62 places in 360 ms of which 4 ms to minimize.
[2024-05-31 21:43:12] [INFO ] Deduced a trap composed of 43 places in 330 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1672 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1672 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1672 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 653 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26362 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 569/569 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 27693ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 20803 ms.
Support contains 124 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 1103/1103 transitions.
Applied a total of 0 rules in 20 ms. Remains 569 /569 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 569/569 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 1103/1103 transitions.
Applied a total of 0 rules in 16 ms. Remains 569 /569 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-31 21:43:35] [INFO ] Invariant cache hit.
[2024-05-31 21:43:36] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-31 21:43:36] [INFO ] Invariant cache hit.
[2024-05-31 21:43:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 21:43:37] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-05-31 21:43:37] [INFO ] Redundant transitions in 92 ms returned []
Running 1091 sub problems to find dead transitions.
[2024-05-31 21:43:37] [INFO ] Invariant cache hit.
[2024-05-31 21:43:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 3 (OVERLAPS) 4/569 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
SMT process timed out in 30802ms, After SMT, problems are : Problem set: 0 solved, 1091 unsolved
Search for dead transitions found 0 dead transitions in 30818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32612 ms. Remains : 569/569 places, 1103/1103 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 569 transition count 1102
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 568 transition count 1102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 565 transition count 1099
Applied a total of 8 rules in 30 ms. Remains 565 /569 variables (removed 4) and now considering 1099/1103 (removed 4) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1099 rows 565 cols
[2024-05-31 21:44:08] [INFO ] Computed 71 invariants in 10 ms
[2024-05-31 21:44:08] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 21:44:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-31 21:44:08] [INFO ] [Nat]Absence check using 18 positive and 53 generalized place invariants in 29 ms returned sat
[2024-05-31 21:44:18] [INFO ] After 9978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 21:44:20] [INFO ] Deduced a trap composed of 27 places in 463 ms of which 22 ms to minimize.
[2024-05-31 21:44:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2024-05-31 21:44:21] [INFO ] Deduced a trap composed of 62 places in 302 ms of which 5 ms to minimize.
[2024-05-31 21:44:22] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 4 ms to minimize.
[2024-05-31 21:44:22] [INFO ] Deduced a trap composed of 61 places in 321 ms of which 4 ms to minimize.
[2024-05-31 21:44:23] [INFO ] Deduced a trap composed of 61 places in 576 ms of which 15 ms to minimize.
[2024-05-31 21:44:23] [INFO ] Deduced a trap composed of 59 places in 539 ms of which 4 ms to minimize.
[2024-05-31 21:44:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2498 ms
TRAPS : Iteration 1
[2024-05-31 21:44:24] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-05-31 21:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-05-31 21:44:30] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 5 ms to minimize.
[2024-05-31 21:44:30] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-05-31 21:44:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 715 ms
TRAPS : Iteration 2
[2024-05-31 21:44:38] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 13 ms to minimize.
[2024-05-31 21:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
TRAPS : Iteration 3
[2024-05-31 21:44:42] [INFO ] Deduced a trap composed of 79 places in 230 ms of which 3 ms to minimize.
[2024-05-31 21:44:42] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 3 ms to minimize.
[2024-05-31 21:44:42] [INFO ] Deduced a trap composed of 80 places in 274 ms of which 3 ms to minimize.
[2024-05-31 21:44:43] [INFO ] Deduced a trap composed of 58 places in 219 ms of which 2 ms to minimize.
[2024-05-31 21:44:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1248 ms
[2024-05-31 21:44:47] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 4 ms to minimize.
[2024-05-31 21:44:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
TRAPS : Iteration 4
[2024-05-31 21:44:56] [INFO ] After 47517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 21:45:02] [INFO ] After 54301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 54551 ms.
[2024-05-31 21:45:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-31 21:45:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 569 places, 1103 transitions and 4234 arcs took 14 ms.
[2024-05-31 21:45:03] [INFO ] Flatten gal took : 205 ms
Total runtime 237392 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-03b-ReachabilityFireability-2023-04
Could not compute solution for formula : ASLink-PT-03b-ReachabilityFireability-2024-06
Could not compute solution for formula : ASLink-PT-03b-ReachabilityFireability-2024-14

BK_STOP 1717191903900

--------------------
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
mcc2024
rfs formula name ASLink-PT-03b-ReachabilityFireability-2023-04
rfs formula type AG
rfs formula formula --invariant=/tmp/707/inv_0_
rfs formula name ASLink-PT-03b-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/707/inv_1_
rfs formula name ASLink-PT-03b-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/707/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r464-smll-171620117700055"
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 '' 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 ;