About the Execution of 2021-gold for ShieldIIPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 689.668 | 70642.00 | 90081.00 | 403.30 | TTTTTTTFTTFTTTTT | normal |
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.r233-tall-165286037000036.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 ShieldIIPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037000036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 15:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 29 15:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 15:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 15:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 164K May 10 09:34 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 ShieldIIPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655068506067
Running Version 0
[2022-06-12 21:15:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:15:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:15:07] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-06-12 21:15:07] [INFO ] Transformed 603 places.
[2022-06-12 21:15:07] [INFO ] Transformed 593 transitions.
[2022-06-12 21:15:07] [INFO ] Found NUPN structural information;
[2022-06-12 21:15:07] [INFO ] Parsed PT model containing 603 places and 593 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 593 rows 603 cols
[2022-06-12 21:15:08] [INFO ] Computed 91 place invariants in 26 ms
[2022-06-12 21:15:08] [INFO ] [Real]Absence check using 91 positive place invariants in 43 ms returned sat
[2022-06-12 21:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:08] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-06-12 21:15:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:09] [INFO ] [Nat]Absence check using 91 positive place invariants in 47 ms returned sat
[2022-06-12 21:15:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:09] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2022-06-12 21:15:09] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 6 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 2 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 13 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 14 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:15:10] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:15:11] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:15:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1571 ms
[2022-06-12 21:15:11] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 34 ms.
[2022-06-12 21:15:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 21:15:13] [INFO ] [Real]Absence check using 91 positive place invariants in 29 ms returned sat
[2022-06-12 21:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:14] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-06-12 21:15:14] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:15:14] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:15:14] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:15:14] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:15:14] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:15:14] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:15:15] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 5 ms to minimize.
[2022-06-12 21:15:16] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2580 ms
[2022-06-12 21:15:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:16] [INFO ] [Nat]Absence check using 91 positive place invariants in 31 ms returned sat
[2022-06-12 21:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:17] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-06-12 21:15:17] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:15:17] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:15:17] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:15:17] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:15:17] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:15:17] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:15:17] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:15:18] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 9 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:15:19] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:15:20] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:15:21] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:15:21] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:15:21] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:15:21] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:15:21] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:15:21] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 4340 ms
[2022-06-12 21:15:21] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 39 ms.
[2022-06-12 21:15:21] [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-12 21:15:21] [INFO ] [Real]Absence check using 91 positive place invariants in 26 ms returned sat
[2022-06-12 21:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:22] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 10 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:15:22] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:15:23] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:15:23] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:15:23] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:15:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:15:23] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:15:23] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:15:23] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1271 ms
[2022-06-12 21:15:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:23] [INFO ] [Nat]Absence check using 91 positive place invariants in 27 ms returned sat
[2022-06-12 21:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:23] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-06-12 21:15:23] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:15:24] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:15:25] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:15:26] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:15:26] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:15:26] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:15:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2439 ms
[2022-06-12 21:15:26] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 30 ms.
[2022-06-12 21:15:28] [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 2
Fused 3 Parikh solutions to 1 different solutions.
Support contains 73 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 603 transition count 550
Reduce places removed 43 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 47 rules applied. Total rules applied 90 place count 560 transition count 546
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 94 place count 556 transition count 546
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 94 place count 556 transition count 503
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 180 place count 513 transition count 503
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 246 place count 447 transition count 437
Iterating global reduction 3 with 66 rules applied. Total rules applied 312 place count 447 transition count 437
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 312 place count 447 transition count 415
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 356 place count 425 transition count 415
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 594 place count 306 transition count 296
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 3 with 41 rules applied. Total rules applied 635 place count 306 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 636 place count 305 transition count 295
Applied a total of 636 rules in 175 ms. Remains 305 /603 variables (removed 298) and now considering 295/593 (removed 298) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/603 places, 295/593 transitions.
[2022-06-12 21:15:28] [INFO ] Flatten gal took : 60 ms
[2022-06-12 21:15:28] [INFO ] Flatten gal took : 24 ms
[2022-06-12 21:15:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10962925172582669905.gal : 16 ms
[2022-06-12 21:15:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11314029698617510275.prop : 1 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/ReachabilityCardinality10962925172582669905.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11314029698617510275.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/ReachabilityCardinality10962925172582669905.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11314029698617510275.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11314029698617510275.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 24
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :24 after 144
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :144 after 2304
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2304 after 27216
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.6003e+07 after 2.12475e+07
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2.12475e+07 after 2.1255e+07
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.1255e+07 after 2.1268e+07
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.1268e+07 after 2.14897e+07
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.14897e+07 after 7.01401e+07
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7.01401e+07 after 9.09179e+07
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :9.09179e+07 after 4.20815e+10
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :4.20815e+10 after 1.213e+12
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1.213e+12 after 1.15047e+13
Detected timeout of ITS tools.
[2022-06-12 21:15:43] [INFO ] Flatten gal took : 50 ms
[2022-06-12 21:15:43] [INFO ] Applying decomposition
[2022-06-12 21:15:44] [INFO ] Flatten gal took : 34 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/graph10450938458767870289.txt, -o, /tmp/graph10450938458767870289.bin, -w, /tmp/graph10450938458767870289.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/graph10450938458767870289.bin, -l, -1, -v, -w, /tmp/graph10450938458767870289.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:15:44] [INFO ] Decomposing Gal with order
[2022-06-12 21:15:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:15:44] [INFO ] Removed a total of 204 redundant transitions.
[2022-06-12 21:15:44] [INFO ] Flatten gal took : 62 ms
[2022-06-12 21:15:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 14 ms.
[2022-06-12 21:15:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9467271197017756205.gal : 9 ms
[2022-06-12 21:15:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8074975272866068884.prop : 1 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/ReachabilityCardinality9467271197017756205.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8074975272866068884.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/ReachabilityCardinality9467271197017756205.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8074975272866068884.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8074975272866068884.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 24
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :24 after 77760
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.08516e+09 after 5.02195e+10
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :5.02195e+10 after 3.89447e+16
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5743188647453526671
[2022-06-12 21:15:59] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5743188647453526671
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5743188647453526671]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5743188647453526671] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5743188647453526671] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 1298 resets, run finished after 3611 ms. (steps per millisecond=276 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 187 resets, run finished after 2610 ms. (steps per millisecond=383 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 103 resets, run finished after 1423 ms. (steps per millisecond=702 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 117 resets, run finished after 1888 ms. (steps per millisecond=529 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 295 rows 305 cols
[2022-06-12 21:16:09] [INFO ] Computed 91 place invariants in 12 ms
[2022-06-12 21:16:10] [INFO ] [Real]Absence check using 91 positive place invariants in 18 ms returned sat
[2022-06-12 21:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:10] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 494 ms
[2022-06-12 21:16:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 13 ms returned sat
[2022-06-12 21:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:10] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 950 ms
[2022-06-12 21:16:11] [INFO ] Computed and/alt/rep : 280/998/280 causal constraints (skipped 2 transitions) in 19 ms.
[2022-06-12 21:16:12] [INFO ] Added : 165 causal constraints over 33 iterations in 928 ms. Result :unsat
[2022-06-12 21:16:12] [INFO ] [Real]Absence check using 91 positive place invariants in 14 ms returned sat
[2022-06-12 21:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:12] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 465 ms
[2022-06-12 21:16:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:13] [INFO ] [Nat]Absence check using 91 positive place invariants in 17 ms returned sat
[2022-06-12 21:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:13] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 750 ms
[2022-06-12 21:16:14] [INFO ] Computed and/alt/rep : 280/998/280 causal constraints (skipped 2 transitions) in 14 ms.
[2022-06-12 21:16:15] [INFO ] Added : 214 causal constraints over 45 iterations in 1474 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1655068576709
--------------------
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="ShieldIIPs-PT-010B"
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 ShieldIIPs-PT-010B, 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 r233-tall-165286037000036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B 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 '
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 ;