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.r011-tall-162038006100240.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 gold2020
Input is AutoFlight-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100240
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.4K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:18 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 266K 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-12b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620438950061

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 01:55:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 01:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 01:55:51] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2021-05-08 01:55:51] [INFO ] Transformed 1126 places.
[2021-05-08 01:55:51] [INFO ] Transformed 1124 transitions.
[2021-05-08 01:55:51] [INFO ] Found NUPN structural information;
[2021-05-08 01:55:51] [INFO ] Parsed PT model containing 1126 places and 1124 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1]
FORMULA AutoFlight-PT-12b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1124 rows 1126 cols
[2021-05-08 01:55:52] [INFO ] Computed 76 place invariants in 34 ms
[2021-05-08 01:55:52] [INFO ] [Real]Absence check using 75 positive place invariants in 99 ms returned sat
[2021-05-08 01:55:52] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 01:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:55:54] [INFO ] [Real]Absence check using state equation in 2383 ms returned sat
[2021-05-08 01:55:55] [INFO ] Deduced a trap composed of 19 places in 451 ms
[2021-05-08 01:55:55] [INFO ] Deduced a trap composed of 17 places in 382 ms
[2021-05-08 01:55:56] [INFO ] Deduced a trap composed of 20 places in 421 ms
[2021-05-08 01:55:56] [INFO ] Deduced a trap composed of 22 places in 384 ms
[2021-05-08 01:55:57] [INFO ] Deduced a trap composed of 38 places in 370 ms
[2021-05-08 01:55:57] [INFO ] Deduced a trap composed of 25 places in 649 ms
[2021-05-08 01:55:57] [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 closed (> (+ s0 s1 s2 s734 s735 s736 s737 s738 s1054 s1055 s1056 s1057 s1058 s1059 s1060 s1061 s1062 s1063 s1064 s1065 s1066 s1067 s1068 s1069 s1070) 0)") while checking expression at index 0
[2021-05-08 01:55:57] [INFO ] [Real]Absence check using 75 positive place invariants in 85 ms returned sat
[2021-05-08 01:55:57] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 01:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:56:00] [INFO ] [Real]Absence check using state equation in 2393 ms returned sat
[2021-05-08 01:56:00] [INFO ] Deduced a trap composed of 31 places in 337 ms
[2021-05-08 01:56:01] [INFO ] Deduced a trap composed of 29 places in 337 ms
[2021-05-08 01:56:01] [INFO ] Deduced a trap composed of 27 places in 330 ms
[2021-05-08 01:56:01] [INFO ] Deduced a trap composed of 30 places in 326 ms
[2021-05-08 01:56:02] [INFO ] Deduced a trap composed of 20 places in 346 ms
[2021-05-08 01:56:02] [INFO ] Deduced a trap composed of 44 places in 328 ms
[2021-05-08 01:56:02] [INFO ] Deduced a trap composed of 29 places in 313 ms
[2021-05-08 01:56:02] [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 closed (> (+ s0 s1 s2 s684 s685 s686 s687 s688 s689 s690 s691 s692 s693 s694 s734 s735 s736 s737 s1071 s1078 s1079 s1080 s1081 s1082 s1083 s1084 s1085 s1086 s1087) 0)") while checking expression at index 1
[2021-05-08 01:56:03] [INFO ] [Real]Absence check using 75 positive place invariants in 84 ms returned sat
[2021-05-08 01:56:03] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 01:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:56:05] [INFO ] [Real]Absence check using state equation in 2587 ms returned sat
[2021-05-08 01:56:06] [INFO ] Deduced a trap composed of 23 places in 359 ms
[2021-05-08 01:56:06] [INFO ] Deduced a trap composed of 20 places in 362 ms
[2021-05-08 01:56:06] [INFO ] Deduced a trap composed of 17 places in 343 ms
[2021-05-08 01:56:07] [INFO ] Deduced a trap composed of 161 places in 353 ms
[2021-05-08 01:56:07] [INFO ] Deduced a trap composed of 26 places in 347 ms
[2021-05-08 01:56:08] [INFO ] Deduced a trap composed of 111 places in 340 ms
[2021-05-08 01:56:08] [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 closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s85 s86 s87 s88 s92 s93 s94 s95 s96 s97 s163 s164 s165 s166 s170 s171 s174 s175 s396 s397 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s514 s515 s516 s517 s521 s522 s523 s524 s525 s526 s749 s750 s751 s752 s753 s760 s761 s762 s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s856 s857 s883 s884 s885 s886 s887 s888) 0)") while checking expression at index 2
[2021-05-08 01:56:08] [INFO ] [Real]Absence check using 75 positive place invariants in 79 ms returned sat
[2021-05-08 01:56:08] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 01:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:56:10] [INFO ] [Real]Absence check using state equation in 2349 ms returned sat
[2021-05-08 01:56:11] [INFO ] Deduced a trap composed of 35 places in 371 ms
[2021-05-08 01:56:11] [INFO ] Deduced a trap composed of 20 places in 354 ms
[2021-05-08 01:56:11] [INFO ] Deduced a trap composed of 22 places in 340 ms
[2021-05-08 01:56:12] [INFO ] Deduced a trap composed of 30 places in 328 ms
[2021-05-08 01:56:12] [INFO ] Deduced a trap composed of 36 places in 321 ms
[2021-05-08 01:56:12] [INFO ] Deduced a trap composed of 19 places in 313 ms
[2021-05-08 01:56:13] [INFO ] Deduced a trap composed of 33 places in 332 ms
[2021-05-08 01:56:13] [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 closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s649 s651 s652 s654 s655 s656 s657 s658 s659 s660 s661 s1038 s1039 s1040 s1041 s1042 s1043 s1044 s1045 s1046) 0)") while checking expression at index 3
[2021-05-08 01:56:13] [INFO ] [Real]Absence check using 75 positive place invariants in 84 ms returned sat
[2021-05-08 01:56:13] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 01:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:56:16] [INFO ] [Real]Absence check using state equation in 2524 ms returned sat
[2021-05-08 01:56:16] [INFO ] Deduced a trap composed of 34 places in 382 ms
[2021-05-08 01:56:16] [INFO ] Deduced a trap composed of 31 places in 366 ms
[2021-05-08 01:56:17] [INFO ] Deduced a trap composed of 32 places in 368 ms
[2021-05-08 01:56:17] [INFO ] Deduced a trap composed of 23 places in 378 ms
[2021-05-08 01:56:18] [INFO ] Deduced a trap composed of 34 places in 357 ms
[2021-05-08 01:56:18] [INFO ] Deduced a trap composed of 36 places in 356 ms
[2021-05-08 01:56:18] [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 closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s336 s337 s338 s339 s340 s341 s342 s343 s344 s649 s651 s652 s654 s655 s656 s657 s658 s659 s660 s661 s1041 s1042 s1043) 0)") while checking expression at index 4
[2021-05-08 01:56:18] [INFO ] [Real]Absence check using 75 positive place invariants in 82 ms returned sat
[2021-05-08 01:56:18] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned unsat
[2021-05-08 01:56:18] [INFO ] [Real]Absence check using 75 positive place invariants in 81 ms returned sat
[2021-05-08 01:56:18] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 01:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:56:21] [INFO ] [Real]Absence check using state equation in 2603 ms returned sat
[2021-05-08 01:56:21] [INFO ] Deduced a trap composed of 25 places in 375 ms
[2021-05-08 01:56:22] [INFO ] Deduced a trap composed of 21 places in 354 ms
[2021-05-08 01:56:22] [INFO ] Deduced a trap composed of 66 places in 342 ms
[2021-05-08 01:56:23] [INFO ] Deduced a trap composed of 35 places in 333 ms
[2021-05-08 01:56:23] [INFO ] Deduced a trap composed of 53 places in 334 ms
[2021-05-08 01:56:23] [INFO ] Deduced a trap composed of 32 places in 326 ms
[2021-05-08 01:56:23] [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 closed (> (+ s0 s1 s2 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s734 s735 s736 s737 s738 s739 s740 s1020 s1027 s1028 s1029 s1030 s1031 s1032 s1033 s1034 s1035 s1036) 0)") while checking expression at index 6
FORMULA AutoFlight-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 34 out of 1126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Performed 432 Post agglomeration using F-continuation condition.Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 432 place count 1126 transition count 692
Reduce places removed 432 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 511 rules applied. Total rules applied 943 place count 694 transition count 613
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 965 place count 672 transition count 613
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 965 place count 672 transition count 474
Deduced a syphon composed of 139 places in 2 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 1243 place count 533 transition count 474
Symmetric choice reduction at 3 with 111 rule applications. Total rules 1354 place count 533 transition count 474
Deduced a syphon composed of 111 places in 3 ms
Reduce places removed 111 places and 111 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 1576 place count 422 transition count 363
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 1576 place count 422 transition count 332
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1638 place count 391 transition count 332
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1818 place count 301 transition count 242
Free-agglomeration rule applied 43 times.
Iterating global reduction 3 with 43 rules applied. Total rules applied 1861 place count 301 transition count 199
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1904 place count 258 transition count 199
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1906 place count 258 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1907 place count 258 transition count 198
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1908 place count 258 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1910 place count 257 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1911 place count 257 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1912 place count 256 transition count 196
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 9 rules applied. Total rules applied 1921 place count 249 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1923 place count 247 transition count 194
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 1923 place count 247 transition count 189
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1933 place count 242 transition count 189
Applied a total of 1933 rules in 290 ms. Remains 242 /1126 variables (removed 884) and now considering 189/1124 (removed 935) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/1126 places, 189/1124 transitions.
Incomplete random walk after 1000000 steps, including 12672 resets, run finished after 3021 ms. (steps per millisecond=331 ) properties seen :[1, 0, 1, 1, 1, 1]
FORMULA AutoFlight-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1202 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=400 )
FORMULA AutoFlight-PT-12b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

--------------------
content from stderr:

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-12b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is AutoFlight-PT-12b, 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 r011-tall-162038006100240"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 ;