About the Execution of ITS-Tools for AutoFlight-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 278.544 | 44381.00 | 56816.00 | 824.70 | TTTTFFTTTTTTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990000463.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000463
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 10:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 10:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 134K May 5 16:51 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 AutoFlight-PT-06b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620470903090
Running Version 0
[2021-05-08 10:48:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 10:48:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:48:24] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-08 10:48:24] [INFO ] Transformed 574 places.
[2021-05-08 10:48:24] [INFO ] Transformed 572 transitions.
[2021-05-08 10:48:24] [INFO ] Found NUPN structural information;
[2021-05-08 10:48:24] [INFO ] Parsed PT model containing 574 places and 572 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 34 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 572 rows 574 cols
[2021-05-08 10:48:25] [INFO ] Computed 40 place invariants in 29 ms
[2021-05-08 10:48:25] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2021-05-08 10:48:25] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:25] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-08 10:48:25] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 6 ms to minimize.
[2021-05-08 10:48:25] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2021-05-08 10:48:26] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2021-05-08 10:48:26] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2021-05-08 10:48:26] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2021-05-08 10:48:26] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2021-05-08 10:48:26] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 7 ms to minimize.
[2021-05-08 10:48:26] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2021-05-08 10:48:26] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 0 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 0 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 0 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:48:27] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2450 ms
[2021-05-08 10:48:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:48:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2021-05-08 10:48:28] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:28] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-08 10:48:28] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2021-05-08 10:48:28] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2021-05-08 10:48:28] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2021-05-08 10:48:28] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 1 ms to minimize.
[2021-05-08 10:48:28] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 1 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 0 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 0 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2021-05-08 10:48:29] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2021-05-08 10:48:30] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 0 ms to minimize.
[2021-05-08 10:48:30] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2021-05-08 10:48:30] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2021-05-08 10:48:30] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2021-05-08 10:48:30] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:48:30] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2096 ms
[2021-05-08 10:48:30] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-08 10:48:33] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2021-05-08 10:48:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-08 10:48:33] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:48:33] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:33] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2021-05-08 10:48:33] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2021-05-08 10:48:33] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2021-05-08 10:48:33] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2021-05-08 10:48:33] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2021-05-08 10:48:33] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2021-05-08 10:48:34] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2021-05-08 10:48:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 652 ms
[2021-05-08 10:48:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:48:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:48:34] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:34] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-08 10:48:34] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2021-05-08 10:48:34] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2021-05-08 10:48:34] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2021-05-08 10:48:34] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2021-05-08 10:48:34] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 0 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 1 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2021-05-08 10:48:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1390 ms
[2021-05-08 10:48:35] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-08 10:48:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-08 10:48:39] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 10:48:39] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:39] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-08 10:48:39] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2021-05-08 10:48:39] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 7 ms to minimize.
[2021-05-08 10:48:39] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 0 ms to minimize.
[2021-05-08 10:48:39] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2021-05-08 10:48:39] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 1 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 1 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2021-05-08 10:48:40] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 0 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 1 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 1 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 0 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2021-05-08 10:48:41] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 0 ms to minimize.
[2021-05-08 10:48:42] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 0 ms to minimize.
[2021-05-08 10:48:42] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2021-05-08 10:48:42] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2021-05-08 10:48:42] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 0 ms to minimize.
[2021-05-08 10:48:42] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2021-05-08 10:48:42] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3047 ms
[2021-05-08 10:48:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:48:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:48:42] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:42] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-08 10:48:42] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2021-05-08 10:48:42] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2021-05-08 10:48:43] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2021-05-08 10:48:43] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 0 ms to minimize.
[2021-05-08 10:48:43] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 1 ms to minimize.
[2021-05-08 10:48:43] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 0 ms to minimize.
[2021-05-08 10:48:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 709 ms
[2021-05-08 10:48:43] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-08 10:48:46] [INFO ] Added : 514 causal constraints over 103 iterations in 3094 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 10:48:46] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 10:48:46] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:46] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-08 10:48:46] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2021-05-08 10:48:47] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2021-05-08 10:48:47] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2021-05-08 10:48:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 353 ms
[2021-05-08 10:48:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:48:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:48:47] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 10:48:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:47] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-08 10:48:47] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2021-05-08 10:48:47] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2021-05-08 10:48:47] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2021-05-08 10:48:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
[2021-05-08 10:48:47] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-08 10:48:51] [INFO ] Added : 548 causal constraints over 111 iterations in 3497 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 10:48:51] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 10:48:51] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:51] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-08 10:48:51] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2021-05-08 10:48:51] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 0 ms to minimize.
[2021-05-08 10:48:51] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 0 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 0 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 0 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 0 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 0 ms to minimize.
[2021-05-08 10:48:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1285 ms
[2021-05-08 10:48:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:48:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:48:52] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:53] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-08 10:48:53] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2021-05-08 10:48:53] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 1 ms to minimize.
[2021-05-08 10:48:53] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 0 ms to minimize.
[2021-05-08 10:48:53] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 0 ms to minimize.
[2021-05-08 10:48:53] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2021-05-08 10:48:53] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2021-05-08 10:48:53] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 1 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 0 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 0 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 0 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 1 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2021-05-08 10:48:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1565 ms
[2021-05-08 10:48:54] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-08 10:48:58] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2021-05-08 10:48:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-08 10:48:58] [INFO ] [Real]Absence check using 39 positive place invariants in 18 ms returned sat
[2021-05-08 10:48:58] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:58] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-08 10:48:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:48:58] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:48:58] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:48:58] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2021-05-08 10:48:58] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2021-05-08 10:48:58] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2021-05-08 10:48:59] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 0 ms to minimize.
[2021-05-08 10:49:00] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 0 ms to minimize.
[2021-05-08 10:49:00] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2021-05-08 10:49:00] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2021-05-08 10:49:00] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 0 ms to minimize.
[2021-05-08 10:49:00] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2021-05-08 10:49:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1776 ms
[2021-05-08 10:49:00] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-08 10:49:03] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2021-05-08 10:49:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-08 10:49:03] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 10:49:03] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:49:03] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-08 10:49:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:49:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:49:03] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned unsat
FORMULA AutoFlight-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 42400 steps, including 157 resets, run finished after 162 ms. (steps per millisecond=261 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 50100 steps, including 179 resets, run finished after 163 ms. (steps per millisecond=307 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 18 out of 574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 574 transition count 365
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 243 rules applied. Total rules applied 450 place count 367 transition count 329
Reduce places removed 10 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 17 rules applied. Total rules applied 467 place count 357 transition count 322
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 477 place count 350 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 478 place count 349 transition count 319
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 70 Pre rules applied. Total rules applied 478 place count 349 transition count 249
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 618 place count 279 transition count 249
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 668 place count 229 transition count 199
Iterating global reduction 5 with 50 rules applied. Total rules applied 718 place count 229 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 719 place count 229 transition count 198
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 719 place count 229 transition count 182
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 751 place count 213 transition count 182
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 859 place count 159 transition count 128
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 860 place count 159 transition count 127
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 881 place count 159 transition count 106
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 902 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 903 place count 137 transition count 105
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 21 rules applied. Total rules applied 924 place count 122 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 930 place count 116 transition count 99
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 19 Pre rules applied. Total rules applied 930 place count 116 transition count 80
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 968 place count 97 transition count 80
Applied a total of 968 rules in 139 ms. Remains 97 /574 variables (removed 477) and now considering 80/572 (removed 492) transitions.
Finished structural reductions, in 1 iterations. Remains : 97/574 places, 80/572 transitions.
[2021-05-08 10:49:04] [INFO ] Flatten gal took : 32 ms
[2021-05-08 10:49:04] [INFO ] Flatten gal took : 10 ms
[2021-05-08 10:49:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7951873824576963742.gal : 6 ms
[2021-05-08 10:49:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality216779034759857850.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7951873824576963742.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality216779034759857850.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7951873824576963742.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality216779034759857850.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality216779034759857850.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :20 after 108
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :108 after 1980
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1980 after 3564
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3564 after 4684
Reachability property AutoFlight-PT-06b-ReachabilityFireability-13 is true.
FORMULA AutoFlight-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property AutoFlight-PT-06b-ReachabilityFireability-03 is true.
FORMULA AutoFlight-PT-06b-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property AutoFlight-PT-06b-ReachabilityFireability-00 is true.
FORMULA AutoFlight-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4684 after 10833
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :10833 after 37368
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :37368 after 62396
Reachability property AutoFlight-PT-06b-ReachabilityFireability-01 is true.
FORMULA AutoFlight-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :62396 after 323676
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.38335e+07,0.060301,5720,2,940,19,8716,7,0,471,6657,0
Total reachable state count : 13833504
Verifying 5 reachability properties.
Reachability property AutoFlight-PT-06b-ReachabilityFireability-00 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-06b-ReachabilityFireability-00,2,0.061132,5984,2,99,19,8716,8,0,479,6657,0
Reachability property AutoFlight-PT-06b-ReachabilityFireability-01 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-06b-ReachabilityFireability-01,6,0.06169,5984,2,103,19,8716,9,0,487,6657,0
Reachability property AutoFlight-PT-06b-ReachabilityFireability-03 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-06b-ReachabilityFireability-03,22,0.062071,5984,2,130,19,8716,10,0,492,6657,0
Reachability property AutoFlight-PT-06b-ReachabilityFireability-13 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-06b-ReachabilityFireability-13,1,0.062306,5984,2,98,19,8716,11,0,494,6657,0
Invariant property AutoFlight-PT-06b-ReachabilityFireability-14 does not hold.
FORMULA AutoFlight-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-06b-ReachabilityFireability-14,524232,0.064453,5984,2,1198,19,8716,11,0,499,6657,0
All properties solved without resorting to model-checking.
BK_STOP 1620470947471
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="AutoFlight-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037990000463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;