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.r046-smll-165252115900179.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 DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.2K Apr 29 15:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 15:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 29 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 15:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 15:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 91K May 10 09:33 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 DES-PT-20b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655072414764

Running Version 0
[2022-06-12 22:20:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:20:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:20:18] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2022-06-12 22:20:18] [INFO ] Transformed 360 places.
[2022-06-12 22:20:18] [INFO ] Transformed 311 transitions.
[2022-06-12 22:20:18] [INFO ] Found NUPN structural information;
[2022-06-12 22:20:18] [INFO ] Parsed PT model containing 360 places and 311 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 15) seen :4
FORMULA DES-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 311 rows 360 cols
[2022-06-12 22:20:18] [INFO ] Computed 65 place invariants in 53 ms
[2022-06-12 22:20:19] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2022-06-12 22:20:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2022-06-12 22:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:19] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-06-12 22:20:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:19] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-06-12 22:20:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 24 ms returned sat
[2022-06-12 22:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:20] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-06-12 22:20:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:20] [INFO ] [Real]Absence check using 39 positive place invariants in 26 ms returned sat
[2022-06-12 22:20:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 29 ms returned sat
[2022-06-12 22:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:20] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-06-12 22:20:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:21] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2022-06-12 22:20:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2022-06-12 22:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:21] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2022-06-12 22:20:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:21] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2022-06-12 22:20:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2022-06-12 22:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:22] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-06-12 22:20:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:22] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2022-06-12 22:20:22] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2022-06-12 22:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:23] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2022-06-12 22:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:23] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2022-06-12 22:20:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2022-06-12 22:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:23] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2022-06-12 22:20:23] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 8 ms to minimize.
[2022-06-12 22:20:24] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 2 ms to minimize.
[2022-06-12 22:20:24] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 2 ms to minimize.
[2022-06-12 22:20:24] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 3 ms to minimize.
[2022-06-12 22:20:24] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 2 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 2 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:20:26] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:20:26] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2022-06-12 22:20:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2508 ms
[2022-06-12 22:20:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 35 ms returned sat
[2022-06-12 22:20:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 61 ms returned sat
[2022-06-12 22:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:26] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2022-06-12 22:20:26] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:20:27] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:20:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2022-06-12 22:20:27] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 31 ms.
[2022-06-12 22:20:30] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2022-06-12 22:20:30] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2022-06-12 22:20:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2022-06-12 22:20:30] [INFO ] Added : 276 causal constraints over 56 iterations in 3492 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-12 22:20:30] [INFO ] [Real]Absence check using 39 positive place invariants in 41 ms returned sat
[2022-06-12 22:20:30] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 28 ms returned sat
[2022-06-12 22:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:31] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2022-06-12 22:20:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:31] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned sat
[2022-06-12 22:20:31] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2022-06-12 22:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:31] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-06-12 22:20:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:32] [INFO ] [Real]Absence check using 39 positive place invariants in 26 ms returned sat
[2022-06-12 22:20:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2022-06-12 22:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:32] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-06-12 22:20:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:32] [INFO ] [Real]Absence check using 39 positive place invariants in 34 ms returned sat
[2022-06-12 22:20:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2022-06-12 22:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:33] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-06-12 22:20:33] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 1 ms to minimize.
[2022-06-12 22:20:33] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2022-06-12 22:20:33] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:20:33] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:20:33] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 1 ms to minimize.
[2022-06-12 22:20:34] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2022-06-12 22:20:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1035 ms
[2022-06-12 22:20:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2022-06-12 22:20:34] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2022-06-12 22:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:34] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-06-12 22:20:34] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 1 ms to minimize.
[2022-06-12 22:20:34] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:20:35] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:20:35] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:20:35] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2022-06-12 22:20:35] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2022-06-12 22:20:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 950 ms
[2022-06-12 22:20:35] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 30 ms.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 1 ms to minimize.
[2022-06-12 22:20:39] [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 10
FORMULA DES-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 287700 steps, including 3087 resets, run finished after 888 ms. (steps per millisecond=323 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 11 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.11 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 349 transition count 287
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 332 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 330 transition count 285
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 41 place count 330 transition count 276
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 59 place count 321 transition count 276
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 76 place count 304 transition count 259
Iterating global reduction 3 with 17 rules applied. Total rules applied 93 place count 304 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 304 transition count 258
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 303 transition count 258
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 108 place count 290 transition count 245
Iterating global reduction 3 with 13 rules applied. Total rules applied 121 place count 290 transition count 245
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 134 place count 290 transition count 232
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 288 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 137 place count 288 transition count 230
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 287 transition count 230
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 277 place count 218 transition count 161
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 285 place count 214 transition count 170
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 289 place count 214 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 293 place count 210 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 210 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 210 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 296 place count 209 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 297 place count 208 transition count 164
Applied a total of 297 rules in 367 ms. Remains 208 /360 variables (removed 152) and now considering 164/311 (removed 147) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/360 places, 164/311 transitions.
[2022-06-12 22:20:41] [INFO ] Flatten gal took : 132 ms
[2022-06-12 22:20:41] [INFO ] Flatten gal took : 47 ms
[2022-06-12 22:20:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6156703888062169158.gal : 30 ms
[2022-06-12 22:20:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10540285674284598756.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/ReachabilityCardinality6156703888062169158.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10540285674284598756.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/ReachabilityCardinality6156703888062169158.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10540285674284598756.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10540285674284598756.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 86
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :86 after 332
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :332 after 14664
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :14664 after 22728
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :22728 after 410440
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :410440 after 1.12124e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.12124e+06 after 3.97021e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.9969e+07 after 5.08012e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.08613e+10 after 1.11803e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.11803e+10 after 1.29171e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.28337e+11 after 1.44072e+11
Detected timeout of ITS tools.
[2022-06-12 22:20:56] [INFO ] Flatten gal took : 22 ms
[2022-06-12 22:20:56] [INFO ] Applying decomposition
[2022-06-12 22:20:56] [INFO ] Flatten gal took : 21 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/graph16549355516064284040.txt, -o, /tmp/graph16549355516064284040.bin, -w, /tmp/graph16549355516064284040.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/graph16549355516064284040.bin, -l, -1, -v, -w, /tmp/graph16549355516064284040.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:20:56] [INFO ] Decomposing Gal with order
[2022-06-12 22:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:20:56] [INFO ] Removed a total of 52 redundant transitions.
[2022-06-12 22:20:56] [INFO ] Flatten gal took : 70 ms
[2022-06-12 22:20:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 15 ms.
[2022-06-12 22:20:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8900476190232257286.gal : 9 ms
[2022-06-12 22:20:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5599314313334317612.prop : 28 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/ReachabilityCardinality8900476190232257286.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5599314313334317612.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/ReachabilityCardinality8900476190232257286.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5599314313334317612.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5599314313334317612.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 316
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :316 after 153300
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :867336 after 7.88448e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.88448e+09 after 2.37239e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.37239e+10 after 4.54211e+10
Reachability property DES-PT-20b-ReachabilityCardinality-14 is true.
FORMULA DES-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.63184e+13 after 3.01306e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.68159e+13 after 6.06281e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.72578e+13,10.988,232620,12795,2024,466510,5849,406,1.02806e+06,252,39603,0
Total reachable state count : 67257761202664

Verifying 2 reachability properties.
Reachability property DES-PT-20b-ReachabilityCardinality-08 is true.
FORMULA DES-PT-20b-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-08,72,11.0405,232620,59,136,466510,5849,417,1.02806e+06,259,39603,753
Reachability property DES-PT-20b-ReachabilityCardinality-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-14,54,11.0522,232620,70,121,466510,5849,430,1.02806e+06,259,39603,1367
All properties solved without resorting to model-checking.

BK_STOP 1655072468790

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DES-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-20b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r046-smll-165252115900179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;