Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853400543.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Parking-PT-432, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853400543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 3.7K Apr 11 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 11 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 10 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 192K Mar 24 05:37 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 Parking-PT-432-ReachabilityFireability-00
FORMULA_NAME Parking-PT-432-ReachabilityFireability-01
FORMULA_NAME Parking-PT-432-ReachabilityFireability-02
FORMULA_NAME Parking-PT-432-ReachabilityFireability-03
FORMULA_NAME Parking-PT-432-ReachabilityFireability-04
FORMULA_NAME Parking-PT-432-ReachabilityFireability-05
FORMULA_NAME Parking-PT-432-ReachabilityFireability-06
FORMULA_NAME Parking-PT-432-ReachabilityFireability-07
FORMULA_NAME Parking-PT-432-ReachabilityFireability-08
FORMULA_NAME Parking-PT-432-ReachabilityFireability-09
FORMULA_NAME Parking-PT-432-ReachabilityFireability-10
FORMULA_NAME Parking-PT-432-ReachabilityFireability-11
FORMULA_NAME Parking-PT-432-ReachabilityFireability-12
FORMULA_NAME Parking-PT-432-ReachabilityFireability-13
FORMULA_NAME Parking-PT-432-ReachabilityFireability-14
FORMULA_NAME Parking-PT-432-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591153454856

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:04:16] [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]
[2020-06-03 03:04:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:04:17] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2020-06-03 03:04:17] [INFO ] Transformed 529 places.
[2020-06-03 03:04:17] [INFO ] Transformed 785 transitions.
[2020-06-03 03:04:17] [INFO ] Found NUPN structural information;
[2020-06-03 03:04:17] [INFO ] Parsed PT model containing 529 places and 785 transitions in 202 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 91 resets, run finished after 159 ms. (steps per millisecond=62 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA Parking-PT-432-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 457 rows 529 cols
[2020-06-03 03:04:17] [INFO ] Computed 124 place invariants in 30 ms
[2020-06-03 03:04:18] [INFO ] [Real]Absence check using 120 positive place invariants in 103 ms returned sat
[2020-06-03 03:04:18] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:19] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2020-06-03 03:04:19] [INFO ] State equation strengthened by 108 read => feed constraints.
[2020-06-03 03:04:19] [INFO ] [Real]Added 108 Read/Feed constraints in 25 ms returned sat
[2020-06-03 03:04:19] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 185 ms.
[2020-06-03 03:04:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:20] [INFO ] [Nat]Absence check using 120 positive place invariants in 167 ms returned sat
[2020-06-03 03:04:20] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 12 ms returned sat
[2020-06-03 03:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:21] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2020-06-03 03:04:21] [INFO ] [Nat]Added 108 Read/Feed constraints in 24 ms returned sat
[2020-06-03 03:04:21] [INFO ] Deduced a trap composed of 52 places in 186 ms
[2020-06-03 03:04:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2020-06-03 03:04:21] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 114 ms.
[2020-06-03 03:04:24] [INFO ] Added : 320 causal constraints over 64 iterations in 3413 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 03:04:24] [INFO ] [Real]Absence check using 120 positive place invariants in 73 ms returned sat
[2020-06-03 03:04:24] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 14 ms returned sat
[2020-06-03 03:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:25] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2020-06-03 03:04:25] [INFO ] [Real]Added 108 Read/Feed constraints in 44 ms returned sat
[2020-06-03 03:04:25] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 96 ms.
[2020-06-03 03:04:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:26] [INFO ] [Nat]Absence check using 120 positive place invariants in 68 ms returned sat
[2020-06-03 03:04:26] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 03:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:27] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2020-06-03 03:04:27] [INFO ] [Nat]Added 108 Read/Feed constraints in 31 ms returned sat
[2020-06-03 03:04:27] [INFO ] Deduced a trap composed of 52 places in 102 ms
[2020-06-03 03:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-06-03 03:04:27] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 53 ms.
[2020-06-03 03:04:30] [INFO ] Added : 370 causal constraints over 74 iterations in 3631 ms. Result :(error "Failed to check-sat")
[2020-06-03 03:04:31] [INFO ] [Real]Absence check using 120 positive place invariants in 164 ms returned sat
[2020-06-03 03:04:31] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:31] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2020-06-03 03:04:31] [INFO ] [Real]Added 108 Read/Feed constraints in 29 ms returned sat
[2020-06-03 03:04:32] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 41 ms.
[2020-06-03 03:04:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:32] [INFO ] [Nat]Absence check using 120 positive place invariants in 102 ms returned sat
[2020-06-03 03:04:32] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 03:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:33] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2020-06-03 03:04:33] [INFO ] [Nat]Added 108 Read/Feed constraints in 32 ms returned sat
[2020-06-03 03:04:33] [INFO ] Deduced a trap composed of 60 places in 135 ms
[2020-06-03 03:04:33] [INFO ] Deduced a trap composed of 60 places in 50 ms
[2020-06-03 03:04:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2020-06-03 03:04:33] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 44 ms.
[2020-06-03 03:04:37] [INFO ] Added : 370 causal constraints over 74 iterations in 3787 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 03:04:37] [INFO ] [Real]Absence check using 120 positive place invariants in 73 ms returned sat
[2020-06-03 03:04:37] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 03:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:38] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2020-06-03 03:04:38] [INFO ] [Real]Added 108 Read/Feed constraints in 23 ms returned sat
[2020-06-03 03:04:38] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 27 ms.
[2020-06-03 03:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:38] [INFO ] [Nat]Absence check using 120 positive place invariants in 82 ms returned sat
[2020-06-03 03:04:38] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 03:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:39] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2020-06-03 03:04:39] [INFO ] [Nat]Added 108 Read/Feed constraints in 39 ms returned sat
[2020-06-03 03:04:39] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 59 ms.
[2020-06-03 03:04:43] [INFO ] Added : 360 causal constraints over 72 iterations in 3845 ms. Result :sat
[2020-06-03 03:04:43] [INFO ] Deduced a trap composed of 3 places in 552 ms
[2020-06-03 03:04:43] [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 s523 s524) 0)") while checking expression at index 3
[2020-06-03 03:04:44] [INFO ] [Real]Absence check using 120 positive place invariants in 81 ms returned sat
[2020-06-03 03:04:44] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:44] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2020-06-03 03:04:44] [INFO ] [Real]Added 108 Read/Feed constraints in 16 ms returned sat
[2020-06-03 03:04:44] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 26 ms.
[2020-06-03 03:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:45] [INFO ] [Nat]Absence check using 120 positive place invariants in 71 ms returned sat
[2020-06-03 03:04:45] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 03:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:46] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2020-06-03 03:04:46] [INFO ] [Nat]Added 108 Read/Feed constraints in 28 ms returned sat
[2020-06-03 03:04:46] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 39 ms.
[2020-06-03 03:04:50] [INFO ] Added : 350 causal constraints over 70 iterations in 4025 ms. Result :unknown
[2020-06-03 03:04:50] [INFO ] [Real]Absence check using 120 positive place invariants in 67 ms returned sat
[2020-06-03 03:04:50] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 03:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:50] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2020-06-03 03:04:50] [INFO ] [Real]Added 108 Read/Feed constraints in 18 ms returned sat
[2020-06-03 03:04:51] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 31 ms.
[2020-06-03 03:04:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:51] [INFO ] [Nat]Absence check using 120 positive place invariants in 115 ms returned sat
[2020-06-03 03:04:51] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 03:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:52] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2020-06-03 03:04:52] [INFO ] [Nat]Added 108 Read/Feed constraints in 22 ms returned sat
[2020-06-03 03:04:52] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 34 ms.
[2020-06-03 03:04:56] [INFO ] Added : 385 causal constraints over 77 iterations in 3911 ms. Result :unknown
[2020-06-03 03:04:56] [INFO ] [Real]Absence check using 120 positive place invariants in 80 ms returned sat
[2020-06-03 03:04:56] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 03:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:56] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2020-06-03 03:04:57] [INFO ] [Real]Added 108 Read/Feed constraints in 18 ms returned sat
[2020-06-03 03:04:57] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 28 ms.
[2020-06-03 03:04:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:57] [INFO ] [Nat]Absence check using 120 positive place invariants in 78 ms returned sat
[2020-06-03 03:04:57] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:58] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2020-06-03 03:04:58] [INFO ] [Nat]Added 108 Read/Feed constraints in 26 ms returned sat
[2020-06-03 03:04:58] [INFO ] Deduced a trap composed of 60 places in 78 ms
[2020-06-03 03:04:59] [INFO ] Deduced a trap composed of 52 places in 1448 ms
[2020-06-03 03:04:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1590 ms
[2020-06-03 03:04:59] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 21 ms.
[2020-06-03 03:05: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: Broken pipe (=> (> t284 0) (and (or (and (> t0 0) (< o0 o284)) (and (> t293 0) (< o293 o284))) (or (and (> t0 0) (< o0 o284)) (and (> t286 0) (< o286 o284)) (and (> t287 0) (< o287 o284)) (and (> t288 0) (< o288 o284)) (and (> t289 0) (< o289 o284)) (and (> t290 0) (< o290 o284)) (and (> t291 0) (< o291 o284)) (and (> t292 0) (< o292 o284)) (and (> t293 0) (< o293 o284)) (and (> t294 0) (< o294 o284)))))") while checking expression at index 6
[2020-06-03 03:05:02] [INFO ] [Real]Absence check using 120 positive place invariants in 71 ms returned sat
[2020-06-03 03:05:02] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:03] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2020-06-03 03:05:03] [INFO ] [Real]Added 108 Read/Feed constraints in 19 ms returned sat
[2020-06-03 03:05:03] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 90 ms.
[2020-06-03 03:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:05:03] [INFO ] [Nat]Absence check using 120 positive place invariants in 154 ms returned sat
[2020-06-03 03:05:03] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 26 ms returned sat
[2020-06-03 03:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:04] [INFO ] [Nat]Absence check using state equation in 1086 ms returned sat
[2020-06-03 03:05:04] [INFO ] [Nat]Added 108 Read/Feed constraints in 30 ms returned sat
[2020-06-03 03:05:04] [INFO ] Deduced a trap composed of 52 places in 73 ms
[2020-06-03 03:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-06-03 03:05:05] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 27 ms.
[2020-06-03 03:05:08] [INFO ] Added : 310 causal constraints over 62 iterations in 3351 ms. Result :unknown
[2020-06-03 03:05:08] [INFO ] [Real]Absence check using 120 positive place invariants in 85 ms returned sat
[2020-06-03 03:05:08] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:09] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2020-06-03 03:05:09] [INFO ] [Real]Added 108 Read/Feed constraints in 18 ms returned sat
[2020-06-03 03:05:09] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 33 ms.
[2020-06-03 03:05:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:05:09] [INFO ] [Nat]Absence check using 120 positive place invariants in 87 ms returned sat
[2020-06-03 03:05:09] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 03:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:10] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2020-06-03 03:05:10] [INFO ] [Nat]Added 108 Read/Feed constraints in 30 ms returned sat
[2020-06-03 03:05:10] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 40 ms.
[2020-06-03 03:05:14] [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 (=> (> t430 0) (and (or (and (> t0 0) (< o0 o430)) (and (> t403 0) (< o403 o430))) (and (> t226 0) (< o226 o430))))") while checking expression at index 8
[2020-06-03 03:05:14] [INFO ] [Real]Absence check using 120 positive place invariants in 73 ms returned sat
[2020-06-03 03:05:14] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:15] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2020-06-03 03:05:15] [INFO ] [Real]Added 108 Read/Feed constraints in 18 ms returned sat
[2020-06-03 03:05:15] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 49 ms.
[2020-06-03 03:05:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:05:15] [INFO ] [Nat]Absence check using 120 positive place invariants in 61 ms returned sat
[2020-06-03 03:05:15] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 15 ms returned sat
[2020-06-03 03:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:16] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2020-06-03 03:05:16] [INFO ] [Nat]Added 108 Read/Feed constraints in 35 ms returned sat
[2020-06-03 03:05:16] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 29 ms.
[2020-06-03 03:05:20] [INFO ] Added : 424 causal constraints over 85 iterations in 3807 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
Incomplete Parikh walk after 54300 steps, including 444 resets, run finished after 369 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 48200 steps, including 379 resets, run finished after 318 ms. (steps per millisecond=151 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA Parking-PT-432-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 52300 steps, including 409 resets, run finished after 399 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 44700 steps, including 348 resets, run finished after 367 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 50 out of 529 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 529/529 places, 457/457 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 529 transition count 450
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 522 transition count 450
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 522 transition count 444
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 516 transition count 444
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 516 transition count 444
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 513 transition count 441
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 501 transition count 429
Free-agglomeration rule applied 64 times.
Iterating global reduction 2 with 64 rules applied. Total rules applied 123 place count 501 transition count 365
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 187 place count 437 transition count 365
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 437 transition count 365
Applied a total of 189 rules in 252 ms. Remains 437 /529 variables (removed 92) and now considering 365/457 (removed 92) transitions.
Finished structural reductions, in 1 iterations. Remains : 437/529 places, 365/457 transitions.
Incomplete random walk after 1000000 steps, including 15063 resets, run finished after 4004 ms. (steps per millisecond=249 ) properties seen :[0, 1, 1, 1, 0, 1, 0, 1, 1]
FORMULA Parking-PT-432-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1463 resets, run finished after 2251 ms. (steps per millisecond=444 ) properties seen :[1, 0, 0]
FORMULA Parking-PT-432-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1444 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties seen :[1, 0]
FORMULA Parking-PT-432-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1357 resets, run finished after 2140 ms. (steps per millisecond=467 ) properties seen :[0]
// Phase 1: matrix 365 rows 437 cols
[2020-06-03 03:05:32] [INFO ] Computed 124 place invariants in 9 ms
[2020-06-03 03:05:32] [INFO ] [Real]Absence check using 120 positive place invariants in 89 ms returned sat
[2020-06-03 03:05:32] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 9 ms returned sat
[2020-06-03 03:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:33] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2020-06-03 03:05:33] [INFO ] State equation strengthened by 187 read => feed constraints.
[2020-06-03 03:05:33] [INFO ] [Real]Added 187 Read/Feed constraints in 33 ms returned sat
[2020-06-03 03:05:33] [INFO ] Computed and/alt/rep : 364/1661/364 causal constraints in 24 ms.
[2020-06-03 03:05:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:05:33] [INFO ] [Nat]Absence check using 120 positive place invariants in 68 ms returned sat
[2020-06-03 03:05:33] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 03:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:34] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2020-06-03 03:05:34] [INFO ] [Nat]Added 187 Read/Feed constraints in 54 ms returned sat
[2020-06-03 03:05:34] [INFO ] Computed and/alt/rep : 364/1661/364 causal constraints in 40 ms.
[2020-06-03 03:05:37] [INFO ] Added : 364 causal constraints over 73 iterations in 3132 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
Incomplete Parikh walk after 52800 steps, including 638 resets, run finished after 250 ms. (steps per millisecond=211 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 437 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 437/437 places, 365/365 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 437 transition count 359
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 431 transition count 359
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 431 transition count 353
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 425 transition count 353
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 425 transition count 353
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 424 transition count 352
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 420 transition count 348
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 420 transition count 333
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 65 place count 405 transition count 333
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 405 transition count 333
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 405 transition count 331
Applied a total of 68 rules in 109 ms. Remains 405 /437 variables (removed 32) and now considering 331/365 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 405/437 places, 331/365 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2324 ms. (steps per millisecond=430 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1717 ms. (steps per millisecond=582 ) properties seen :[0]
Interrupted probabilistic random walk after 5679640 steps, run timeout after 30001 ms. (steps per millisecond=189 ) properties seen :[0]
Probabilistic random walk after 5679640 steps, saw 1051825 distinct states, run finished after 30001 ms. (steps per millisecond=189 ) properties seen :[0]
// Phase 1: matrix 331 rows 405 cols
[2020-06-03 03:06:12] [INFO ] Computed 124 place invariants in 12 ms
[2020-06-03 03:06:12] [INFO ] [Real]Absence check using 120 positive place invariants in 59 ms returned sat
[2020-06-03 03:06:12] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 8 ms returned sat
[2020-06-03 03:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:06:12] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-03 03:06:12] [INFO ] State equation strengthened by 228 read => feed constraints.
[2020-06-03 03:06:12] [INFO ] [Real]Added 228 Read/Feed constraints in 36 ms returned sat
[2020-06-03 03:06:12] [INFO ] Computed and/alt/rep : 330/1413/330 causal constraints in 22 ms.
[2020-06-03 03:06:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:06:13] [INFO ] [Nat]Absence check using 120 positive place invariants in 61 ms returned sat
[2020-06-03 03:06:13] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 9 ms returned sat
[2020-06-03 03:06:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:06:13] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2020-06-03 03:06:13] [INFO ] [Nat]Added 228 Read/Feed constraints in 40 ms returned sat
[2020-06-03 03:06:13] [INFO ] Deduced a trap composed of 63 places in 50 ms
[2020-06-03 03:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2020-06-03 03:06:13] [INFO ] Computed and/alt/rep : 330/1413/330 causal constraints in 18 ms.
[2020-06-03 03:06:15] [INFO ] Added : 330 causal constraints over 66 iterations in 2163 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 43300 steps, including 198 resets, run finished after 156 ms. (steps per millisecond=277 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 331/331 transitions.
Applied a total of 0 rules in 11 ms. Remains 405 /405 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 405/405 places, 331/331 transitions.
Starting structural reductions, iteration 0 : 405/405 places, 331/331 transitions.
Applied a total of 0 rules in 11 ms. Remains 405 /405 variables (removed 0) and now considering 331/331 (removed 0) transitions.
// Phase 1: matrix 331 rows 405 cols
[2020-06-03 03:06:15] [INFO ] Computed 124 place invariants in 3 ms
[2020-06-03 03:06:17] [INFO ] Implicit Places using invariants in 1055 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 35, 42, 50, 56, 63, 70, 78, 84, 108, 110, 111, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 136, 143, 149, 155, 162, 169, 177, 183, 207, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 233, 240, 246, 252, 259, 266, 273, 279, 303, 305, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 332, 339, 345, 351, 358, 365, 371, 377, 401, 403, 404]
Discarding 117 places :
Implicit Place search using SMT only with invariants took 1068 ms to find 117 implicit places.
[2020-06-03 03:06:17] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 331 rows 288 cols
[2020-06-03 03:06:17] [INFO ] Computed 7 place invariants in 15 ms
[2020-06-03 03:06:17] [INFO ] Dead Transitions using invariants and state equation in 442 ms returned []
Starting structural reductions, iteration 1 : 288/405 places, 331/331 transitions.
Graph (trivial) has 291 edges and 288 vertex of which 155 / 288 are part of one of the 4 SCC in 11 ms
Free SCC test removed 151 places
Drop transitions removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Iterating post reduction 0 with 258 rules applied. Total rules applied 259 place count 137 transition count 73
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 337 place count 59 transition count 73
Symmetric choice reduction at 2 with 9 rule applications. Total rules 346 place count 59 transition count 73
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 364 place count 50 transition count 64
Symmetric choice reduction at 2 with 6 rule applications. Total rules 370 place count 50 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 382 place count 44 transition count 58
Symmetric choice reduction at 2 with 4 rule applications. Total rules 386 place count 44 transition count 58
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 6 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 394 place count 40 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 396 place count 40 transition count 50
Symmetric choice reduction at 3 with 2 rule applications. Total rules 398 place count 40 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 402 place count 38 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 404 place count 38 transition count 46
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 414 place count 33 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 416 place count 33 transition count 39
Symmetric choice reduction at 5 with 1 rule applications. Total rules 417 place count 33 transition count 39
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 419 place count 32 transition count 38
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 425 place count 29 transition count 61
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 427 place count 29 transition count 59
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 431 place count 29 transition count 55
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 435 place count 25 transition count 55
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 451 place count 25 transition count 39
Applied a total of 451 rules in 35 ms. Remains 25 /288 variables (removed 263) and now considering 39/331 (removed 292) transitions.
// Phase 1: matrix 39 rows 25 cols
[2020-06-03 03:06:17] [INFO ] Computed 7 place invariants in 10 ms
[2020-06-03 03:06:17] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 39 rows 25 cols
[2020-06-03 03:06:17] [INFO ] Computed 7 place invariants in 0 ms
[2020-06-03 03:06:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-06-03 03:06:17] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/405 places, 39/331 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties seen :[0]
Finished probabilistic random walk after 3936 steps, run visited all 1 properties in 6 ms. (steps per millisecond=656 )
Probabilistic random walk after 3936 steps, saw 700 distinct states, run finished after 6 ms. (steps per millisecond=656 ) properties seen :[1]
FORMULA Parking-PT-432-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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="Parking-PT-432"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Parking-PT-432, 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 r174-csrt-158987853400543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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