Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701700156.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
Input is AutoFlight-PT-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.4K Apr 30 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 30 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 30 01:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 30 01:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 30 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 30 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 70K May 10 09:33 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-03b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655069549938

Running Version 0
[2022-06-12 21:32:32] [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]
[2022-06-12 21:32:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:32:32] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2022-06-12 21:32:32] [INFO ] Transformed 298 places.
[2022-06-12 21:32:32] [INFO ] Transformed 296 transitions.
[2022-06-12 21:32:32] [INFO ] Found NUPN structural information;
[2022-06-12 21:32:32] [INFO ] Parsed PT model containing 298 places and 296 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 62 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-03b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 298 cols
[2022-06-12 21:32:32] [INFO ] Computed 22 place invariants in 32 ms
[2022-06-12 21:32:32] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2022-06-12 21:32:32] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:33] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 7 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1158 ms
[2022-06-12 21:32:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2022-06-12 21:32:34] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 13 ms returned sat
[2022-06-12 21:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:34] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 0 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 5 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 8 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:32:35] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:32:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 611 ms
[2022-06-12 21:32:35] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 20 ms.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 36 places in 23 ms of which 1 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 792 ms
[2022-06-12 21:32:37] [INFO ] Added : 290 causal constraints over 59 iterations in 2262 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:32:37] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2022-06-12 21:32:37] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:37] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-06-12 21:32:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2022-06-12 21:32:37] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:37] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 420 ms
[2022-06-12 21:32:38] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2022-06-12 21:32:38] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:38] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:32:41] [INFO ] Deduced a trap composed of 37 places in 2674 ms of which 2 ms to minimize.
[2022-06-12 21:32:41] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 13 ms to minimize.
[2022-06-12 21:32:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3016 ms
[2022-06-12 21:32:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 127 ms returned sat
[2022-06-12 21:32:41] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:42] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-12 21:32:42] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:32:43] [INFO ] Deduced a trap composed of 81 places in 1475 ms of which 0 ms to minimize.
[2022-06-12 21:32:44] [INFO ] Deduced a trap composed of 37 places in 844 ms of which 1 ms to minimize.
[2022-06-12 21:32:44] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:32:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2559 ms
[2022-06-12 21:32:44] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 19 ms.
[2022-06-12 21:32:45] [INFO ] Added : 273 causal constraints over 55 iterations in 1243 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:32:45] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2022-06-12 21:32:45] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:46] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-12 21:32:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2022-06-12 21:32:46] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:46] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-06-12 21:32:46] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:32:46] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:32:46] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:32:46] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:32:46] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:32:46] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:32:47] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:32:47] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:32:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 782 ms
[2022-06-12 21:32:47] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 20 ms.
[2022-06-12 21:32:48] [INFO ] Added : 280 causal constraints over 56 iterations in 1305 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA AutoFlight-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 25000 steps, including 157 resets, run finished after 73 ms. (steps per millisecond=342 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-03b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 16500 steps, including 111 resets, run finished after 39 ms. (steps per millisecond=423 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-03b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 30000 steps, including 204 resets, run finished after 64 ms. (steps per millisecond=468 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 8 out of 298 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 298/298 places, 296/296 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 298 transition count 190
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 1 with 126 rules applied. Total rules applied 232 place count 192 transition count 170
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 242 place count 186 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 246 place count 182 transition count 166
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 246 place count 182 transition count 125
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 328 place count 141 transition count 125
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 354 place count 115 transition count 99
Iterating global reduction 4 with 26 rules applied. Total rules applied 380 place count 115 transition count 99
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 380 place count 115 transition count 92
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 394 place count 108 transition count 92
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 440 place count 85 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 441 place count 85 transition count 68
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 450 place count 85 transition count 59
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 459 place count 76 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 460 place count 75 transition count 58
Reduce places removed 8 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 5 with 14 rules applied. Total rules applied 474 place count 67 transition count 52
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 481 place count 61 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 482 place count 60 transition count 51
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 482 place count 60 transition count 41
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 502 place count 50 transition count 41
Applied a total of 502 rules in 87 ms. Remains 50 /298 variables (removed 248) and now considering 41/296 (removed 255) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/298 places, 41/296 transitions.
[2022-06-12 21:32:48] [INFO ] Flatten gal took : 32 ms
[2022-06-12 21:32:48] [INFO ] Flatten gal took : 9 ms
[2022-06-12 21:32:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4212708922611413236.gal : 6 ms
[2022-06-12 21:32:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9735331482685835970.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/ReachabilityCardinality4212708922611413236.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9735331482685835970.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/ReachabilityCardinality4212708922611413236.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9735331482685835970.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9735331482685835970.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 36
Reachability property AutoFlight-PT-03b-ReachabilityFireability-14 is true.
FORMULA AutoFlight-PT-03b-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
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,306,0.016187,4048,2,172,9,712,6,0,229,202,0
Total reachable state count : 306

Verifying 1 reachability properties.
Reachability property AutoFlight-PT-03b-ReachabilityFireability-14 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-03b-ReachabilityFireability-14,1,0.017132,4420,2,51,9,712,7,0,252,202,0
All properties solved without resorting to model-checking.

BK_STOP 1655069569170

--------------------
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-03b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is AutoFlight-PT-03b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-tajo-165245701700156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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