Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:45 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.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 13:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 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 185K 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-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655073697769

Running Version 0
[2022-06-12 22:41:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:41:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:41:39] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2022-06-12 22:41:39] [INFO ] Transformed 783 places.
[2022-06-12 22:41:39] [INFO ] Transformed 713 transitions.
[2022-06-12 22:41:39] [INFO ] Found NUPN structural information;
[2022-06-12 22:41:39] [INFO ] Parsed PT model containing 783 places and 713 transitions in 223 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 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :12
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 713 rows 783 cols
[2022-06-12 22:41:39] [INFO ] Computed 111 place invariants in 30 ms
[2022-06-12 22:41:40] [INFO ] [Real]Absence check using 111 positive place invariants in 51 ms returned sat
[2022-06-12 22:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:40] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2022-06-12 22:41:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:41:40] [INFO ] [Nat]Absence check using 111 positive place invariants in 38 ms returned sat
[2022-06-12 22:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:40] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-06-12 22:41:41] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 6 ms to minimize.
[2022-06-12 22:41:41] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 2 ms to minimize.
[2022-06-12 22:41:41] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2022-06-12 22:41:41] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2022-06-12 22:41:41] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:41:42] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:41:42] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:41:42] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:41:42] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:41:42] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:41:42] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:41:42] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2022-06-12 22:41:43] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-06-12 22:41:44] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:41:44] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2022-06-12 22:41:44] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-06-12 22:41:44] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2022-06-12 22:41:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-06-12 22:41:44] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3419 ms
[2022-06-12 22:41:44] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 39 ms.
[2022-06-12 22:41:45] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2022-06-12 22:41:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 22:41:46] [INFO ] [Real]Absence check using 111 positive place invariants in 36 ms returned sat
[2022-06-12 22:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:46] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2022-06-12 22:41:46] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:41:46] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:41:46] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2022-06-12 22:41:46] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:41:46] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:41:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2022-06-12 22:41:48] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2022-06-12 22:41:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2022-06-12 22:41:48] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:41:48] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2022-06-12 22:41:48] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2022-06-12 22:41:48] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2143 ms
[2022-06-12 22:41:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:41:48] [INFO ] [Nat]Absence check using 111 positive place invariants in 35 ms returned sat
[2022-06-12 22:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:48] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2022-06-12 22:41:48] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2022-06-12 22:41:49] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2022-06-12 22:41:50] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2101 ms
[2022-06-12 22:41:50] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 41 ms.
[2022-06-12 22:41:53] [INFO ] Added : 285 causal constraints over 57 iterations in 2545 ms. Result :unknown
[2022-06-12 22:41:53] [INFO ] [Real]Absence check using 111 positive place invariants in 40 ms returned unsat
[2022-06-12 22:41:53] [INFO ] [Real]Absence check using 111 positive place invariants in 44 ms returned sat
[2022-06-12 22:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:54] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2022-06-12 22:41:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:41:54] [INFO ] [Nat]Absence check using 111 positive place invariants in 46 ms returned sat
[2022-06-12 22:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:55] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2022-06-12 22:41:55] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2022-06-12 22:41:55] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2022-06-12 22:41:55] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 3 ms to minimize.
[2022-06-12 22:41:55] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 10 ms to minimize.
[2022-06-12 22:41:55] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-06-12 22:41:56] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-06-12 22:41:57] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1760 ms
[2022-06-12 22:41:57] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 31 ms.
[2022-06-12 22:41:59] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2022-06-12 22:41:59] [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
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 56400 steps, including 206 resets, run finished after 206 ms. (steps per millisecond=273 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 783 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 783 transition count 526
Reduce places removed 187 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 189 rules applied. Total rules applied 376 place count 596 transition count 524
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 379 place count 595 transition count 522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 381 place count 593 transition count 522
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 381 place count 593 transition count 481
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 463 place count 552 transition count 481
Discarding 67 places :
Symmetric choice reduction at 4 with 67 rule applications. Total rules 530 place count 485 transition count 414
Iterating global reduction 4 with 67 rules applied. Total rules applied 597 place count 485 transition count 414
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 597 place count 485 transition count 386
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 653 place count 457 transition count 386
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 993 place count 287 transition count 216
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 1045 place count 261 transition count 216
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1046 place count 261 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1047 place count 260 transition count 215
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 1076 place count 260 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 259 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1078 place count 258 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1078 place count 258 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1082 place count 256 transition count 212
Applied a total of 1082 rules in 198 ms. Remains 256 /783 variables (removed 527) and now considering 212/713 (removed 501) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/783 places, 212/713 transitions.
[2022-06-12 22:42:00] [INFO ] Flatten gal took : 55 ms
[2022-06-12 22:42:00] [INFO ] Flatten gal took : 20 ms
[2022-06-12 22:42:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10657521061518114615.gal : 11 ms
[2022-06-12 22:42:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16223648724233558726.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/ReachabilityCardinality10657521061518114615.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16223648724233558726.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/ReachabilityCardinality10657521061518114615.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16223648724233558726.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16223648724233558726.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 27
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 65
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :65 after 133
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :133 after 546
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :546 after 6298
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6298 after 190415
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :190415 after 1.58976e+06
Reachability property ShieldPPPt-PT-010B-ReachabilityFireability-08 is true.
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.58976e+06 after 4.84273e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.84273e+08 after 5.31294e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.31294e+09 after 7.12424e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.12424e+10 after 7.73789e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.73789e+13 after 2.43668e+17
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.43668e+17 after 1.62211e+24
Detected timeout of ITS tools.
[2022-06-12 22:42:15] [INFO ] Flatten gal took : 18 ms
[2022-06-12 22:42:15] [INFO ] Applying decomposition
[2022-06-12 22:42:15] [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/graph17902608409447336791.txt, -o, /tmp/graph17902608409447336791.bin, -w, /tmp/graph17902608409447336791.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/graph17902608409447336791.bin, -l, -1, -v, -w, /tmp/graph17902608409447336791.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:42:15] [INFO ] Decomposing Gal with order
[2022-06-12 22:42:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:42:15] [INFO ] Removed a total of 131 redundant transitions.
[2022-06-12 22:42:15] [INFO ] Flatten gal took : 55 ms
[2022-06-12 22:42:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 9 ms.
[2022-06-12 22:42:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15620226454994513090.gal : 7 ms
[2022-06-12 22:42:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13246559907922397180.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/ReachabilityCardinality15620226454994513090.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13246559907922397180.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/ReachabilityCardinality15620226454994513090.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13246559907922397180.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13246559907922397180.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 9.83609e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5540265600244156855
[2022-06-12 22:42:30] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5540265600244156855
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/ltsmin5540265600244156855]
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/ltsmin5540265600244156855] 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/ltsmin5540265600244156855] 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)
Finished random walk after 1192 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=56 )
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655073752718

--------------------
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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is ShieldPPPt-PT-010B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037300234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-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 ;