About the Execution of LTSMin+red for CANConstruction-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7708.676 | 402447.00 | 480048.00 | 952.70 | TTFFT?TFF?FTF?FF | 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.r476-tall-171620505100070.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 CANConstruction-PT-080, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 20:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 12 20:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 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 9.5M 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 CANConstruction-PT-080-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717183151235
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:19:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:19:12] [INFO ] Load time of PNML (sax parser for PT used): 539 ms
[2024-05-31 19:19:13] [INFO ] Transformed 13762 places.
[2024-05-31 19:19:13] [INFO ] Transformed 26240 transitions.
[2024-05-31 19:19:13] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 726 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 3247 ms. (12 steps per ms) remains 7/16 properties
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
// Phase 1: matrix 26240 rows 13762 cols
[2024-05-31 19:19:15] [INFO ] Computed 161 invariants in 347 ms
[2024-05-31 19:19:15] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CANConstruction-PT-080-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-080-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 13499/13671 variables, 70/70 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13671 variables, 1/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13671 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/13682 variables, 11/82 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13682 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 79/13761 variables, 79/161 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13761 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 5 unsolved
SMT process timed out in 5771ms, After SMT, problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 13762 transition count 25696
Reduce places removed 544 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 549 rules applied. Total rules applied 1093 place count 13218 transition count 25691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1098 place count 13213 transition count 25691
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1098 place count 13213 transition count 25690
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1100 place count 13212 transition count 25690
Discarding 6197 places :
Symmetric choice reduction at 3 with 6197 rule applications. Total rules 7297 place count 7015 transition count 13296
Iterating global reduction 3 with 6197 rules applied. Total rules applied 13494 place count 7015 transition count 13296
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 6 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 13650 place count 6937 transition count 13218
Free-agglomeration rule applied 99 times.
Iterating global reduction 3 with 99 rules applied. Total rules applied 13749 place count 6937 transition count 13119
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 3 with 99 rules applied. Total rules applied 13848 place count 6838 transition count 13119
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 13851 place count 6838 transition count 13116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 13854 place count 6835 transition count 13116
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 13915 place count 6835 transition count 13116
Applied a total of 13915 rules in 11296 ms. Remains 6835 /13762 variables (removed 6927) and now considering 13116/26240 (removed 13124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11309 ms. Remains : 6835/13762 places, 13116/26240 transitions.
RANDOM walk for 40000 steps (68 resets) in 1466 ms. (27 steps per ms) remains 3/5 properties
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
// Phase 1: matrix 13116 rows 6835 cols
[2024-05-31 19:19:32] [INFO ] Computed 161 invariants in 92 ms
[2024-05-31 19:19:32] [INFO ] State equation strengthened by 12827 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6642/6723 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6723 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6754 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6754 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/6834 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6834 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13116/19950 variables, 6834/6995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19950 variables, 12827/19822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19950 variables, 0/19822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/19951 variables, 1/19823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19951 variables, 0/19823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/19951 variables, 0/19823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19951/19951 variables, and 19823 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12063 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 6835/6835 constraints, ReadFeed: 12827/12827 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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6642/6723 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:19:56] [INFO ] Deduced a trap composed of 2 places in 11025 ms of which 276 ms to minimize.
[2024-05-31 19:19:59] [INFO ] Deduced a trap composed of 94 places in 2798 ms of which 22 ms to minimize.
[2024-05-31 19:20:02] [INFO ] Deduced a trap composed of 83 places in 2606 ms of which 26 ms to minimize.
[2024-05-31 19:20:05] [INFO ] Deduced a trap composed of 83 places in 2527 ms of which 21 ms to minimize.
[2024-05-31 19:20:07] [INFO ] Deduced a trap composed of 83 places in 2803 ms of which 23 ms to minimize.
[2024-05-31 19:20:10] [INFO ] Deduced a trap composed of 83 places in 2618 ms of which 22 ms to minimize.
[2024-05-31 19:20:13] [INFO ] Deduced a trap composed of 83 places in 2637 ms of which 22 ms to minimize.
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 83 places in 2794 ms of which 23 ms to minimize.
[2024-05-31 19:20:18] [INFO ] Deduced a trap composed of 83 places in 2422 ms of which 21 ms to minimize.
[2024-05-31 19:20:21] [INFO ] Deduced a trap composed of 83 places in 2306 ms of which 20 ms to minimize.
[2024-05-31 19:20:23] [INFO ] Deduced a trap composed of 86 places in 2362 ms of which 21 ms to minimize.
[2024-05-31 19:20:25] [INFO ] Deduced a trap composed of 83 places in 2108 ms of which 19 ms to minimize.
[2024-05-31 19:20:27] [INFO ] Deduced a trap composed of 83 places in 2120 ms of which 19 ms to minimize.
[2024-05-31 19:20:30] [INFO ] Deduced a trap composed of 83 places in 2545 ms of which 21 ms to minimize.
SMT process timed out in 58028ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6835/6835 places, 13116/13116 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 0 with 2 rules applied. Total rules applied 2 place count 6835 transition count 13114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6833 transition count 13114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 6832 transition count 13112
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 6832 transition count 13112
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 6822 transition count 13102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 6821 transition count 13102
Applied a total of 28 rules in 6208 ms. Remains 6821 /6835 variables (removed 14) and now considering 13102/13116 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6208 ms. Remains : 6821/6835 places, 13102/13116 transitions.
RANDOM walk for 40000 steps (71 resets) in 1310 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 85101 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 3
Probabilistic random walk after 85101 steps, saw 74045 distinct states, run finished after 3005 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 13102 rows 6821 cols
[2024-05-31 19:20:40] [INFO ] Computed 161 invariants in 97 ms
[2024-05-31 19:20:40] [INFO ] State equation strengthened by 12839 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6628/6709 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6709 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6740 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6740 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/6820 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6820 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13102/19922 variables, 6820/6981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19922 variables, 12839/19820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19922 variables, 0/19820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/19923 variables, 1/19821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19923 variables, 0/19821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/19923 variables, 0/19821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19923/19923 variables, and 19821 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12194 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 6821/6821 constraints, ReadFeed: 12839/12839 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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6628/6709 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:21:04] [INFO ] Deduced a trap composed of 3 places in 10690 ms of which 38 ms to minimize.
[2024-05-31 19:21:07] [INFO ] Deduced a trap composed of 85 places in 2937 ms of which 43 ms to minimize.
[2024-05-31 19:21:09] [INFO ] Deduced a trap composed of 85 places in 2522 ms of which 20 ms to minimize.
[2024-05-31 19:21:12] [INFO ] Deduced a trap composed of 86 places in 2424 ms of which 20 ms to minimize.
[2024-05-31 19:21:14] [INFO ] Deduced a trap composed of 83 places in 2187 ms of which 19 ms to minimize.
[2024-05-31 19:21:17] [INFO ] Deduced a trap composed of 83 places in 2267 ms of which 19 ms to minimize.
[2024-05-31 19:21:19] [INFO ] Deduced a trap composed of 83 places in 2495 ms of which 22 ms to minimize.
[2024-05-31 19:21:21] [INFO ] Deduced a trap composed of 83 places in 1848 ms of which 17 ms to minimize.
[2024-05-31 19:21:24] [INFO ] Deduced a trap composed of 87 places in 2326 ms of which 19 ms to minimize.
[2024-05-31 19:21:26] [INFO ] Deduced a trap composed of 86 places in 2121 ms of which 17 ms to minimize.
[2024-05-31 19:21:28] [INFO ] Deduced a trap composed of 83 places in 2153 ms of which 20 ms to minimize.
[2024-05-31 19:21:30] [INFO ] Deduced a trap composed of 83 places in 2001 ms of which 19 ms to minimize.
[2024-05-31 19:21:32] [INFO ] Deduced a trap composed of 85 places in 2083 ms of which 18 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 87 places in 2127 ms of which 19 ms to minimize.
[2024-05-31 19:21:37] [INFO ] Deduced a trap composed of 85 places in 1969 ms of which 18 ms to minimize.
[2024-05-31 19:21:38] [INFO ] Deduced a trap composed of 83 places in 1869 ms of which 17 ms to minimize.
[2024-05-31 19:21:40] [INFO ] Deduced a trap composed of 86 places in 1751 ms of which 17 ms to minimize.
[2024-05-31 19:21:42] [INFO ] Deduced a trap composed of 86 places in 1855 ms of which 17 ms to minimize.
[2024-05-31 19:21:44] [INFO ] Deduced a trap composed of 86 places in 1641 ms of which 16 ms to minimize.
[2024-05-31 19:21:46] [INFO ] Deduced a trap composed of 83 places in 1719 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6709 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:21:48] [INFO ] Deduced a trap composed of 83 places in 2227 ms of which 21 ms to minimize.
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 83 places in 1874 ms of which 18 ms to minimize.
[2024-05-31 19:21:52] [INFO ] Deduced a trap composed of 85 places in 1886 ms of which 17 ms to minimize.
[2024-05-31 19:21:54] [INFO ] Deduced a trap composed of 85 places in 1882 ms of which 17 ms to minimize.
[2024-05-31 19:21:56] [INFO ] Deduced a trap composed of 85 places in 1867 ms of which 17 ms to minimize.
[2024-05-31 19:21:58] [INFO ] Deduced a trap composed of 85 places in 1872 ms of which 18 ms to minimize.
[2024-05-31 19:22:00] [INFO ] Deduced a trap composed of 85 places in 1921 ms of which 18 ms to minimize.
[2024-05-31 19:22:02] [INFO ] Deduced a trap composed of 83 places in 2168 ms of which 19 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 83 places in 1928 ms of which 17 ms to minimize.
[2024-05-31 19:22:06] [INFO ] Deduced a trap composed of 86 places in 1674 ms of which 16 ms to minimize.
[2024-05-31 19:22:08] [INFO ] Deduced a trap composed of 86 places in 1611 ms of which 17 ms to minimize.
SMT process timed out in 87822ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6821/6821 places, 13102/13102 transitions.
Applied a total of 0 rules in 1672 ms. Remains 6821 /6821 variables (removed 0) and now considering 13102/13102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1672 ms. Remains : 6821/6821 places, 13102/13102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6821/6821 places, 13102/13102 transitions.
Applied a total of 0 rules in 1657 ms. Remains 6821 /6821 variables (removed 0) and now considering 13102/13102 (removed 0) transitions.
[2024-05-31 19:22:11] [INFO ] Invariant cache hit.
[2024-05-31 19:22:17] [INFO ] Implicit Places using invariants in 6271 ms returned [5, 10, 14, 18, 22, 28, 32, 38, 44, 50, 54, 60, 66, 71, 75, 81, 87, 93, 99, 103, 107, 111, 115, 121, 126, 130, 134, 138, 142, 148, 154, 160, 166, 170, 174, 178, 182, 186, 190, 196, 200, 204, 208, 212, 216, 222, 226, 232, 238, 242, 248, 252, 256, 260, 264, 268, 272, 276, 282, 288, 292, 298, 304, 310, 314, 322, 328, 332, 336, 340, 344, 348, 354, 358, 362, 368, 372, 378, 384, 388]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 6288 ms to find 80 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6741/6821 places, 13102/13102 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 6741 transition count 13074
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 6713 transition count 13074
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 120 place count 6681 transition count 13042
Applied a total of 120 rules in 2965 ms. Remains 6681 /6741 variables (removed 60) and now considering 13042/13102 (removed 60) transitions.
// Phase 1: matrix 13042 rows 6681 cols
[2024-05-31 19:22:21] [INFO ] Computed 81 invariants in 316 ms
[2024-05-31 19:22:26] [INFO ] Implicit Places using invariants in 5443 ms returned []
Implicit Place search using SMT only with invariants took 5445 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 6681/6821 places, 13042/13102 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16358 ms. Remains : 6681/6821 places, 13042/13102 transitions.
RANDOM walk for 40000 steps (68 resets) in 970 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 85209 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 3
Probabilistic random walk after 85209 steps, saw 74345 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-31 19:22:29] [INFO ] Invariant cache hit.
[2024-05-31 19:22:29] [INFO ] State equation strengthened by 12731 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6568/6649 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6649 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6680 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6680 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13042/19722 variables, 6680/6761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19722 variables, 12731/19492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19722 variables, 0/19492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/19723 variables, 1/19493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19723 variables, 0/19493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/19723 variables, 0/19493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19723/19723 variables, and 19493 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11798 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 6681/6681 constraints, ReadFeed: 12731/12731 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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6568/6649 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:22:52] [INFO ] Deduced a trap composed of 2 places in 10341 ms of which 37 ms to minimize.
[2024-05-31 19:23:04] [INFO ] Deduced a trap composed of 2 places in 11652 ms of which 41 ms to minimize.
[2024-05-31 19:23:15] [INFO ] Deduced a trap composed of 2 places in 10597 ms of which 34 ms to minimize.
[2024-05-31 19:23:17] [INFO ] Deduced a trap composed of 83 places in 2548 ms of which 20 ms to minimize.
[2024-05-31 19:23:20] [INFO ] Deduced a trap composed of 84 places in 2594 ms of which 22 ms to minimize.
[2024-05-31 19:23:22] [INFO ] Deduced a trap composed of 83 places in 2382 ms of which 19 ms to minimize.
[2024-05-31 19:23:32] [INFO ] Deduced a trap composed of 2 places in 9815 ms of which 37 ms to minimize.
[2024-05-31 19:23:35] [INFO ] Deduced a trap composed of 85 places in 2260 ms of which 19 ms to minimize.
[2024-05-31 19:23:37] [INFO ] Deduced a trap composed of 84 places in 2128 ms of which 20 ms to minimize.
[2024-05-31 19:23:39] [INFO ] Deduced a trap composed of 83 places in 2249 ms of which 20 ms to minimize.
[2024-05-31 19:23:42] [INFO ] Deduced a trap composed of 83 places in 2178 ms of which 20 ms to minimize.
[2024-05-31 19:23:44] [INFO ] Deduced a trap composed of 85 places in 2460 ms of which 26 ms to minimize.
[2024-05-31 19:23:46] [INFO ] Deduced a trap composed of 89 places in 2237 ms of which 23 ms to minimize.
[2024-05-31 19:23:49] [INFO ] Deduced a trap composed of 85 places in 2079 ms of which 18 ms to minimize.
[2024-05-31 19:23:51] [INFO ] Deduced a trap composed of 83 places in 2013 ms of which 19 ms to minimize.
[2024-05-31 19:23:52] [INFO ] Deduced a trap composed of 83 places in 1743 ms of which 16 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 85 places in 1851 ms of which 16 ms to minimize.
[2024-05-31 19:23:56] [INFO ] Deduced a trap composed of 85 places in 1836 ms of which 17 ms to minimize.
[2024-05-31 19:23:58] [INFO ] Deduced a trap composed of 83 places in 1663 ms of which 16 ms to minimize.
[2024-05-31 19:24:00] [INFO ] Deduced a trap composed of 83 places in 1680 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6649 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:02] [INFO ] Deduced a trap composed of 90 places in 2153 ms of which 18 ms to minimize.
[2024-05-31 19:24:04] [INFO ] Deduced a trap composed of 86 places in 2037 ms of which 18 ms to minimize.
[2024-05-31 19:24:06] [INFO ] Deduced a trap composed of 83 places in 2080 ms of which 19 ms to minimize.
[2024-05-31 19:24:08] [INFO ] Deduced a trap composed of 83 places in 1835 ms of which 15 ms to minimize.
[2024-05-31 19:24:10] [INFO ] Deduced a trap composed of 87 places in 1897 ms of which 16 ms to minimize.
[2024-05-31 19:24:12] [INFO ] Deduced a trap composed of 83 places in 1881 ms of which 16 ms to minimize.
SMT process timed out in 103209ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6681/6681 places, 13042/13042 transitions.
Applied a total of 0 rules in 1700 ms. Remains 6681 /6681 variables (removed 0) and now considering 13042/13042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1700 ms. Remains : 6681/6681 places, 13042/13042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6681/6681 places, 13042/13042 transitions.
Applied a total of 0 rules in 1695 ms. Remains 6681 /6681 variables (removed 0) and now considering 13042/13042 (removed 0) transitions.
[2024-05-31 19:24:16] [INFO ] Invariant cache hit.
[2024-05-31 19:24:21] [INFO ] Implicit Places using invariants in 5644 ms returned []
Implicit Place search using SMT only with invariants took 5645 ms to find 0 implicit places.
Running 12962 sub problems to find dead transitions.
[2024-05-31 19:24:22] [INFO ] Invariant cache hit.
[2024-05-31 19:24:22] [INFO ] State equation strengthened by 12731 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6680 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 12962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6680/19723 variables, and 81 constraints, problems are : Problem set: 0 solved, 12962 unsolved in 30286 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/6681 constraints, ReadFeed: 0/12731 constraints, PredecessorRefiner: 12962/12962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6680 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 12962 unsolved
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 83 places in 7233 ms of which 41 ms to minimize.
[2024-05-31 19:25:45] [INFO ] Deduced a trap composed of 85 places in 6958 ms of which 33 ms to minimize.
[2024-05-31 19:25:52] [INFO ] Deduced a trap composed of 93 places in 6929 ms of which 42 ms to minimize.
SMT process timed out in 90331ms, After SMT, problems are : Problem set: 0 solved, 12962 unsolved
Search for dead transitions found 0 dead transitions in 90453ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97844 ms. Remains : 6681/6681 places, 13042/13042 transitions.
[2024-05-31 19:25:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-31 19:25:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6681 places, 13042 transitions and 51829 arcs took 57 ms.
[2024-05-31 19:25:53] [INFO ] Flatten gal took : 651 ms
Total runtime 401047 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : CANConstruction-PT-080-ReachabilityCardinality-2024-05
Could not compute solution for formula : CANConstruction-PT-080-ReachabilityCardinality-2024-09
Could not compute solution for formula : CANConstruction-PT-080-ReachabilityCardinality-2024-13
BK_STOP 1717183553682
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANConstruction-PT-080-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/791/inv_0_
rfs formula name CANConstruction-PT-080-ReachabilityCardinality-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/791/inv_1_
rfs formula name CANConstruction-PT-080-ReachabilityCardinality-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/791/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="CANConstruction-PT-080"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANConstruction-PT-080, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505100070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-080.tgz
mv CANConstruction-PT-080 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;