About the Execution of LTSMin+red for ASLink-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 670.092 | 39125.00 | 80516.00 | 215.00 | FFTTFTFFFTTFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117700060.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-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 436K 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-04a-LTLFireability-00
FORMULA_NAME ASLink-PT-04a-LTLFireability-01
FORMULA_NAME ASLink-PT-04a-LTLFireability-02
FORMULA_NAME ASLink-PT-04a-LTLFireability-03
FORMULA_NAME ASLink-PT-04a-LTLFireability-04
FORMULA_NAME ASLink-PT-04a-LTLFireability-05
FORMULA_NAME ASLink-PT-04a-LTLFireability-06
FORMULA_NAME ASLink-PT-04a-LTLFireability-07
FORMULA_NAME ASLink-PT-04a-LTLFireability-08
FORMULA_NAME ASLink-PT-04a-LTLFireability-09
FORMULA_NAME ASLink-PT-04a-LTLFireability-10
FORMULA_NAME ASLink-PT-04a-LTLFireability-11
FORMULA_NAME ASLink-PT-04a-LTLFireability-12
FORMULA_NAME ASLink-PT-04a-LTLFireability-13
FORMULA_NAME ASLink-PT-04a-LTLFireability-14
FORMULA_NAME ASLink-PT-04a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717192267367
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:51:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:51:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:51:09] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2024-05-31 21:51:09] [INFO ] Transformed 1016 places.
[2024-05-31 21:51:09] [INFO ] Transformed 1554 transitions.
[2024-05-31 21:51:09] [INFO ] Found NUPN structural information;
[2024-05-31 21:51:09] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-04a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 993 transition count 1538
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 986 transition count 1516
Ensure Unique test removed 1 places
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 985 transition count 1516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 985 transition count 1514
Applied a total of 40 rules in 333 ms. Remains 985 /1016 variables (removed 31) and now considering 1514/1538 (removed 24) transitions.
// Phase 1: matrix 1514 rows 985 cols
[2024-05-31 21:51:10] [INFO ] Computed 170 invariants in 167 ms
[2024-05-31 21:51:12] [INFO ] Implicit Places using invariants in 1994 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 215, 220, 221, 259, 388, 404, 409, 410, 411, 429, 447, 576, 592, 597, 598, 599, 617, 635, 764, 769, 781, 786, 787, 788, 823, 825, 828, 846, 847, 848, 849, 866, 874, 882, 888, 894, 906, 914, 920, 926, 934]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 2063 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 936/1016 places, 1514/1538 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 924 transition count 1502
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 924 transition count 1502
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 915 transition count 1493
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 915 transition count 1493
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 910 transition count 1488
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 910 transition count 1488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 908 transition count 1486
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 908 transition count 1486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 906 transition count 1484
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 906 transition count 1484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 905 transition count 1483
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 905 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 904 transition count 1482
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 904 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 903 transition count 1481
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 903 transition count 1481
Applied a total of 66 rules in 507 ms. Remains 903 /936 variables (removed 33) and now considering 1481/1514 (removed 33) transitions.
// Phase 1: matrix 1481 rows 903 cols
[2024-05-31 21:51:13] [INFO ] Computed 121 invariants in 66 ms
[2024-05-31 21:51:13] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-31 21:51:13] [INFO ] Invariant cache hit.
[2024-05-31 21:51:16] [INFO ] Implicit Places using invariants and state equation in 2700 ms returned []
Implicit Place search using SMT with State Equation took 3598 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 903/1016 places, 1481/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6538 ms. Remains : 903/1016 places, 1481/1538 transitions.
Support contains 42 out of 903 places after structural reductions.
[2024-05-31 21:51:17] [INFO ] Flatten gal took : 230 ms
[2024-05-31 21:51:17] [INFO ] Flatten gal took : 125 ms
[2024-05-31 21:51:17] [INFO ] Input system was already deterministic with 1481 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (281 resets) in 2907 ms. (13 steps per ms) remains 15/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
[2024-05-31 21:51:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 263/291 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 139/430 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 465/895 variables, 93/120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 21:51:20] [INFO ] Deduced a trap composed of 67 places in 573 ms of which 55 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/895 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 8/903 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/903 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 1481/2384 variables, 903/1025 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2384 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2384/2384 variables, and 1025 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 903/903 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 263/291 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 139/430 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 21:51:24] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 465/895 variables, 93/121 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 21:51:25] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 3 ms to minimize.
Problem AtomicPropp11 is UNSAT
[2024-05-31 21:51:25] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 2/124 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 8/903 variables, 1/125 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/903 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 13 (OVERLAPS) 1481/2384 variables, 903/1028 constraints. Problems are: Problem set: 9 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2384/2384 variables, and 1034 constraints, problems are : Problem set: 9 solved, 6 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 903/903 constraints, PredecessorRefiner: 6/15 constraints, Known Traps: 4/4 constraints]
After SMT, in 10135ms problems are : Problem set: 9 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 903/903 places, 1481/1481 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 903 transition count 1332
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 754 transition count 1332
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 298 place count 754 transition count 1217
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 37 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 565 place count 602 transition count 1217
Discarding 3 places :
Implicit places reduction removed 3 places
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 2 with 4 rules applied. Total rules applied 569 place count 599 transition count 1216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 570 place count 598 transition count 1216
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 570 place count 598 transition count 1200
Deduced a syphon composed of 16 places in 11 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 602 place count 582 transition count 1200
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 606 place count 578 transition count 1183
Iterating global reduction 4 with 4 rules applied. Total rules applied 610 place count 578 transition count 1183
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 19 rules applied. Total rules applied 629 place count 573 transition count 1169
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 643 place count 559 transition count 1169
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 647 place count 555 transition count 1158
Iterating global reduction 6 with 4 rules applied. Total rules applied 651 place count 555 transition count 1158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 654 place count 555 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 655 place count 554 transition count 1147
Iterating global reduction 7 with 1 rules applied. Total rules applied 656 place count 554 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 657 place count 553 transition count 1139
Iterating global reduction 7 with 1 rules applied. Total rules applied 658 place count 553 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 659 place count 552 transition count 1131
Iterating global reduction 7 with 1 rules applied. Total rules applied 660 place count 552 transition count 1131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 758 place count 503 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 759 place count 502 transition count 1081
Iterating global reduction 7 with 1 rules applied. Total rules applied 760 place count 502 transition count 1081
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 763 place count 502 transition count 1078
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 766 place count 499 transition count 1078
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 8 with 15 rules applied. Total rules applied 781 place count 499 transition count 1063
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 797 place count 483 transition count 1063
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 798 place count 483 transition count 1062
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 812 place count 483 transition count 1062
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 814 place count 483 transition count 1062
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 815 place count 483 transition count 1061
Applied a total of 815 rules in 769 ms. Remains 483 /903 variables (removed 420) and now considering 1061/1481 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 483/903 places, 1061/1481 transitions.
RANDOM walk for 40000 steps (574 resets) in 1275 ms. (31 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (142 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (144 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (154 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (144 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
// Phase 1: matrix 1061 rows 483 cols
[2024-05-31 21:51:30] [INFO ] Computed 75 invariants in 13 ms
[2024-05-31 21:51:30] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 84/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 51/144 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 302/446 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 37/483 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1061/1544 variables, 483/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1544 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1544 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1544/1544 variables, and 578 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 483/483 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 84/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 51/144 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 21:51:31] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 302/446 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 37/483 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 11 (OVERLAPS) 1061/1544 variables, 483/559 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1544 variables, 20/579 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1544 variables, 2/581 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1544 variables, 0/581 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1544 variables, 0/581 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1544/1544 variables, and 581 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1635 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 483/483 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 3173ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 927 ms.
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1061/1061 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 482 transition count 1053
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 482 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 481 transition count 1045
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 481 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 480 transition count 1037
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 480 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 479 transition count 1029
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 479 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 478 transition count 1021
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 478 transition count 1021
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 477 transition count 1013
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 477 transition count 1013
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 476 transition count 1005
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 476 transition count 1005
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 475 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 475 transition count 997
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 474 transition count 989
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 474 transition count 989
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 473 transition count 981
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 473 transition count 981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 472 transition count 973
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 472 transition count 973
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 471 transition count 965
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 471 transition count 965
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 467 transition count 961
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 467 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 466 transition count 960
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 466 transition count 959
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 465 transition count 959
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 465 transition count 958
Applied a total of 37 rules in 368 ms. Remains 465 /483 variables (removed 18) and now considering 958/1061 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 465/483 places, 958/1061 transitions.
RANDOM walk for 40000 steps (627 resets) in 220 ms. (180 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
// Phase 1: matrix 958 rows 465 cols
[2024-05-31 21:51:34] [INFO ] Computed 75 invariants in 11 ms
[2024-05-31 21:51:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 126/139 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:51:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:51:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 301/440 variables, 49/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/465 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 958/1423 variables, 465/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1423 variables, 20/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1423 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1423 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1423/1423 variables, and 562 constraints, problems are : Problem set: 0 solved, 1 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 465/465 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 126/139 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 301/440 variables, 49/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/465 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 958/1423 variables, 465/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1423 variables, 20/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1423 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1423 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1423 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1423/1423 variables, and 563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 465/465 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1565ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 958/958 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 957
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 460 transition count 957
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 5 place count 460 transition count 949
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 25 place count 448 transition count 949
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 444 transition count 945
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 444 transition count 945
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 444 transition count 941
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 443 transition count 940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 443 transition count 939
Applied a total of 40 rules in 88 ms. Remains 443 /465 variables (removed 22) and now considering 939/958 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 443/465 places, 939/958 transitions.
RANDOM walk for 40000 steps (719 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (196 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5448 steps, run visited all 1 properties in 69 ms. (steps per millisecond=78 )
Probabilistic random walk after 5448 steps, saw 4981 distinct states, run finished after 82 ms. (steps per millisecond=66 ) properties seen :1
FORMULA ASLink-PT-04a-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 13 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-04a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-04a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1481/1481 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 902 transition count 1331
Reduce places removed 153 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 156 rules applied. Total rules applied 305 place count 749 transition count 1328
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 746 transition count 1328
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 308 place count 746 transition count 1204
Deduced a syphon composed of 124 places in 2 ms
Ensure Unique test removed 37 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 593 place count 585 transition count 1204
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 610 place count 577 transition count 1195
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 619 place count 568 transition count 1195
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 619 place count 568 transition count 1178
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 653 place count 551 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 661 place count 543 transition count 1157
Iterating global reduction 5 with 8 rules applied. Total rules applied 669 place count 543 transition count 1157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 5 with 23 rules applied. Total rules applied 692 place count 538 transition count 1139
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 706 place count 524 transition count 1139
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 710 place count 520 transition count 1128
Iterating global reduction 7 with 4 rules applied. Total rules applied 714 place count 520 transition count 1128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 717 place count 520 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 718 place count 519 transition count 1117
Iterating global reduction 8 with 1 rules applied. Total rules applied 719 place count 519 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 720 place count 518 transition count 1109
Iterating global reduction 8 with 1 rules applied. Total rules applied 721 place count 518 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 722 place count 517 transition count 1101
Iterating global reduction 8 with 1 rules applied. Total rules applied 723 place count 517 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 724 place count 516 transition count 1093
Iterating global reduction 8 with 1 rules applied. Total rules applied 725 place count 516 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 726 place count 515 transition count 1085
Iterating global reduction 8 with 1 rules applied. Total rules applied 727 place count 515 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 728 place count 514 transition count 1077
Iterating global reduction 8 with 1 rules applied. Total rules applied 729 place count 514 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 730 place count 513 transition count 1069
Iterating global reduction 8 with 1 rules applied. Total rules applied 731 place count 513 transition count 1069
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 732 place count 512 transition count 1061
Iterating global reduction 8 with 1 rules applied. Total rules applied 733 place count 512 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 734 place count 511 transition count 1053
Iterating global reduction 8 with 1 rules applied. Total rules applied 735 place count 511 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 736 place count 510 transition count 1045
Iterating global reduction 8 with 1 rules applied. Total rules applied 737 place count 510 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 738 place count 509 transition count 1037
Iterating global reduction 8 with 1 rules applied. Total rules applied 739 place count 509 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 740 place count 508 transition count 1029
Iterating global reduction 8 with 1 rules applied. Total rules applied 741 place count 508 transition count 1029
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 839 place count 459 transition count 980
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 840 place count 458 transition count 979
Iterating global reduction 8 with 1 rules applied. Total rules applied 841 place count 458 transition count 979
Applied a total of 841 rules in 439 ms. Remains 458 /903 variables (removed 445) and now considering 979/1481 (removed 502) transitions.
// Phase 1: matrix 979 rows 458 cols
[2024-05-31 21:51:37] [INFO ] Computed 67 invariants in 10 ms
[2024-05-31 21:51:38] [INFO ] Implicit Places using invariants in 1194 ms returned [72, 89, 95, 100, 110, 128, 164, 189, 197, 203, 205, 265, 282, 288, 293, 295, 355, 372, 378, 383, 385, 449, 455]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1198 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 435/903 places, 979/1481 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 435 transition count 970
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 426 transition count 970
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 27 place count 417 transition count 961
Iterating global reduction 2 with 9 rules applied. Total rules applied 36 place count 417 transition count 961
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 417 transition count 960
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 416 transition count 960
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 46 place count 408 transition count 952
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 408 transition count 952
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 404 transition count 948
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 404 transition count 948
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 88 place count 391 transition count 935
Applied a total of 88 rules in 86 ms. Remains 391 /435 variables (removed 44) and now considering 935/979 (removed 44) transitions.
// Phase 1: matrix 935 rows 391 cols
[2024-05-31 21:51:38] [INFO ] Computed 44 invariants in 9 ms
[2024-05-31 21:51:39] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-31 21:51:39] [INFO ] Invariant cache hit.
[2024-05-31 21:51:40] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 391/903 places, 935/1481 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3726 ms. Remains : 391/903 places, 935/1481 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-00
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-00 finished in 4117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1))))'
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1481/1481 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 902 transition count 1481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 900 transition count 1466
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 900 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 899 transition count 1458
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 899 transition count 1458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 898 transition count 1450
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 898 transition count 1450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 897 transition count 1442
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 897 transition count 1442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 896 transition count 1434
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 896 transition count 1434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 895 transition count 1426
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 895 transition count 1426
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 894 transition count 1418
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 894 transition count 1418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 893 transition count 1410
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 893 transition count 1410
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 892 transition count 1402
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 892 transition count 1402
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 891 transition count 1394
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 891 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 890 transition count 1386
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 890 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 889 transition count 1378
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 889 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 888 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 888 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 887 transition count 1362
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 887 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 886 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 886 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 885 transition count 1346
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 885 transition count 1346
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 884 transition count 1338
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 884 transition count 1338
Applied a total of 37 rules in 432 ms. Remains 884 /903 variables (removed 19) and now considering 1338/1481 (removed 143) transitions.
// Phase 1: matrix 1338 rows 884 cols
[2024-05-31 21:51:41] [INFO ] Computed 120 invariants in 16 ms
[2024-05-31 21:51:42] [INFO ] Implicit Places using invariants in 1222 ms returned [210, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1226 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 882/903 places, 1338/1481 transitions.
Applied a total of 0 rules in 22 ms. Remains 882 /882 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1681 ms. Remains : 882/903 places, 1338/1481 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-01 finished in 1899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1481/1481 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 901 transition count 1329
Reduce places removed 155 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 158 rules applied. Total rules applied 310 place count 746 transition count 1326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 313 place count 743 transition count 1326
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 313 place count 743 transition count 1202
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 598 place count 582 transition count 1202
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 615 place count 574 transition count 1193
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 624 place count 565 transition count 1193
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 624 place count 565 transition count 1176
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 658 place count 548 transition count 1176
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 666 place count 540 transition count 1155
Iterating global reduction 5 with 8 rules applied. Total rules applied 674 place count 540 transition count 1155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 5 with 23 rules applied. Total rules applied 697 place count 535 transition count 1137
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 711 place count 521 transition count 1137
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 714 place count 518 transition count 1134
Iterating global reduction 7 with 3 rules applied. Total rules applied 717 place count 518 transition count 1134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 720 place count 518 transition count 1131
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 816 place count 470 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 817 place count 469 transition count 1082
Iterating global reduction 8 with 1 rules applied. Total rules applied 818 place count 469 transition count 1082
Applied a total of 818 rules in 153 ms. Remains 469 /903 variables (removed 434) and now considering 1082/1481 (removed 399) transitions.
// Phase 1: matrix 1082 rows 469 cols
[2024-05-31 21:51:43] [INFO ] Computed 66 invariants in 12 ms
[2024-05-31 21:51:43] [INFO ] Implicit Places using invariants in 653 ms returned [72, 89, 95, 100, 108, 126, 162, 187, 195, 201, 203, 263, 280, 286, 291, 293, 353, 370, 376, 381, 383, 460, 466]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 655 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/903 places, 1082/1481 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 446 transition count 1073
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 437 transition count 1073
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 27 place count 428 transition count 1064
Iterating global reduction 2 with 9 rules applied. Total rules applied 36 place count 428 transition count 1064
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 428 transition count 1063
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 427 transition count 1063
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 46 place count 419 transition count 1055
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 419 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 415 transition count 1051
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 415 transition count 1051
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 88 place count 402 transition count 1038
Applied a total of 88 rules in 72 ms. Remains 402 /446 variables (removed 44) and now considering 1038/1082 (removed 44) transitions.
// Phase 1: matrix 1038 rows 402 cols
[2024-05-31 21:51:43] [INFO ] Computed 43 invariants in 11 ms
[2024-05-31 21:51:44] [INFO ] Implicit Places using invariants in 737 ms returned []
[2024-05-31 21:51:44] [INFO ] Invariant cache hit.
[2024-05-31 21:51:45] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/903 places, 1038/1481 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2810 ms. Remains : 402/903 places, 1038/1481 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-11
Product exploration explored 100000 steps with 1603 reset in 447 ms.
Stack based approach found an accepted trace after 13374 steps with 221 reset with depth 30 and stack size 30 in 54 ms.
FORMULA ASLink-PT-04a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-04a-LTLFireability-11 finished in 3377 ms.
All properties solved by simple procedures.
Total runtime 37317 ms.
ITS solved all properties within timeout
BK_STOP 1717192306492
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04a"
export BK_EXAMINATION="LTLFireability"
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-04a, examination is LTLFireability"
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-171620117700060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;