Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878500117.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 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 gold2021
Input is StigmergyElection-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878500117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.9K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 30 14:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 428K May 29 12:20 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 StigmergyElection-PT-05b-ReachabilityFireability-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654731103654

Running Version 0
[2022-06-08 23:31:46] [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-08 23:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:31:46] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2022-06-08 23:31:46] [INFO ] Transformed 699 places.
[2022-06-08 23:31:46] [INFO ] Transformed 1266 transitions.
[2022-06-08 23:31:46] [INFO ] Found NUPN structural information;
[2022-06-08 23:31:46] [INFO ] Parsed PT model containing 699 places and 1266 transitions in 293 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 114 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 16) seen :3
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1266 rows 699 cols
[2022-06-08 23:31:47] [INFO ] Computed 6 place invariants in 51 ms
[2022-06-08 23:31:48] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned sat
[2022-06-08 23:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:48] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2022-06-08 23:31:49] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 166 ms.
[2022-06-08 23:31:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:31:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 22 ms returned sat
[2022-06-08 23:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:50] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-06-08 23:31:50] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 232 ms.
[2022-06-08 23:31:53] [INFO ] Added : 159 causal constraints over 32 iterations in 2813 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-08 23:31:53] [INFO ] [Real]Absence check using 6 positive place invariants in 22 ms returned sat
[2022-06-08 23:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:54] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2022-06-08 23:31:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:31:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 31 ms returned sat
[2022-06-08 23:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:55] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2022-06-08 23:31:56] [INFO ] Deduced a trap composed of 241 places in 699 ms of which 2 ms to minimize.
[2022-06-08 23:31:57] [INFO ] Deduced a trap composed of 190 places in 585 ms of which 17 ms to minimize.
[2022-06-08 23:31:57] [INFO ] Deduced a trap composed of 189 places in 500 ms of which 2 ms to minimize.
[2022-06-08 23:31:58] [INFO ] Deduced a trap composed of 242 places in 574 ms of which 2 ms to minimize.
[2022-06-08 23:31:59] [INFO ] Deduced a trap composed of 196 places in 542 ms of which 1 ms to minimize.
[2022-06-08 23:31:59] [INFO ] Deduced a trap composed of 220 places in 571 ms of which 2 ms to minimize.
[2022-06-08 23:32:00] [INFO ] Deduced a trap composed of 20 places in 652 ms of which 1 ms to minimize.
[2022-06-08 23:32:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-08 23:32:00] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2022-06-08 23:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:01] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2022-06-08 23:32:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 23 ms returned sat
[2022-06-08 23:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:02] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2022-06-08 23:32:02] [INFO ] Deduced a trap composed of 194 places in 551 ms of which 1 ms to minimize.
[2022-06-08 23:32:03] [INFO ] Deduced a trap composed of 115 places in 553 ms of which 1 ms to minimize.
[2022-06-08 23:32:04] [INFO ] Deduced a trap composed of 192 places in 455 ms of which 1 ms to minimize.
[2022-06-08 23:32:04] [INFO ] Deduced a trap composed of 191 places in 475 ms of which 1 ms to minimize.
[2022-06-08 23:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 2328 ms
[2022-06-08 23:32:04] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2022-06-08 23:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:05] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2022-06-08 23:32:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned sat
[2022-06-08 23:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:07] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2022-06-08 23:32:07] [INFO ] Deduced a trap composed of 207 places in 509 ms of which 1 ms to minimize.
[2022-06-08 23:32:08] [INFO ] Deduced a trap composed of 192 places in 563 ms of which 1 ms to minimize.
[2022-06-08 23:32:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1231 ms
[2022-06-08 23:32:08] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 129 ms.
[2022-06-08 23:32:11] [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 ... while checking expression at index 3
[2022-06-08 23:32:11] [INFO ] [Real]Absence check using 6 positive place invariants in 32 ms returned sat
[2022-06-08 23:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:12] [INFO ] [Real]Absence check using state equation in 1278 ms returned sat
[2022-06-08 23:32:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned sat
[2022-06-08 23:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:13] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2022-06-08 23:32:13] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 126 ms.
[2022-06-08 23:32:17] [INFO ] Added : 230 causal constraints over 46 iterations in 4090 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-08 23:32:17] [INFO ] [Real]Absence check using 6 positive place invariants in 28 ms returned sat
[2022-06-08 23:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:18] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2022-06-08 23:32:18] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 99 ms.
[2022-06-08 23:32:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 30 ms returned sat
[2022-06-08 23:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:20] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2022-06-08 23:32:20] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 90 ms.
[2022-06-08 23:32:23] [INFO ] Added : 175 causal constraints over 35 iterations in 3433 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-08 23:32:23] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2022-06-08 23:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:24] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2022-06-08 23:32:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2022-06-08 23:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:25] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-06-08 23:32:25] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 120 ms.
[2022-06-08 23:32:30] [INFO ] Deduced a trap composed of 20 places in 890 ms of which 1 ms to minimize.
[2022-06-08 23:32:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-08 23:32:30] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2022-06-08 23:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:31] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2022-06-08 23:32:31] [INFO ] Deduced a trap composed of 160 places in 630 ms of which 1 ms to minimize.
[2022-06-08 23:32:32] [INFO ] Deduced a trap composed of 242 places in 636 ms of which 2 ms to minimize.
[2022-06-08 23:32:33] [INFO ] Deduced a trap composed of 190 places in 565 ms of which 1 ms to minimize.
[2022-06-08 23:32:34] [INFO ] Deduced a trap composed of 190 places in 552 ms of which 1 ms to minimize.
[2022-06-08 23:32:34] [INFO ] Deduced a trap composed of 108 places in 551 ms of which 2 ms to minimize.
[2022-06-08 23:32:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3425 ms
[2022-06-08 23:32:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 30 ms returned sat
[2022-06-08 23:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:35] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2022-06-08 23:32:36] [INFO ] Deduced a trap composed of 160 places in 589 ms of which 1 ms to minimize.
[2022-06-08 23:32:36] [INFO ] Deduced a trap composed of 242 places in 624 ms of which 1 ms to minimize.
[2022-06-08 23:32:37] [INFO ] Deduced a trap composed of 190 places in 632 ms of which 1 ms to minimize.
[2022-06-08 23:32:38] [INFO ] Deduced a trap composed of 190 places in 529 ms of which 1 ms to minimize.
[2022-06-08 23:32:38] [INFO ] Deduced a trap composed of 108 places in 568 ms of which 1 ms to minimize.
[2022-06-08 23:32:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3309 ms
[2022-06-08 23:32:39] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 127 ms.
[2022-06-08 23:32:40] [INFO ] Deduced a trap composed of 20 places in 794 ms of which 1 ms to minimize.
[2022-06-08 23:32:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2022-06-08 23:32:40] [INFO ] [Real]Absence check using 6 positive place invariants in 30 ms returned sat
[2022-06-08 23:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:41] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2022-06-08 23:32:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 25 ms returned unsat
[2022-06-08 23:32:41] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2022-06-08 23:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:42] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2022-06-08 23:32:42] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 101 ms.
[2022-06-08 23:32:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2022-06-08 23:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:43] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2022-06-08 23:32:43] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 85 ms.
[2022-06-08 23:32:46] [INFO ] Added : 170 causal constraints over 34 iterations in 2750 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-08 23:32:46] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-08 23:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:47] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2022-06-08 23:32:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2022-06-08 23:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:48] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2022-06-08 23:32:48] [INFO ] Deduced a trap composed of 190 places in 461 ms of which 1 ms to minimize.
[2022-06-08 23:32:49] [INFO ] Deduced a trap composed of 189 places in 479 ms of which 1 ms to minimize.
[2022-06-08 23:32:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1110 ms
[2022-06-08 23:32:49] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 131 ms.
[2022-06-08 23:32:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
[2022-06-08 23:32:52] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2022-06-08 23:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:53] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2022-06-08 23:32:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:32:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2022-06-08 23:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:54] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2022-06-08 23:32:54] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 122 ms.
[2022-06-08 23:32:58] [INFO ] Added : 205 causal constraints over 41 iterations in 4011 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-08 23:32:58] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2022-06-08 23:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:32:59] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2022-06-08 23:33:00] [INFO ] Deduced a trap composed of 120 places in 791 ms of which 1 ms to minimize.
[2022-06-08 23:33:01] [INFO ] Deduced a trap composed of 191 places in 690 ms of which 12 ms to minimize.
[2022-06-08 23:33:01] [INFO ] Deduced a trap composed of 189 places in 461 ms of which 12 ms to minimize.
[2022-06-08 23:33:02] [INFO ] Deduced a trap composed of 192 places in 445 ms of which 1 ms to minimize.
[2022-06-08 23:33:02] [INFO ] Deduced a trap composed of 244 places in 518 ms of which 1 ms to minimize.
[2022-06-08 23:33:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3304 ms
[2022-06-08 23:33:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:33:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 31 ms returned sat
[2022-06-08 23:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:33:03] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2022-06-08 23:33:04] [INFO ] Deduced a trap composed of 120 places in 551 ms of which 1 ms to minimize.
[2022-06-08 23:33:04] [INFO ] Deduced a trap composed of 191 places in 456 ms of which 1 ms to minimize.
[2022-06-08 23:33:05] [INFO ] Deduced a trap composed of 189 places in 671 ms of which 1 ms to minimize.
[2022-06-08 23:33:06] [INFO ] Deduced a trap composed of 192 places in 462 ms of which 1 ms to minimize.
[2022-06-08 23:33:06] [INFO ] Deduced a trap composed of 244 places in 386 ms of which 1 ms to minimize.
[2022-06-08 23:33:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2866 ms
[2022-06-08 23:33:06] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 122 ms.
[2022-06-08 23:33:08] [INFO ] Deduced a trap composed of 20 places in 794 ms of which 1 ms to minimize.
[2022-06-08 23:33: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 close... while checking expression at index 12
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 21500 steps, including 236 resets, run finished after 100 ms. (steps per millisecond=215 ) properties (out of 11) seen :0 could not realise parikh vector
Incomplete Parikh walk after 23900 steps, including 279 resets, run finished after 97 ms. (steps per millisecond=246 ) properties (out of 11) seen :0 could not realise parikh vector
Incomplete Parikh walk after 22900 steps, including 259 resets, run finished after 103 ms. (steps per millisecond=222 ) properties (out of 11) seen :0 could not realise parikh vector
Incomplete Parikh walk after 39700 steps, including 469 resets, run finished after 176 ms. (steps per millisecond=225 ) properties (out of 11) seen :2 could not realise parikh vector
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 84 out of 699 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 520 edges and 699 vertex of which 52 / 699 are part of one of the 10 SCC in 8 ms
Free SCC test removed 42 places
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 1232 edges and 657 vertex of which 647 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.12 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 309 transitions
Trivial Post-agglo rules discarded 309 transitions
Performed 309 trivial Post agglomeration. Transition count delta: 309
Iterating post reduction 0 with 313 rules applied. Total rules applied 315 place count 647 transition count 894
Reduce places removed 309 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 316 rules applied. Total rules applied 631 place count 338 transition count 887
Reduce places removed 3 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 58 rules applied. Total rules applied 689 place count 335 transition count 832
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 57 rules applied. Total rules applied 746 place count 280 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 747 place count 279 transition count 830
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 747 place count 279 transition count 803
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 801 place count 252 transition count 803
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 851 place count 202 transition count 753
Iterating global reduction 5 with 50 rules applied. Total rules applied 901 place count 202 transition count 753
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 904 place count 202 transition count 750
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 905 place count 201 transition count 750
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 906 place count 200 transition count 749
Iterating global reduction 7 with 1 rules applied. Total rules applied 907 place count 200 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 941 place count 183 transition count 732
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 944 place count 180 transition count 729
Iterating global reduction 7 with 3 rules applied. Total rules applied 947 place count 180 transition count 729
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 961 place count 173 transition count 731
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 962 place count 173 transition count 730
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 967 place count 173 transition count 725
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 975 place count 173 transition count 717
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 983 place count 165 transition count 717
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 984 place count 165 transition count 716
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 987 place count 165 transition count 716
Applied a total of 987 rules in 349 ms. Remains 165 /699 variables (removed 534) and now considering 716/1266 (removed 550) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/699 places, 716/1266 transitions.
[2022-06-08 23:33:10] [INFO ] Flatten gal took : 230 ms
[2022-06-08 23:33:10] [INFO ] Flatten gal took : 131 ms
[2022-06-08 23:33:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3265478517464699499.gal : 57 ms
[2022-06-08 23:33:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5951140798132358151.prop : 3 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/ReachabilityCardinality3265478517464699499.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5951140798132358151.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/ReachabilityCardinality3265478517464699499.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5951140798132358151.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5951140798132358151.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :9 after 24
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :24 after 29
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :29 after 161
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :161 after 4001
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :4001 after 71285
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :71285 after 105581
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :105581 after 301733
Reachability property StigmergyElection-PT-05b-ReachabilityFireability-15 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property StigmergyElection-PT-05b-ReachabilityFireability-06 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2022-06-08 23:33:25] [INFO ] Flatten gal took : 95 ms
[2022-06-08 23:33:25] [INFO ] Applying decomposition
[2022-06-08 23:33:25] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7223360643023832861.txt, -o, /tmp/graph7223360643023832861.bin, -w, /tmp/graph7223360643023832861.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7223360643023832861.bin, -l, -1, -v, -w, /tmp/graph7223360643023832861.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:33:26] [INFO ] Decomposing Gal with order
[2022-06-08 23:33:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:33:26] [INFO ] Removed a total of 2732 redundant transitions.
[2022-06-08 23:33:26] [INFO ] Flatten gal took : 252 ms
[2022-06-08 23:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 50 ms.
[2022-06-08 23:33:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality768140403360008717.gal : 8 ms
[2022-06-08 23:33:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6251756341764174894.prop : 2 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/ReachabilityCardinality768140403360008717.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6251756341764174894.prop, --nowitness], 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/ReachabilityCardinality768140403360008717.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6251756341764174894.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6251756341764174894.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :1 after 1.81455e+06
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\_mod\_flat,6.03356e+07,2.34701,56988,1612,57,68555,691,1255,339172,128,2219,0
Total reachable state count : 60335605

Verifying 7 reachability properties.
Reachability property StigmergyElection-PT-05b-ReachabilityFireability-00 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityFireability-00,6,2.44374,56988,65,28,68555,691,1503,339172,143,2219,16554
Invariant property StigmergyElection-PT-05b-ReachabilityFireability-05 does not hold.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityFireability-05,18,2.50999,56988,100,38,68555,691,1633,339172,144,2219,30476
Invariant property StigmergyElection-PT-05b-ReachabilityFireability-07 does not hold.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityFireability-07,6,2.53595,56988,63,23,68555,691,1654,339172,144,2219,33583
Reachability property StigmergyElection-PT-05b-ReachabilityFireability-08 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityFireability-08,960,2.53714,56988,76,27,68555,691,1661,339172,144,2219,33586
Reachability property StigmergyElection-PT-05b-ReachabilityFireability-11 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityFireability-11,6,2.53856,56988,65,20,68555,691,1670,339172,144,2219,33707
Invariant property StigmergyElection-PT-05b-ReachabilityFireability-13 does not hold.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityFireability-13,2772,2.53998,56988,104,27,68555,691,1670,339172,144,2219,33876
Invariant property StigmergyElection-PT-05b-ReachabilityFireability-14 does not hold.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityFireability-14,6,2.56707,56988,65,20,68555,691,1769,339172,147,2219,40301
All properties solved without resorting to model-checking.

BK_STOP 1654731210187

--------------------
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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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 r305-smll-165463878500117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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