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-162037990000431.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-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K 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.0K 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 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 10:15 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 91K 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-04b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620469057033

Running Version 0
[2021-05-08 10:17:38] [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:17:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:17:38] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-08 10:17:38] [INFO ] Transformed 390 places.
[2021-05-08 10:17:38] [INFO ] Transformed 388 transitions.
[2021-05-08 10:17:38] [INFO ] Found NUPN structural information;
[2021-05-08 10:17:38] [INFO ] Parsed PT model containing 390 places and 388 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 49 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :7
FORMULA AutoFlight-PT-04b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 388 rows 390 cols
[2021-05-08 10:17:39] [INFO ] Computed 28 place invariants in 23 ms
[2021-05-08 10:17:39] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2021-05-08 10:17:39] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:39] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-08 10:17:39] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 4 ms to minimize.
[2021-05-08 10:17:39] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2021-05-08 10:17:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2021-05-08 10:17:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:39] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:39] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:39] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-08 10:17:40] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2021-05-08 10:17:40] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2021-05-08 10:17:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2021-05-08 10:17:40] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-08 10:17:41] [INFO ] Added : 369 causal constraints over 74 iterations in 1703 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 10:17:41] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:41] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:42] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-08 10:17:42] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2021-05-08 10:17:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:42] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:42] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 10:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:42] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-08 10:17:42] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2021-05-08 10:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2021-05-08 10:17:42] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 33 ms.
[2021-05-08 10:17:43] [INFO ] Added : 345 causal constraints over 69 iterations in 1460 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 10:17:43] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned unsat
[2021-05-08 10:17:44] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2021-05-08 10:17:44] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 10:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:44] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 0 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2021-05-08 10:17:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 742 ms
[2021-05-08 10:17:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:44] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:45] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 0 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 0 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 0 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2021-05-08 10:17:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 829 ms
[2021-05-08 10:17:45] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-08 10:17:47] [INFO ] Added : 387 causal constraints over 78 iterations in 1625 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 10:17:47] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2021-05-08 10:17:47] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:47] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-08 10:17:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:47] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:47] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:47] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-08 10:17:47] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:17:48] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2021-05-08 10:17:48] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2021-05-08 10:17:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2021-05-08 10:17:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-08 10:17:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 396 ms
[2021-05-08 10:17:48] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-08 10:17:49] [INFO ] Added : 376 causal constraints over 76 iterations in 1708 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 10:17:50] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:50] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:50] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 10:17:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:50] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2021-05-08 10:17:50] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:50] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 5 ms to minimize.
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2021-05-08 10:17:50] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2021-05-08 10:17:51] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2021-05-08 10:17:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 643 ms
[2021-05-08 10:17:51] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-08 10:17:52] [INFO ] Added : 365 causal constraints over 74 iterations in 1556 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 10:17:52] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:52] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:52] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-08 10:17:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:52] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned unsat
[2021-05-08 10:17:52] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2021-05-08 10:17:52] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:53] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-08 10:17:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:53] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2021-05-08 10:17:53] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:53] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-08 10:17:53] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2021-05-08 10:17:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2021-05-08 10:17:53] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2021-05-08 10:17:53] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2021-05-08 10:17:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 273 ms
[2021-05-08 10:17:53] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-08 10:17:55] [INFO ] Added : 371 causal constraints over 75 iterations in 1593 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 10:17:55] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2021-05-08 10:17:55] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:55] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-08 10:17:55] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2021-05-08 10:17:55] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2021-05-08 10:17:55] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2021-05-08 10:17:55] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2021-05-08 10:17:55] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-08 10:17:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 395 ms
[2021-05-08 10:17:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 10:17:55] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:55] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-08 10:17:55] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2021-05-08 10:17:55] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-08 10:17:56] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2021-05-08 10:17:56] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2021-05-08 10:17:56] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-08 10:17:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 363 ms
[2021-05-08 10:17:56] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-08 10:17:57] [INFO ] Added : 332 causal constraints over 67 iterations in 1403 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Incomplete Parikh walk after 44500 steps, including 232 resets, run finished after 199 ms. (steps per millisecond=223 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26500 steps, including 148 resets, run finished after 112 ms. (steps per millisecond=236 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 51500 steps, including 225 resets, run finished after 200 ms. (steps per millisecond=257 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 41500 steps, including 175 resets, run finished after 119 ms. (steps per millisecond=348 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 30800 steps, including 146 resets, run finished after 87 ms. (steps per millisecond=354 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 39400 steps, including 176 resets, run finished after 111 ms. (steps per millisecond=354 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 28900 steps, including 160 resets, run finished after 78 ms. (steps per millisecond=370 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 19 out of 390 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 390 transition count 253
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 154 rules applied. Total rules applied 289 place count 255 transition count 234
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 300 place count 251 transition count 227
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 309 place count 244 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 310 place count 243 transition count 225
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 310 place count 243 transition count 177
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 406 place count 195 transition count 177
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 441 place count 160 transition count 142
Iterating global reduction 5 with 35 rules applied. Total rules applied 476 place count 160 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 477 place count 160 transition count 141
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 477 place count 160 transition count 130
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 499 place count 149 transition count 130
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 571 place count 113 transition count 94
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 574 place count 113 transition count 91
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 587 place count 113 transition count 78
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 600 place count 100 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 601 place count 99 transition count 77
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 8 rules applied. Total rules applied 609 place count 92 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 610 place count 91 transition count 76
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 610 place count 91 transition count 65
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 632 place count 80 transition count 65
Applied a total of 632 rules in 114 ms. Remains 80 /390 variables (removed 310) and now considering 65/388 (removed 323) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/390 places, 65/388 transitions.
[2021-05-08 10:17:58] [INFO ] Flatten gal took : 27 ms
[2021-05-08 10:17:58] [INFO ] Flatten gal took : 9 ms
[2021-05-08 10:17:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6100291162878592463.gal : 6 ms
[2021-05-08 10:17:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4278682372129301011.prop : 0 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/ReachabilityCardinality6100291162878592463.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4278682372129301011.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/ReachabilityCardinality6100291162878592463.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4278682372129301011.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4278682372129301011.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 54
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :54 after 1296
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1296 after 33696
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :33696 after 41310
Invariant property AutoFlight-PT-04b-ReachabilityFireability-09 does not hold.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :41310 after 96804
Reachability property AutoFlight-PT-04b-ReachabilityFireability-06 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property AutoFlight-PT-04b-ReachabilityFireability-00 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :96804 after 102168
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :102168 after 260732
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :260732 after 310528
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :310528 after 880778
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,3.9839e+06,0.145443,5896,2,1060,19,8870,7,0,394,7682,0
Total reachable state count : 3983904

Verifying 4 reachability properties.
Reachability property AutoFlight-PT-04b-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-04b-ReachabilityFireability-00,30,0.146388,5896,2,130,19,8870,8,0,397,7682,0
Reachability property AutoFlight-PT-04b-ReachabilityFireability-06 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-04b-ReachabilityFireability-06,1,0.146888,6160,2,81,19,8870,9,0,399,7682,0
Invariant property AutoFlight-PT-04b-ReachabilityFireability-09 does not hold.

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-04b-ReachabilityFireability-09,3240,0.148214,6160,2,129,19,8870,10,0,416,7682,0
Reachability property AutoFlight-PT-04b-ReachabilityFireability-15 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-15 TRUE 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-04b-ReachabilityFireability-15,24,0.149903,6160,2,100,19,8870,10,0,431,7682,0
All properties solved without resorting to model-checking.

BK_STOP 1620469080000

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

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

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