Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 07:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 362K May 5 16:51 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 NoC3x3-PT-1B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620950405284

Running Version 0
[2021-05-14 00:00:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 00:00:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 00:00:07] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2021-05-14 00:00:07] [INFO ] Transformed 1416 places.
[2021-05-14 00:00:07] [INFO ] Transformed 1640 transitions.
[2021-05-14 00:00:07] [INFO ] Found NUPN structural information;
[2021-05-14 00:00:07] [INFO ] Parsed PT model containing 1416 places and 1640 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :7
FORMULA NoC3x3-PT-1B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :1
FORMULA NoC3x3-PT-1B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1640 rows 1416 cols
[2021-05-14 00:00:07] [INFO ] Computed 40 place invariants in 38 ms
[2021-05-14 00:00:08] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2021-05-14 00:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:08] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2021-05-14 00:00:09] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 5 ms to minimize.
[2021-05-14 00:00:09] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2021-05-14 00:00:09] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 1 ms to minimize.
[2021-05-14 00:00:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 597 ms
[2021-05-14 00:00:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2021-05-14 00:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:10] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2021-05-14 00:00:10] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 1 ms to minimize.
[2021-05-14 00:00:10] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2021-05-14 00:00:10] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 0 ms to minimize.
[2021-05-14 00:00:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 555 ms
[2021-05-14 00:00:10] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 111 ms.
[2021-05-14 00:00:15] [INFO ] Deduced a trap composed of 7 places in 614 ms of which 1 ms to minimize.
[2021-05-14 00:00:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 00:00:15] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2021-05-14 00:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:15] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2021-05-14 00:00:15] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2021-05-14 00:00:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2021-05-14 00:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2021-05-14 00:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:16] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2021-05-14 00:00:16] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 1 ms to minimize.
[2021-05-14 00:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2021-05-14 00:00:17] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 96 ms.
[2021-05-14 00:00:21] [INFO ] Deduced a trap composed of 7 places in 509 ms of which 1 ms to minimize.
[2021-05-14 00:00:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 00:00:21] [INFO ] [Real]Absence check using 40 positive place invariants in 32 ms returned sat
[2021-05-14 00:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:22] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2021-05-14 00:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 32 ms returned sat
[2021-05-14 00:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:23] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2021-05-14 00:00:23] [INFO ] Deduced a trap composed of 145 places in 135 ms of which 0 ms to minimize.
[2021-05-14 00:00:23] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 0 ms to minimize.
[2021-05-14 00:00:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2021-05-14 00:00:23] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 90 ms.
[2021-05-14 00:00:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 00:00:27] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned unsat
[2021-05-14 00:00:28] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2021-05-14 00:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:28] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2021-05-14 00:00:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 31 ms returned sat
[2021-05-14 00:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:29] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2021-05-14 00:00:29] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 1 ms to minimize.
[2021-05-14 00:00:29] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 0 ms to minimize.
[2021-05-14 00:00:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2021-05-14 00:00:29] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 97 ms.
[2021-05-14 00:00:33] [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: Broken pipe ... while checking expression at index 4
[2021-05-14 00:00:33] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2021-05-14 00:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:34] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-14 00:00:34] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 0 ms to minimize.
[2021-05-14 00:00:34] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 1 ms to minimize.
[2021-05-14 00:00:34] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 0 ms to minimize.
[2021-05-14 00:00:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2021-05-14 00:00:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 33 ms returned sat
[2021-05-14 00:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:35] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2021-05-14 00:00:35] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 0 ms to minimize.
[2021-05-14 00:00:35] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 0 ms to minimize.
[2021-05-14 00:00:36] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2021-05-14 00:00:36] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2021-05-14 00:00:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 566 ms
[2021-05-14 00:00:36] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 97 ms.
[2021-05-14 00:00:40] [INFO ] Deduced a trap composed of 7 places in 522 ms of which 2 ms to minimize.
[2021-05-14 00:00:40] [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 5
[2021-05-14 00:00:40] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2021-05-14 00:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:41] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2021-05-14 00:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned unsat
[2021-05-14 00:00:41] [INFO ] [Real]Absence check using 40 positive place invariants in 32 ms returned sat
[2021-05-14 00:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:42] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2021-05-14 00:00:42] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2021-05-14 00:00:42] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 0 ms to minimize.
[2021-05-14 00:00:42] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 0 ms to minimize.
[2021-05-14 00:00:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 417 ms
[2021-05-14 00:00:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:00:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2021-05-14 00:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:00:43] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2021-05-14 00:00:43] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2021-05-14 00:00:43] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 1 ms to minimize.
[2021-05-14 00:00:43] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 0 ms to minimize.
[2021-05-14 00:00:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
[2021-05-14 00:00:43] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 98 ms.
[2021-05-14 00:00:47] [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 7
FORMULA NoC3x3-PT-1B-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA NoC3x3-PT-1B-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Support contains 20 out of 1416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1399 edges and 1416 vertex of which 808 / 1416 are part of one of the 20 SCC in 14 ms
Free SCC test removed 788 places
Drop transitions removed 946 transitions
Reduce isomorphic transitions removed 946 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 628 transition count 613
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 93 rules applied. Total rules applied 175 place count 547 transition count 601
Reduce places removed 2 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 16 rules applied. Total rules applied 191 place count 545 transition count 587
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 211 place count 531 transition count 581
Discarding 162 places :
Symmetric choice reduction at 4 with 162 rule applications. Total rules 373 place count 369 transition count 419
Iterating global reduction 4 with 162 rules applied. Total rules applied 535 place count 369 transition count 419
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 4 with 2 rules applied. Total rules applied 537 place count 369 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 538 place count 368 transition count 417
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 538 place count 368 transition count 386
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 600 place count 337 transition count 386
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 625 place count 312 transition count 348
Iterating global reduction 6 with 25 rules applied. Total rules applied 650 place count 312 transition count 348
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 802 place count 236 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 804 place count 236 transition count 270
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 814 place count 231 transition count 307
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 816 place count 231 transition count 305
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 827 place count 231 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 829 place count 230 transition count 308
Free-agglomeration rule applied 87 times.
Iterating global reduction 8 with 87 rules applied. Total rules applied 916 place count 230 transition count 221
Reduce places removed 87 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 426 edges and 143 vertex of which 141 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 103 rules applied. Total rules applied 1019 place count 141 transition count 206
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1021 place count 141 transition count 204
Applied a total of 1021 rules in 225 ms. Remains 141 /1416 variables (removed 1275) and now considering 204/1640 (removed 1436) transitions.
Finished structural reductions, in 1 iterations. Remains : 141/1416 places, 204/1640 transitions.
[2021-05-14 00:00:48] [INFO ] Flatten gal took : 60 ms
[2021-05-14 00:00:48] [INFO ] Flatten gal took : 24 ms
[2021-05-14 00:00:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3721202291357515504.gal : 11 ms
[2021-05-14 00:00:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10067901422896009594.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/ReachabilityCardinality3721202291357515504.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10067901422896009594.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/ReachabilityCardinality3721202291357515504.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10067901422896009594.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10067901422896009594.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :16 after 38
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :38 after 124
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :124 after 2753
Invariant property NoC3x3-PT-1B-ReachabilityFireability-07 does not hold.
FORMULA NoC3x3-PT-1B-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :2753 after 4.80019e+06
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :4.80019e+06 after 2.88e+09
Reachability property NoC3x3-PT-1B-ReachabilityFireability-14 is true.
FORMULA NoC3x3-PT-1B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property NoC3x3-PT-1B-ReachabilityFireability-09 does not hold.
FORMULA NoC3x3-PT-1B-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2.88e+09 after 6.24154e+13
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6.24154e+13 after 6.74309e+13
Invariant property NoC3x3-PT-1B-ReachabilityFireability-12 does not hold.
FORMULA NoC3x3-PT-1B-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2021-05-14 00:01:03] [INFO ] Flatten gal took : 43 ms
[2021-05-14 00:01:03] [INFO ] Applying decomposition
[2021-05-14 00:01:03] [INFO ] Flatten gal took : 37 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/graph7339841998947281525.txt, -o, /tmp/graph7339841998947281525.bin, -w, /tmp/graph7339841998947281525.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/graph7339841998947281525.bin, -l, -1, -v, -w, /tmp/graph7339841998947281525.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 00:01:03] [INFO ] Decomposing Gal with order
[2021-05-14 00:01:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 00:01:03] [INFO ] Removed a total of 224 redundant transitions.
[2021-05-14 00:01:03] [INFO ] Flatten gal took : 51 ms
[2021-05-14 00:01:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 14 ms.
[2021-05-14 00:01:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12349952191964350134.gal : 5 ms
[2021-05-14 00:01:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7589983201592631149.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/ReachabilityCardinality12349952191964350134.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7589983201592631149.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/ReachabilityCardinality12349952191964350134.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7589983201592631149.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7589983201592631149.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 145
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :145 after 1297
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1297 after 23041
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23041 after 2.4192e+09
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.4192e+09 after 4.9572e+12
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.9572e+12 after 8.12514e+14
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,9.6889e+16,0.069558,6584,123,187,2206,4214,514,3171,262,6652,0
Total reachable state count : 96888960000000001

Verifying 2 reachability properties.
Reachability property NoC3x3-PT-1B-ReachabilityFireability-01 is true.
FORMULA NoC3x3-PT-1B-ReachabilityFireability-01 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
NoC3x3-PT-1B-ReachabilityFireability-01,1.9224e+14,0.070435,6584,79,147,2206,4214,518,3171,267,6652,29
Reachability property NoC3x3-PT-1B-ReachabilityFireability-05 is true.
FORMULA NoC3x3-PT-1B-ReachabilityFireability-05 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
NoC3x3-PT-1B-ReachabilityFireability-05,1.8144e+14,0.070926,6584,74,124,2206,4214,526,3171,270,6652,50
All properties solved without resorting to model-checking.

BK_STOP 1620950464521

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-1B, 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 r140-tall-162089127500239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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