Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978500135.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 256K Mar 5 18:23 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 ShieldRVs-PT-040A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679342384166

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:59:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:59:45] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-20 19:59:45] [INFO ] Transformed 563 places.
[2023-03-20 19:59:45] [INFO ] Transformed 763 transitions.
[2023-03-20 19:59:45] [INFO ] Found NUPN structural information;
[2023-03-20 19:59:45] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 19:59:46] [INFO ] Computed 161 place invariants in 20 ms
[2023-03-20 19:59:47] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 19:59:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 73 ms returned sat
[2023-03-20 19:59:48] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-20 19:59:49] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 10 ms to minimize.
[2023-03-20 19:59:49] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:59:49] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-20 19:59:50] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-20 19:59:50] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:59:50] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-20 19:59:50] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2023-03-20 19:59:50] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2023-03-20 19:59:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1249 ms
[2023-03-20 19:59:50] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-20 19:59:51] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2023-03-20 19:59:51] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-20 19:59:51] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:59:51] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:59:51] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:59:51] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-20 19:59:51] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:59:52] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2023-03-20 19:59:52] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2023-03-20 19:59:52] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-03-20 19:59:52] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:59:52] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2023-03-20 19:59:52] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:59:53] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-20 19:59:54] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:59:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:59:56] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:59:56] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-20 19:59:56] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2023-03-20 19:59:56] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-20 19:59:56] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2023-03-20 19:59:56] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:59:56] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-20 19:59:57] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:59:57] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2023-03-20 19:59:57] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 14 ms to minimize.
[2023-03-20 19:59:57] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:59:57] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:59:57] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-20 19:59:57] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:59:58] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2023-03-20 19:59:59] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2023-03-20 19:59:59] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2023-03-20 19:59:59] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:59:59] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2023-03-20 19:59:59] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-20 19:59:59] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-03-20 20:00:00] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:00:00] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-20 20:00:00] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-20 20:00:00] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-20 20:00:00] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2023-03-20 20:00:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9838 ms
[2023-03-20 20:00:00] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 9839 ms
[2023-03-20 20:00:00] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:00:01] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-20 20:00:01] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-20 20:00:01] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2023-03-20 20:00:01] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-20 20:00:01] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-20 20:00:02] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-20 20:00:02] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-20 20:00:02] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:00:02] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:00:02] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2023-03-20 20:00:02] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-20 20:00:03] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:00:03] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:00:03] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:00:03] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-20 20:00:03] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:00:03] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:00:04] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:00:04] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2023-03-20 20:00:04] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-20 20:00:04] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:00:04] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:00:05] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:00:05] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2023-03-20 20:00:05] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:00:05] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:00:05] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-20 20:00:05] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-20 20:00:05] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:00:06] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2023-03-20 20:00:06] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2023-03-20 20:00:06] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-20 20:00:06] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2023-03-20 20:00:06] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-20 20:00:06] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-20 20:00:06] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-20 20:00:07] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2023-03-20 20:00:07] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2023-03-20 20:00:07] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-20 20:00:07] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 6573 ms
[2023-03-20 20:00:07] [INFO ] After 19636ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 1177 ms.
[2023-03-20 20:00:08] [INFO ] After 21094ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 161 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 54 place count 562 transition count 762
Applied a total of 54 rules in 157 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
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 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 20:00:09] [INFO ] Computed 161 place invariants in 12 ms
[2023-03-20 20:00:09] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:00:09] [INFO ] [Nat]Absence check using 161 positive place invariants in 73 ms returned sat
[2023-03-20 20:00:10] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:00:11] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-20 20:00:11] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-20 20:00:11] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-03-20 20:00:11] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-20 20:00:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 528 ms
[2023-03-20 20:00:12] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-20 20:00:12] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:00:12] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-20 20:00:12] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:00:13] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 20:00:13] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:00:13] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2023-03-20 20:00:13] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-20 20:00:13] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:00:14] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:00:14] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 20:00:14] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:00:14] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-20 20:00:14] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:00:14] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:00:15] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-20 20:00:15] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:00:15] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 6 ms to minimize.
[2023-03-20 20:00:15] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-20 20:00:15] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:00:16] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-20 20:00:16] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-20 20:00:16] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:00:16] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:00:16] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:00:17] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:00:17] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:00:17] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2023-03-20 20:00:17] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:00:17] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:00:18] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 20:00:18] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2023-03-20 20:00:18] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-20 20:00:18] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:00:18] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:00:19] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2023-03-20 20:00:19] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2023-03-20 20:00:19] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:00:19] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:00:19] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:00:19] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:00:20] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:00:20] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:00:20] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:00:20] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-20 20:00:20] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2023-03-20 20:00:20] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-20 20:00:21] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2023-03-20 20:00:21] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-20 20:00:21] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:00:21] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:00:21] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:00:21] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:00:22] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:00:22] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:00:22] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:00:22] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:00:22] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-20 20:00:23] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-20 20:00:23] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:00:23] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:00:23] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:00:23] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-20 20:00:23] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:00:24] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:00:24] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:00:24] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-20 20:00:24] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2023-03-20 20:00:24] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:00:25] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:00:25] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:00:25] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:00:25] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:00:25] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:00:26] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:00:26] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:00:26] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:00:26] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:00:26] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2023-03-20 20:00:27] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:00:27] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2023-03-20 20:00:27] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:00:27] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2023-03-20 20:00:27] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:00:27] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:00:28] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:00:28] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 0 ms to minimize.
[2023-03-20 20:00:28] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:00:28] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:00:28] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2023-03-20 20:00:29] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:00:29] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-20 20:00:29] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:00:29] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:00:29] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2023-03-20 20:00:29] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-20 20:00:29] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2023-03-20 20:00:30] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:00:30] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2023-03-20 20:00:30] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-20 20:00:30] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 20:00:30] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:00:30] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:00:30] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:00:31] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:00:31] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:00:31] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-20 20:00:31] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2023-03-20 20:00:31] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-20 20:00:31] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:00:32] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2023-03-20 20:00:32] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-20 20:00:32] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:00:32] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:00:32] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:00:32] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2023-03-20 20:00:32] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:00:33] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:00:33] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-20 20:00:33] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:00:33] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2023-03-20 20:00:33] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:00:33] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:00:33] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:00:34] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2023-03-20 20:00:34] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2023-03-20 20:00:34] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2023-03-20 20:00:34] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:00:34] [INFO ] Trap strengthening (SAT) tested/added 128/128 trap constraints in 22497 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 20:00:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:00:34] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 86 ms.
Support contains 160 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 37 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 253849 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253849 steps, saw 56688 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 20:00:38] [INFO ] Invariant cache hit.
[2023-03-20 20:00:38] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:00:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 18 ms returned sat
[2023-03-20 20:00:39] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:00:39] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-20 20:00:40] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-20 20:00:40] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-20 20:00:40] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2023-03-20 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 587 ms
[2023-03-20 20:00:40] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 0 ms to minimize.
[2023-03-20 20:00:41] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:00:41] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:00:41] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:00:41] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:00:41] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:00:42] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:00:42] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-20 20:00:42] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-20 20:00:42] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2023-03-20 20:00:43] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:00:43] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:00:43] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-20 20:00:43] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:00:44] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-20 20:00:44] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:00:44] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:00:44] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2023-03-20 20:00:44] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 0 ms to minimize.
[2023-03-20 20:00:45] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:00:45] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:00:45] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-20 20:00:45] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:00:45] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:00:46] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:00:46] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:00:46] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:00:46] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 20:00:46] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:00:46] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-03-20 20:00:47] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:00:47] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:00:47] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:00:47] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2023-03-20 20:00:47] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:00:48] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:00:48] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:00:48] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:00:48] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:00:48] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:00:49] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:00:49] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2023-03-20 20:00:49] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:00:49] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:00:49] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:00:49] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-20 20:00:50] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:00:50] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2023-03-20 20:00:50] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:00:50] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-20 20:00:50] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:00:50] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:00:51] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:00:51] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:00:51] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:00:51] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2023-03-20 20:00:51] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:00:52] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:00:52] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:00:52] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:00:52] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2023-03-20 20:00:52] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2023-03-20 20:00:53] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:00:53] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:00:53] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:00:53] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:00:53] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:00:54] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-20 20:00:54] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:00:54] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:00:54] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:00:54] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2023-03-20 20:00:55] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2023-03-20 20:00:55] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:00:55] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2023-03-20 20:00:55] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:00:55] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:00:55] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:00:56] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:00:56] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-20 20:00:56] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:00:56] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:00:56] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:00:57] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:00:57] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2023-03-20 20:00:57] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 0 ms to minimize.
[2023-03-20 20:00:57] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2023-03-20 20:00:57] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:00:58] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:00:58] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2023-03-20 20:00:58] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2023-03-20 20:00:58] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:00:58] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:00:59] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:00:59] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:00:59] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2023-03-20 20:00:59] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2023-03-20 20:00:59] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:00:59] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:01:00] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:01:00] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:01:00] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:01:00] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:01:00] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:01:01] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:01:01] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:01:01] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:01:01] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:01:01] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2023-03-20 20:01:01] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:01:02] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:01:02] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2023-03-20 20:01:02] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:01:02] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:01:03] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-20 20:01:03] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:01:03] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:01:03] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 20:01:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:01:03] [INFO ] After 25173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 78 ms.
Support contains 160 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 31 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 28 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2023-03-20 20:01:03] [INFO ] Invariant cache hit.
[2023-03-20 20:01:04] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-20 20:01:04] [INFO ] Invariant cache hit.
[2023-03-20 20:01:04] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2023-03-20 20:01:04] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-20 20:01:04] [INFO ] Invariant cache hit.
[2023-03-20 20:01:05] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1618 ms. Remains : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-20 20:01:05] [INFO ] Invariant cache hit.
[2023-03-20 20:01:05] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:01:05] [INFO ] [Nat]Absence check using 161 positive place invariants in 17 ms returned sat
[2023-03-20 20:01:06] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:01:06] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-20 20:01:07] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-20 20:01:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-20 20:01:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2023-03-20 20:01:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 376 ms
[2023-03-20 20:01:07] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:01:07] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-20 20:01:08] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-20 20:01:08] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-20 20:01:08] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:01:08] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-20 20:01:08] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:01:09] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:01:09] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-20 20:01:09] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-20 20:01:09] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-20 20:01:10] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:01:10] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:01:10] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-20 20:01:10] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:01:10] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:01:10] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:01:11] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:01:11] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2023-03-20 20:01:11] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:01:11] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-20 20:01:11] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-20 20:01:11] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-20 20:01:11] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:01:12] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-20 20:01:12] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:01:12] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:01:12] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-20 20:01:12] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2023-03-20 20:01:12] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:01:13] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:01:13] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:01:13] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:01:13] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:01:13] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:01:13] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2023-03-20 20:01:14] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:01:14] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:01:14] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2023-03-20 20:01:14] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:01:14] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:01:15] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2023-03-20 20:01:15] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-20 20:01:15] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2023-03-20 20:01:15] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2023-03-20 20:01:15] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:01:15] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:01:16] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 1 ms to minimize.
[2023-03-20 20:01:16] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:01:16] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2023-03-20 20:01:16] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:01:16] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:01:17] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:01:17] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:01:17] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:01:17] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-20 20:01:17] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2023-03-20 20:01:18] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:01:18] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 4 ms to minimize.
[2023-03-20 20:01:18] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2023-03-20 20:01:18] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:01:18] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-20 20:01:18] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:01:19] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:01:19] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-20 20:01:19] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:01:19] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:01:19] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2023-03-20 20:01:19] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:01:20] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-20 20:01:20] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:01:20] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:01:20] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-20 20:01:20] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:01:20] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:01:21] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-20 20:01:21] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:01:21] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:01:21] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2023-03-20 20:01:21] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-03-20 20:01:21] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:01:21] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2023-03-20 20:01:22] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2023-03-20 20:01:22] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:01:22] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2023-03-20 20:01:22] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2023-03-20 20:01:22] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2023-03-20 20:01:22] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2023-03-20 20:01:22] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-20 20:01:23] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-20 20:01:23] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2023-03-20 20:01:23] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:01:23] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:01:23] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:01:23] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2023-03-20 20:01:24] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:01:24] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:01:24] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:01:24] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:01:24] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-20 20:01:25] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:01:25] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2023-03-20 20:01:25] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:01:25] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:01:25] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:01:26] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:01:26] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:01:26] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:01:26] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:01:26] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:01:27] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:01:27] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-20 20:01:27] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2023-03-20 20:01:27] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:01:28] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 0 ms to minimize.
[2023-03-20 20:01:28] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-20 20:01:28] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:01:28] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-20 20:01:29] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:01:29] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:01:29] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:01:29] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:01:30] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:01:30] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2023-03-20 20:01:30] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2023-03-20 20:01:30] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:01:30] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:01:31] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:01:31] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:01:31] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:01:31] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:01:31] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2023-03-20 20:01:32] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:01:32] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:01:32] [INFO ] Trap strengthening (SAT) tested/added 135/134 trap constraints in 25052 ms
[2023-03-20 20:01:32] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:01:33] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:01:33] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-20 20:01:33] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:01:33] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:01:33] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2023-03-20 20:01:34] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:01:34] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:01:34] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:01:34] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:01:35] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 20:01:35] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-20 20:01:35] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:01:35] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:01:35] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-03-20 20:01:35] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:01:36] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 20:01:36] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:01:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2023-03-20 20:01:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-20 20:01:36] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-20 20:01:36] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-20 20:01:36] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-20 20:01:37] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:01:37] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-20 20:01:37] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-20 20:01:37] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-20 20:01:37] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 13 ms to minimize.
[2023-03-20 20:01:37] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4865 ms
[2023-03-20 20:01:37] [INFO ] After 31987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 999 ms.
[2023-03-20 20:01:38] [INFO ] After 33122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 20:01:38] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 20:01:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 762 transitions and 3782 arcs took 13 ms.
[2023-03-20 20:01:39] [INFO ] Flatten gal took : 170 ms
Total runtime 113361 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVs_PT_040A
(NrP: 562 NrTr: 762 NrArc: 3782)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.044sec

net check time: 0m 0.000sec

init dd package: 0m 3.237sec


before gc: list nodes free: 852293

after gc: idd nodes used:21750, unused:63978250; list nodes free:285109798

before gc: list nodes free: 762870

after gc: idd nodes used:23488, unused:63976512; list nodes free:285102005

before gc: list nodes free: 165032

after gc: idd nodes used:24664, unused:63975336; list nodes free:285096462

before gc: list nodes free: 356541

after gc: idd nodes used:25926, unused:63974074; list nodes free:285090337

before gc: list nodes free: 316743

after gc: idd nodes used:26378, unused:63973622; list nodes free:285088326

before gc: list nodes free: 211912

after gc: idd nodes used:25138, unused:63974862; list nodes free:285093860

before gc: list nodes free: 1991649

after gc: idd nodes used:27831, unused:63972169; list nodes free:287178318

before gc: list nodes free: 1608770

after gc: idd nodes used:27049, unused:63972951; list nodes free:287181942

before gc: list nodes free: 1515327

after gc: idd nodes used:28227, unused:63971773; list nodes free:287176751

before gc: list nodes free: 2173955

after gc: idd nodes used:27461, unused:63972539; list nodes free:287179995

before gc: list nodes free: 2441974

after gc: idd nodes used:27921, unused:63972079; list nodes free:287177742

before gc: list nodes free: 2452587

after gc: idd nodes used:27796, unused:63972204; list nodes free:287178545

before gc: list nodes free: 1821867

after gc: idd nodes used:30854, unused:63969146; list nodes free:287164357

before gc: list nodes free: 1591024

after gc: idd nodes used:29665, unused:63970335; list nodes free:287169951

before gc: list nodes free: 1338605

after gc: idd nodes used:27737, unused:63972263; list nodes free:287178678

before gc: list nodes free: 2039731

after gc: idd nodes used:29804, unused:63970196; list nodes free:287169195

before gc: list nodes free: 2470286

after gc: idd nodes used:29665, unused:63970335; list nodes free:287170145
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6227340 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098740 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

15371 15679 18952 19511 21459 22242 21643 21392 21592 23719 21318 22916 23794 24081 22889 23582 24263 21950 22493 23922 24313 24084 24508 25343 24467 25144 25261 25237 25475 23528 23150 23478 23653 24630 25238 25387 25411 23511 23656 23943 27261 25882 25933 23885 24794 26065 26102 28668 28339 26515 25690 27426 26708 26875 26666 26816 26874 24539 26884 27362 26560 28428 27667 27798 27815 27467 27633 27193 26966 25393 25686 26142 28646 27761 28587 26863 27684 28778 28485 29021 28483 29542 28916 28985 30395 28384 28725 29377 30278 26731 28413 29071 28748 29888 29713 30410 29658 29724 29183 29597 28793 28478 28446 27435 29461 29547 30849 27617 28184 29577 29971 29229 29600 30485 29466 29321 29854 29165 29369 29748 29987 28347 27830 29596 29274 29686 29911 30492 30668 30148 29698 30272 29360 28885 28717 27426 30364 29682 29813 29351 28092 29942 30622 29266 30012 30315 29239 31638 30526 29790 29665 29755 29663 29176 29370 29594 29765 30027 30493 31065 30842 30157 31214 30324 29557 27788 27818 28154 29506 30190 30129 30608 28101 28137 30288 28840 30599 30753 29986 29794 30361 29653 29947 29730 30612 28423 28266 29401 29931 29395 31480 30443 30234 30061 29935 30250 30260 29211

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="ShieldRVs-PT-040A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVs-PT-040A, 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 r426-tajo-167905978500135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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