About the Execution of ITS-Tools for ShieldPPPt-PT-004B
| Execution Summary | |||||
| Max Memory Used (MB)  | 
      Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status  | 
   
| 3694.159 | 84316.00 | 159951.00 | 107.60 | TTTTTFFTTTFTTFTF | 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.r222-tall-165286025500591.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 itstools
    Input is ShieldPPPt-PT-004B, examination is ReachabilityFireability
    Time confinement is 3600 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 4
    Run identifier is r222-tall-165286025500591
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users  77K Apr 29 13:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users  54K Apr 29 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May  9 08:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users  24K May  9 08:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May  9 08:54 LTLFireability.txt
-rw-r--r-- 1 mcc users  18K May  9 08:54 LTLFireability.xml
-rw-r--r-- 1 mcc users  11K Apr 29 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 29 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users  42K Apr 29 13:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May  9 08:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May  9 08:54 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  74K 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 ShieldPPPt-PT-004B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654274383735
Running Version 202205111006
[2022-06-03 16:39:44] [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-03 16:39:44] [INFO   ] Parsing pnml file : /home/mcc/execution/model.pnml 
[2022-06-03 16:39:45] [INFO   ] Load time of PNML (sax parser for PT used): 89 ms 
[2022-06-03 16:39:45] [INFO   ] Transformed 315 places. 
[2022-06-03 16:39:45] [INFO   ] Transformed 287 transitions. 
[2022-06-03 16:39:45] [INFO   ] Found NUPN structural information; 
[2022-06-03 16:39:45] [INFO   ] Parsed PT model containing 315 places and 287 transitions in 195 ms. 
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000  steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 16) seen :13
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001  steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :1
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001  steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001  steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 287 rows 315 cols
[2022-06-03 16:39:45] [INFO   ] Computed 45 place invariants in 18 ms 
[2022-06-03 16:39:45] [INFO   ] [Real]Absence check using  45 positive place invariants in 13 ms returned sat 
[2022-06-03 16:39:45] [INFO   ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1 
[2022-06-03 16:39:46] [INFO   ] [Nat]Absence check using  45 positive place invariants in 18 ms returned sat 
[2022-06-03 16:39:46] [INFO   ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1 
[2022-06-03 16:39:46] [INFO   ] Deduced a trap composed of 20 places in 109 ms of which 5 ms to minimize. 
[2022-06-03 16:39:46] [INFO   ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize. 
[2022-06-03 16:39:46] [INFO   ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize. 
[2022-06-03 16:39:46] [INFO   ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize. 
[2022-06-03 16:39:46] [INFO   ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize. 
[2022-06-03 16:39:46] [INFO   ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize. 
[2022-06-03 16:39:46] [INFO   ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize. 
[2022-06-03 16:39:47] [INFO   ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1171 ms 
[2022-06-03 16:39:47] [INFO   ] After 1428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1 
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-03 16:39:47] [INFO   ] After 1613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 
Parikh walk visited 0 properties in 75 ms.
Support contains 35 out of 315 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 315/315 places, 287/287 transitions.
Drop transitions removed 48 transitions 
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 315 transition count 239
Reduce places removed 48 places and 0 transitions. 
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 58 rules applied. Total rules applied 106 place count 267 transition count 229
Reduce places removed 10 places and 0 transitions. 
Iterating post reduction 2 with 10 rules applied. Total rules applied 116 place count 257 transition count 229
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 116 place count 257 transition count 208
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions. 
Iterating global reduction 3 with 42 rules applied. Total rules applied 158 place count 236 transition count 208
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules  184 place count 210 transition count 182
Iterating global reduction 3 with 26 rules applied. Total rules applied 210 place count 210 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions 
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 212 place count 210 transition count 180
Reduce places removed 1 places and 0 transitions. 
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 209 transition count 180
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 213 place count 209 transition count 174
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions. 
Iterating global reduction 5 with 12 rules applied. Total rules applied 225 place count 203 transition count 174
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions. 
Iterating global reduction 5 with 104 rules applied. Total rules applied 329 place count 151 transition count 122
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions. 
Iterating global reduction 5 with 14 rules applied. Total rules applied 343 place count 144 transition count 122
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions 
Iterating global reduction 5 with 9 rules applied. Total rules applied 352 place count 144 transition count 122
Reduce places removed 1 places and 1 transitions. 
Iterating global reduction 5 with 1 rules applied. Total rules applied 353 place count 143 transition count 121
Applied a total of 353 rules in 89 ms. Remains 143 /315 variables (removed 172) and now considering 121/287 (removed 166) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/315 places, 121/287 transitions.
Incomplete random walk after 1000000  steps, including 3 resets, run finished after 2063 ms. (steps per millisecond=484 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001  steps, including 33 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5095305  steps, run timeout after 9001 ms. (steps per millisecond=566 ) properties seen :{}
Probabilistic random walk after 5095305  steps, saw 2013928 distinct states, run finished after 9002 ms. (steps per millisecond=566 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:00] [INFO   ] Computed 45 place invariants in 4 ms 
[2022-06-03 16:40:00] [INFO   ] [Real]Absence check using  45 positive place invariants in 6 ms returned sat 
[2022-06-03 16:40:00] [INFO   ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1 
[2022-06-03 16:40:00] [INFO   ] [Nat]Absence check using  45 positive place invariants in 5 ms returned sat 
[2022-06-03 16:40:00] [INFO   ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1 
[2022-06-03 16:40:00] [INFO   ] State equation strengthened by 9 read => feed constraints. 
[2022-06-03 16:40:00] [INFO   ] After 32ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1 
[2022-06-03 16:40:00] [INFO   ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize. 
[2022-06-03 16:40:00] [INFO   ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize. 
[2022-06-03 16:40:00] [INFO   ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize. 
[2022-06-03 16:40:00] [INFO   ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize. 
[2022-06-03 16:40:00] [INFO   ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize. 
[2022-06-03 16:40:00] [INFO   ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize. 
[2022-06-03 16:40:01] [INFO   ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize. 
[2022-06-03 16:40:01] [INFO   ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize. 
[2022-06-03 16:40:01] [INFO   ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize. 
[2022-06-03 16:40:01] [INFO   ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize. 
[2022-06-03 16:40:01] [INFO   ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize. 
[2022-06-03 16:40:01] [INFO   ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 475 ms 
[2022-06-03 16:40:01] [INFO   ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1 
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-03 16:40:01] [INFO   ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 
Parikh walk visited 0 properties in 61 ms.
Support contains 35 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 121/121 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:01] [INFO   ] Computed 45 place invariants in 0 ms 
[2022-06-03 16:40:01] [INFO   ] Implicit Places using invariants in 93 ms returned [] 
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:01] [INFO   ] Computed 45 place invariants in 1 ms 
[2022-06-03 16:40:01] [INFO   ] State equation strengthened by 9 read => feed constraints. 
[2022-06-03 16:40:01] [INFO   ] Implicit Places using invariants and state equation in 104 ms returned [] 
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-03 16:40:01] [INFO   ] Redundant transitions in 2 ms returned [] 
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:01] [INFO   ] Computed 45 place invariants in 1 ms 
[2022-06-03 16:40:01] [INFO   ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 121/121 transitions.
Incomplete random walk after 1000000  steps, including 5 resets, run finished after 1954 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001  steps, including 32 resets, run finished after 1646 ms. (steps per millisecond=607 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5282883  steps, run timeout after 9001 ms. (steps per millisecond=586 ) properties seen :{}
Probabilistic random walk after 5282883  steps, saw 2087303 distinct states, run finished after 9001 ms. (steps per millisecond=586 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:14] [INFO   ] Computed 45 place invariants in 2 ms 
[2022-06-03 16:40:14] [INFO   ] [Real]Absence check using  45 positive place invariants in 5 ms returned sat 
[2022-06-03 16:40:14] [INFO   ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1 
[2022-06-03 16:40:14] [INFO   ] [Nat]Absence check using  45 positive place invariants in 5 ms returned sat 
[2022-06-03 16:40:14] [INFO   ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1 
[2022-06-03 16:40:14] [INFO   ] State equation strengthened by 9 read => feed constraints. 
[2022-06-03 16:40:14] [INFO   ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize. 
[2022-06-03 16:40:14] [INFO   ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 449 ms 
[2022-06-03 16:40:14] [INFO   ] After 508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1 
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-03 16:40:14] [INFO   ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 
Parikh walk visited 0 properties in 52 ms.
Support contains 35 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 121/121 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:14] [INFO   ] Computed 45 place invariants in 2 ms 
[2022-06-03 16:40:14] [INFO   ] Implicit Places using invariants in 68 ms returned [] 
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:15] [INFO   ] Computed 45 place invariants in 0 ms 
[2022-06-03 16:40:15] [INFO   ] State equation strengthened by 9 read => feed constraints. 
[2022-06-03 16:40:15] [INFO   ] Implicit Places using invariants and state equation in 99 ms returned [] 
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2022-06-03 16:40:15] [INFO   ] Redundant transitions in 2 ms returned [] 
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:15] [INFO   ] Computed 45 place invariants in 1 ms 
[2022-06-03 16:40:15] [INFO   ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 121/121 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions 
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 143 transition count 121
Applied a total of 9 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:40:15] [INFO   ] Computed 45 place invariants in 1 ms 
[2022-06-03 16:40:15] [INFO   ] [Real]Absence check using  45 positive place invariants in 5 ms returned sat 
[2022-06-03 16:40:15] [INFO   ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1 
[2022-06-03 16:40:15] [INFO   ] [Nat]Absence check using  45 positive place invariants in 6 ms returned sat 
[2022-06-03 16:40:15] [INFO   ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1 
[2022-06-03 16:40:15] [INFO   ] State equation strengthened by 5 read => feed constraints. 
[2022-06-03 16:40:15] [INFO   ] After 40ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1 
[2022-06-03 16:40:15] [INFO   ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize. 
[2022-06-03 16:40:15] [INFO   ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize. 
[2022-06-03 16:40:15] [INFO   ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize. 
[2022-06-03 16:40:15] [INFO   ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize. 
[2022-06-03 16:40:15] [INFO   ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 172 ms 
[2022-06-03 16:40:15] [INFO   ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1 
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-03 16:40:15] [INFO   ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 
[2022-06-03 16:40:15] [INFO   ] Flatten gal took : 36 ms 
[2022-06-03 16:40:15] [INFO   ] Flatten gal took : 13 ms 
[2022-06-03 16:40:15] [INFO   ] Time to serialize gal into /tmp/ReachabilityCardinality1601217991824290163.gal : 7 ms 
[2022-06-03 16:40:15] [INFO   ] Time to serialize properties into /tmp/ReachabilityCardinality12522202622593901114.prop : 1 ms 
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1601217991824290163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12522202622593901114.prop' '--nowitness' '--gen-order' 'FOLLOW' 
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64  --gc-threshold  2000000  --quiet  -i  /tmp...320
Loading property file /tmp/ReachabilityCardinality12522202622593901114.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 252
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :252 after 42336
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :42336 after 130468
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :130468 after 132208
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :132208 after 135253
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :135253 after 5.80563e+06
Detected timeout of ITS tools.
[2022-06-03 16:40:30] [INFO   ] Flatten gal took : 11 ms 
[2022-06-03 16:40:30] [INFO   ] Applying decomposition  
[2022-06-03 16:40:30] [INFO   ] Flatten gal took : 10 ms 
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11232644819711181624.txt' '-o' '/tmp/graph11232644819711181624.bin' '-w' '/tmp/graph11232644819711181624.weights' 
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11232644819711181624.bin' '-l' '-1' '-v' '-w' '/tmp/graph11232644819711181624.weights' '-q' '0' '-e' '0.001' 
[2022-06-03 16:40:30] [INFO   ] Decomposing Gal with order  
[2022-06-03 16:40:31] [INFO   ] Rewriting arrays  to variables to allow decomposition. 
[2022-06-03 16:40:31] [INFO   ] Removed a total of 23 redundant transitions. 
[2022-06-03 16:40:31] [INFO   ] Flatten gal took : 42 ms 
[2022-06-03 16:40:31] [INFO   ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms. 
[2022-06-03 16:40:31] [INFO   ] Time to serialize gal into /tmp/ReachabilityCardinality14844560721826850984.gal : 4 ms 
[2022-06-03 16:40:31] [INFO   ] Time to serialize properties into /tmp/ReachabilityCardinality14665038981109501355.prop : 1 ms 
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14844560721826850984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14665038981109501355.prop' '--nowitness' 
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64  --gc-threshold  2000000  --quiet  -i  /tmp...300
Loading property file /tmp/ReachabilityCardinality14665038981109501355.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 252
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :252 after 7056
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :613872 after 1.30896e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.30896e+06 after 3.17342e+12
Detected timeout of ITS tools.
Built C files in : 
/tmp/ltsmin5138517335861031003
[2022-06-03 16:40:46] [INFO   ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5138517335861031003 
Running compilation step : cd /tmp/ltsmin5138517335861031003;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin5138517335861031003;'gcc' '-shared' '-o' 'gal.so' 'model.o' 
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5138517335861031003;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPtPT004BReachabilityFireability13==true' 
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 16:41:01] [INFO   ] Flatten gal took : 8 ms 
Using solver Z3 to compute partial order matrices.
[2022-06-03 16:41:01] [INFO   ] Applying decomposition  
Built C files in : 
/tmp/ltsmin8797593038669896033
[2022-06-03 16:41:01] [INFO   ] Computing symmetric may disable matrix : 121 transitions. 
[2022-06-03 16:41:01] [INFO   ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0) 
[2022-06-03 16:41:01] [INFO   ] Computing symmetric may enable matrix : 121 transitions. 
[2022-06-03 16:41:01] [INFO   ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0) 
[2022-06-03 16:41:01] [INFO   ] Flatten gal took : 10 ms 
[2022-06-03 16:41:01] [INFO   ] Flatten gal took : 9 ms 
[2022-06-03 16:41:01] [INFO   ] Input system was already deterministic with 121 transitions. 
[2022-06-03 16:41:01] [INFO   ] Computing Do-Not-Accords matrix : 121 transitions. 
[2022-06-03 16:41:01] [INFO   ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0) 
[2022-06-03 16:41:01] [INFO   ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8797593038669896033 
Running compilation step : cd /tmp/ltsmin8797593038669896033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15044265460718821664.txt' '-o' '/tmp/graph15044265460718821664.bin' '-w' '/tmp/graph15044265460718821664.weights' 
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15044265460718821664.bin' '-l' '-1' '-v' '-w' '/tmp/graph15044265460718821664.weights' '-q' '0' '-e' '0.001' 
[2022-06-03 16:41:01] [INFO   ] Decomposing Gal with order  
[2022-06-03 16:41:01] [INFO   ] Rewriting arrays  to variables to allow decomposition. 
[2022-06-03 16:41:01] [INFO   ] Removed a total of 39 redundant transitions. 
[2022-06-03 16:41:01] [INFO   ] Flatten gal took : 32 ms 
[2022-06-03 16:41:01] [INFO   ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms. 
[2022-06-03 16:41:01] [INFO   ] Time to serialize gal into /tmp/ReachabilityFireability16028630980492814308.gal : 3 ms 
[2022-06-03 16:41:01] [INFO   ] Time to serialize properties into /tmp/ReachabilityFireability2109754299392107133.prop : 1 ms 
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16028630980492814308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2109754299392107133.prop' '--nowitness' 
[2022-06-03 16:41:01] [INFO   ]  Ran tautology test, simplified 0 / 1 in 160 ms. 
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64  --gc-threshold  2000000  --quiet  -i  /tmp...299
Loading property file /tmp/ReachabilityFireability2109754299392107133.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 36
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 288
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :288 after 42336
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :656208 after 4.13693e+07
[2022-06-03 16:41:01] [INFO   ] BMC solution for property ShieldPPPt-PT-004B-ReachabilityFireability-13(UNSAT) depth K=0 took 132 ms 
[2022-06-03 16:41:01] [INFO   ] BMC solution for property ShieldPPPt-PT-004B-ReachabilityFireability-13(UNSAT) depth K=1 took 17 ms 
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 121 rows 143 cols
[2022-06-03 16:41:01] [INFO   ] Computed 45 place invariants in 0 ms 
[2022-06-03 16:41:01] [INFO   ] Computed 45 place invariants in 1 ms 
Compilation finished in 502 ms.
Running link step : cd /tmp/ltsmin8797593038669896033;'gcc' '-shared' '-o' 'gal.so' 'model.o' 
[2022-06-03 16:41:01] [INFO   ] BMC solution for property ShieldPPPt-PT-004B-ReachabilityFireability-13(UNSAT) depth K=2 took 233 ms 
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin8797593038669896033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT004BReachabilityFireability13==true' 
[2022-06-03 16:41:02] [INFO   ] Proved  143 variables to be positive in 1109 ms 
[2022-06-03 16:41:02] [INFO   ]  Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-004B-ReachabilityFireability-13 
[2022-06-03 16:41:02] [INFO   ] KInduction solution for property ShieldPPPt-PT-004B-ReachabilityFireability-13(SAT) depth K=0 took 48 ms 
[2022-06-03 16:41:02] [INFO   ]  Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-004B-ReachabilityFireability-13 
[2022-06-03 16:41:02] [INFO   ] KInduction solution for property ShieldPPPt-PT-004B-ReachabilityFireability-13(SAT) depth K=1 took 71 ms 
[2022-06-03 16:41:04] [INFO   ]  Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-004B-ReachabilityFireability-13 
[2022-06-03 16:41:04] [INFO   ] KInduction solution for property ShieldPPPt-PT-004B-ReachabilityFireability-13(SAT) depth K=2 took 1751 ms 
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.91736e+17,2.51697,53432,1365,63,90904,304,489,224898,72,1132,0
 Total reachable state count : 491736322441331232
Verifying 1 reachability properties.
Reachability property ShieldPPPt-PT-004B-ReachabilityFireability-13 does not hold.
FORMULA ShieldPPPt-PT-004B-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldPPPt-PT-004B-ReachabilityFireability-13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-004B-ReachabilityFireability-13,0,2.56493,53696,1,0,90904,304,556,224898,80,1132,7758
[2022-06-03 16:41:07] [WARNING] Interrupting SMT solver. 
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
	at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
	at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
	at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 16:41:07] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldPPPt-PT-004B-ReachabilityFireability-13 K-induction depth 3 
Exception in thread "Thread-10" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
	at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
	at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
	... 2 more
[2022-06-03 16:41:07] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldPPPt-PT-004B-ReachabilityFireability-13 SMT depth 3 
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
	at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
	at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
	at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
	... 2 more
[2022-06-03 16:41:07] [INFO   ] During BMC, SMT solver timed out at depth 3 
[2022-06-03 16:41:07] [INFO   ] BMC solving timed out (3600000 secs) at depth 3 
[2022-06-03 16:41:07] [INFO   ] SMT solved 0/ 1 properties. Interrupting SMT analysis. 
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 83153 ms.
BK_STOP 1654274468051
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldPPPt-PT-004B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo "    Input is ShieldPPPt-PT-004B, 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 r222-tall-165286025500591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004B.tgz
mv ShieldPPPt-PT-004B 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 ;
