Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205100431.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 167K May 5 16:52 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 ShieldIIPt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621100943411

Running Version 0
[2021-05-15 17:49:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 17:49:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 17:49:07] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2021-05-15 17:49:07] [INFO ] Transformed 703 places.
[2021-05-15 17:49:07] [INFO ] Transformed 653 transitions.
[2021-05-15 17:49:07] [INFO ] Found NUPN structural information;
[2021-05-15 17:49:07] [INFO ] Parsed PT model containing 703 places and 653 transitions in 195 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 16) seen :11
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 653 rows 703 cols
[2021-05-15 17:49:07] [INFO ] Computed 91 place invariants in 26 ms
[2021-05-15 17:49:08] [INFO ] [Real]Absence check using 91 positive place invariants in 35 ms returned sat
[2021-05-15 17:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:08] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2021-05-15 17:49:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 17:49:09] [INFO ] [Nat]Absence check using 91 positive place invariants in 136 ms returned sat
[2021-05-15 17:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:09] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-15 17:49:09] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 4 ms to minimize.
[2021-05-15 17:49:10] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2021-05-15 17:49:10] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2021-05-15 17:49:10] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2021-05-15 17:49:10] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2021-05-15 17:49:10] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2021-05-15 17:49:10] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2021-05-15 17:49:11] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2021-05-15 17:49:11] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2021-05-15 17:49:11] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2021-05-15 17:49:11] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2021-05-15 17:49:11] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2021-05-15 17:49:11] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 0 ms to minimize.
[2021-05-15 17:49:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2177 ms
[2021-05-15 17:49:11] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-15 17:49:14] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2021-05-15 17:49:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-15 17:49:14] [INFO ] [Real]Absence check using 91 positive place invariants in 26 ms returned sat
[2021-05-15 17:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:14] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-05-15 17:49:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 17:49:15] [INFO ] [Nat]Absence check using 91 positive place invariants in 33 ms returned sat
[2021-05-15 17:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:15] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2021-05-15 17:49:15] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2021-05-15 17:49:15] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2021-05-15 17:49:15] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2021-05-15 17:49:16] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2021-05-15 17:49:17] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2021-05-15 17:49:17] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2021-05-15 17:49:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1528 ms
[2021-05-15 17:49:17] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 33 ms.
[2021-05-15 17:49:19] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2021-05-15 17:49:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-15 17:49:20] [INFO ] [Real]Absence check using 91 positive place invariants in 26 ms returned sat
[2021-05-15 17:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:20] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-15 17:49:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 17:49:20] [INFO ] [Nat]Absence check using 91 positive place invariants in 26 ms returned sat
[2021-05-15 17:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:20] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-15 17:49:20] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2021-05-15 17:49:21] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2021-05-15 17:49:21] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 0 ms to minimize.
[2021-05-15 17:49:21] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2021-05-15 17:49:21] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 5 ms to minimize.
[2021-05-15 17:49:21] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2021-05-15 17:49:22] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2021-05-15 17:49:22] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2021-05-15 17:49:22] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 0 ms to minimize.
[2021-05-15 17:49:22] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2021-05-15 17:49:22] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2021-05-15 17:49:22] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2021-05-15 17:49:23] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2021-05-15 17:49:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2398 ms
[2021-05-15 17:49:23] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 41 ms.
[2021-05-15 17:49:25] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2021-05-15 17:49:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 17:49:25] [INFO ] [Real]Absence check using 91 positive place invariants in 27 ms returned sat
[2021-05-15 17:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:25] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-15 17:49:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 17:49:26] [INFO ] [Nat]Absence check using 91 positive place invariants in 25 ms returned sat
[2021-05-15 17:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 17:49:26] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-15 17:49:26] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2021-05-15 17:49:26] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2021-05-15 17:49:26] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2021-05-15 17:49:26] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 7 ms to minimize.
[2021-05-15 17:49:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2021-05-15 17:49:28] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2608 ms
[2021-05-15 17:49:28] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 49 ms.
[2021-05-15 17:49:31] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 9 ms to minimize.
[2021-05-15 17:49:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Fused 4 Parikh solutions to 1 different solutions.
Support contains 30 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 703 transition count 502
Reduce places removed 151 places and 0 transitions.
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 1 with 153 rules applied. Total rules applied 304 place count 552 transition count 500
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 310 place count 551 transition count 495
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 315 place count 546 transition count 495
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 315 place count 546 transition count 451
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 403 place count 502 transition count 451
Discarding 64 places :
Symmetric choice reduction at 4 with 64 rule applications. Total rules 467 place count 438 transition count 387
Iterating global reduction 4 with 64 rules applied. Total rules applied 531 place count 438 transition count 387
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 531 place count 438 transition count 360
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 585 place count 411 transition count 360
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 4 with 304 rules applied. Total rules applied 889 place count 259 transition count 208
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 939 place count 234 transition count 222
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 940 place count 234 transition count 221
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 941 place count 234 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 942 place count 233 transition count 220
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 952 place count 233 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 953 place count 232 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 955 place count 230 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 955 place count 230 transition count 218
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 957 place count 229 transition count 218
Applied a total of 957 rules in 186 ms. Remains 229 /703 variables (removed 474) and now considering 218/653 (removed 435) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/703 places, 218/653 transitions.
[2021-05-15 17:49:31] [INFO ] Flatten gal took : 54 ms
[2021-05-15 17:49:31] [INFO ] Flatten gal took : 20 ms
[2021-05-15 17:49:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16572849834785854144.gal : 10 ms
[2021-05-15 17:49:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2892365945389165616.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16572849834785854144.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2892365945389165616.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16572849834785854144.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2892365945389165616.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2892365945389165616.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 88
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :88 after 396
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :396 after 157432
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :157432 after 161250
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :161250 after 246427
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :246427 after 1.31817e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.31817e+06 after 2.88881e+08
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.88881e+08 after 2.55954e+09
Detected timeout of ITS tools.
[2021-05-15 17:49:46] [INFO ] Flatten gal took : 17 ms
[2021-05-15 17:49:46] [INFO ] Applying decomposition
[2021-05-15 17:49:46] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18224314099681927479.txt, -o, /tmp/graph18224314099681927479.bin, -w, /tmp/graph18224314099681927479.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18224314099681927479.bin, -l, -1, -v, -w, /tmp/graph18224314099681927479.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:49:46] [INFO ] Decomposing Gal with order
[2021-05-15 17:49:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:49:46] [INFO ] Removed a total of 171 redundant transitions.
[2021-05-15 17:49:46] [INFO ] Flatten gal took : 56 ms
[2021-05-15 17:49:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 11 ms.
[2021-05-15 17:49:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6376480784716825932.gal : 8 ms
[2021-05-15 17:49:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14938892558765267830.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6376480784716825932.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14938892558765267830.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6376480784716825932.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14938892558765267830.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14938892558765267830.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :11 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 11880
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-11 is true.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2.70864e+06 after 6.22052e+15
Invariant property ShieldIIPt-PT-010B-ReachabilityFireability-14 does not hold.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-10 is true.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6.22052e+15 after 2.88578e+20
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13298752661969576237
[2021-05-15 17:50:03] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13298752661969576237
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13298752661969576237]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13298752661969576237] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13298752661969576237] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3947 ms. (steps per millisecond=253 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1679 ms. (steps per millisecond=595 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9196194 steps, run timeout after 30001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 9196194 steps, saw 5098079 distinct states, run finished after 30004 ms. (steps per millisecond=306 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 229 cols
[2021-05-15 17:50:46] [INFO ] Computed 89 place invariants in 4 ms
[2021-05-15 17:50:46] [INFO ] [Real]Absence check using 89 positive place invariants in 11 ms returned sat
[2021-05-15 17:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 17:50:47] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-15 17:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 17:50:47] [INFO ] [Nat]Absence check using 89 positive place invariants in 11 ms returned sat
[2021-05-15 17:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 17:50:47] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-15 17:50:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2021-05-15 17:50:47] [INFO ] [Nat]Added 24 Read/Feed constraints in 16 ms returned sat
[2021-05-15 17:50:47] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 11 ms to minimize.
[2021-05-15 17:50:47] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2021-05-15 17:50:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2021-05-15 17:50:47] [INFO ] Computed and/alt/rep : 206/536/206 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-15 17:50:49] [INFO ] Added : 192 causal constraints over 41 iterations in 2000 ms. Result :unsat
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1621101050563

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205100431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;