Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257600439.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-7B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257600439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 24 05:37 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-7B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589972755900

[2020-05-20 11:05:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 11:05:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 11:05:59] [INFO ] Load time of PNML (sax parser for PT used): 590 ms
[2020-05-20 11:05:59] [INFO ] Transformed 7014 places.
[2020-05-20 11:05:59] [INFO ] Transformed 8833 transitions.
[2020-05-20 11:05:59] [INFO ] Found NUPN structural information;
[2020-05-20 11:05:59] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 850 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 244 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 217 ms. (steps per millisecond=46 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 8833 rows 7014 cols
[2020-05-20 11:06:00] [INFO ] Computed 66 place invariants in 283 ms
[2020-05-20 11:06:02] [INFO ] [Real]Absence check using 66 positive place invariants in 860 ms returned sat
[2020-05-20 11:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:05] [INFO ] [Real]Absence check using state equation in 2472 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:06:07] [INFO ] [Real]Absence check using 66 positive place invariants in 714 ms returned sat
[2020-05-20 11:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:10] [INFO ] [Real]Absence check using state equation in 2528 ms returned (error "Failed to check-sat")
[2020-05-20 11:06:11] [INFO ] [Real]Absence check using 66 positive place invariants in 699 ms returned sat
[2020-05-20 11:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:06:15] [INFO ] [Real]Absence check using state equation in 3488 ms returned (error "Failed to check-sat")
[2020-05-20 11:06:16] [INFO ] [Real]Absence check using 66 positive place invariants in 730 ms returned sat
[2020-05-20 11:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:06:20] [INFO ] [Real]Absence check using state equation in 3509 ms returned (error "Failed to check-sat")
[2020-05-20 11:06:21] [INFO ] [Real]Absence check using 66 positive place invariants in 668 ms returned sat
[2020-05-20 11:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:25] [INFO ] [Real]Absence check using state equation in 3582 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:06:26] [INFO ] [Real]Absence check using 66 positive place invariants in 710 ms returned sat
[2020-05-20 11:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:30] [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 (= s293 (- (+ t8393 t8394 t8395) t7227))") while checking expression at index 5
[2020-05-20 11:06:32] [INFO ] [Real]Absence check using 66 positive place invariants in 742 ms returned sat
[2020-05-20 11:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:06:35] [INFO ] [Real]Absence check using state equation in 3395 ms returned (error "Failed to check-sat")
[2020-05-20 11:06:36] [INFO ] [Real]Absence check using 66 positive place invariants in 661 ms returned sat
[2020-05-20 11:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:06:40] [INFO ] [Real]Absence check using state equation in 3588 ms returned (error "Failed to check-sat")
[2020-05-20 11:06:41] [INFO ] [Real]Absence check using 66 positive place invariants in 688 ms returned sat
[2020-05-20 11:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:45] [INFO ] [Real]Absence check using state equation in 3562 ms returned (error "Failed to check-sat")
Support contains 46 out of 7014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7695 edges and 7014 vertex of which 3994 / 7014 are part of one of the 29 SCC in 73 ms
Free SCC test removed 3965 places
Drop transitions removed 4842 transitions
Reduce isomorphic transitions removed 4842 transitions.
Performed 880 Post agglomeration using F-continuation condition.Transition count delta: 880
Iterating post reduction 0 with 5722 rules applied. Total rules applied 5723 place count 3049 transition count 3111
Reduce places removed 880 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 966 rules applied. Total rules applied 6689 place count 2169 transition count 3025
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 42 rules applied. Total rules applied 6731 place count 2130 transition count 3022
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6732 place count 2129 transition count 3022
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 6732 place count 2129 transition count 3013
Deduced a syphon composed of 9 places in 32 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 6750 place count 2120 transition count 3013
Symmetric choice reduction at 4 with 716 rule applications. Total rules 7466 place count 2120 transition count 3013
Deduced a syphon composed of 716 places in 7 ms
Reduce places removed 716 places and 721 transitions.
Iterating global reduction 4 with 1432 rules applied. Total rules applied 8898 place count 1404 transition count 2292
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 4 with 13 rules applied. Total rules applied 8911 place count 1404 transition count 2279
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 8916 place count 1399 transition count 2279
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 46 Pre rules applied. Total rules applied 8916 place count 1399 transition count 2233
Deduced a syphon composed of 46 places in 13 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 9008 place count 1353 transition count 2233
Symmetric choice reduction at 6 with 405 rule applications. Total rules 9413 place count 1353 transition count 2233
Deduced a syphon composed of 405 places in 13 ms
Reduce places removed 405 places and 559 transitions.
Iterating global reduction 6 with 810 rules applied. Total rules applied 10223 place count 948 transition count 1674
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Iterating post reduction 6 with 325 rules applied. Total rules applied 10548 place count 948 transition count 1349
Symmetric choice reduction at 7 with 8 rule applications. Total rules 10556 place count 948 transition count 1349
Deduced a syphon composed of 8 places in 20 ms
Reduce places removed 8 places and 16 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 10572 place count 940 transition count 1333
Symmetric choice reduction at 7 with 8 rule applications. Total rules 10580 place count 940 transition count 1333
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 10596 place count 932 transition count 1325
Symmetric choice reduction at 7 with 8 rule applications. Total rules 10604 place count 932 transition count 1325
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 12 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 10620 place count 924 transition count 1313
Symmetric choice reduction at 7 with 8 rule applications. Total rules 10628 place count 924 transition count 1313
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 16 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 10644 place count 916 transition count 1297
Performed 275 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 275 places in 1 ms
Reduce places removed 275 places and 0 transitions.
Iterating global reduction 7 with 550 rules applied. Total rules applied 11194 place count 641 transition count 1005
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 11215 place count 641 transition count 984
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 11233 place count 632 transition count 975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 11234 place count 632 transition count 974
Performed 94 Post agglomeration using F-continuation condition with reduction of 186 identical transitions.
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 9 with 188 rules applied. Total rules applied 11422 place count 538 transition count 1155
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Iterating post reduction 9 with 106 rules applied. Total rules applied 11528 place count 538 transition count 1049
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 11536 place count 534 transition count 1100
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 11558 place count 534 transition count 1078
Free-agglomeration rule applied 183 times.
Iterating global reduction 11 with 183 rules applied. Total rules applied 11741 place count 534 transition count 895
Reduce places removed 183 places and 0 transitions.
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Discarding 32 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (complete) has 1336 edges and 351 vertex of which 319 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.27 ms
Iterating post reduction 11 with 247 rules applied. Total rules applied 11988 place count 319 transition count 828
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 12 with 28 rules applied. Total rules applied 12016 place count 319 transition count 800
Symmetric choice reduction at 13 with 9 rule applications. Total rules 12025 place count 319 transition count 800
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 12043 place count 310 transition count 791
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 12044 place count 310 transition count 790
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 12045 place count 309 transition count 790
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 14 with 34 rules applied. Total rules applied 12079 place count 309 transition count 790
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 14 with 70 rules applied. Total rules applied 12149 place count 309 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 12150 place count 308 transition count 720
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 12151 place count 308 transition count 719
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 12153 place count 307 transition count 718
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 12156 place count 307 transition count 718
Applied a total of 12156 rules in 1924 ms. Remains 307 /7014 variables (removed 6707) and now considering 718/8833 (removed 8115) transitions.
Finished structural reductions, in 1 iterations. Remains : 307/7014 places, 718/8833 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2969 ms. (steps per millisecond=336 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties seen :[1, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties seen :[0, 1, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties seen :[0, 0, 1]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-05-20 11:06:54] [INFO ] Flow matrix only has 670 transitions (discarded 48 similar events)
// Phase 1: matrix 670 rows 307 cols
[2020-05-20 11:06:54] [INFO ] Computed 53 place invariants in 3 ms
[2020-05-20 11:06:54] [INFO ] [Real]Absence check using 53 positive place invariants in 41 ms returned sat
[2020-05-20 11:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:55] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2020-05-20 11:06:55] [INFO ] State equation strengthened by 158 read => feed constraints.
[2020-05-20 11:06:55] [INFO ] [Real]Added 158 Read/Feed constraints in 56 ms returned sat
[2020-05-20 11:06:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 11:06:55] [INFO ] [Nat]Absence check using 53 positive place invariants in 199 ms returned sat
[2020-05-20 11:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:56] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2020-05-20 11:06:56] [INFO ] [Nat]Added 158 Read/Feed constraints in 25 ms returned sat
[2020-05-20 11:06:56] [INFO ] Computed and/alt/rep : 713/4743/665 causal constraints in 65 ms.
[2020-05-20 11:07:10] [INFO ] Added : 635 causal constraints over 128 iterations in 13608 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 106 ms.
[2020-05-20 11:07:10] [INFO ] [Real]Absence check using 53 positive place invariants in 58 ms returned sat
[2020-05-20 11:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:07:11] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2020-05-20 11:07:11] [INFO ] [Real]Added 158 Read/Feed constraints in 44 ms returned sat
[2020-05-20 11:07:11] [INFO ] Computed and/alt/rep : 713/4743/665 causal constraints in 103 ms.
[2020-05-20 11:07:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 11:07:11] [INFO ] [Nat]Absence check using 53 positive place invariants in 52 ms returned sat
[2020-05-20 11:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 11:07:12] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2020-05-20 11:07:12] [INFO ] [Nat]Added 158 Read/Feed constraints in 36 ms returned sat
[2020-05-20 11:07:12] [INFO ] Computed and/alt/rep : 713/4743/665 causal constraints in 106 ms.
[2020-05-20 11:07:27] [INFO ] Added : 645 causal constraints over 130 iterations in 14736 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 107 ms.
Incomplete Parikh walk after 83600 steps, including 492 resets, run finished after 416 ms. (steps per millisecond=200 ) properties seen :[0, 1] could not realise parikh vector
FORMULA NoC3x3-PT-7B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 8534 steps, including 66 resets, run visited all 1 properties in 64 ms. (steps per millisecond=133 )
FORMULA NoC3x3-PT-7B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589972848149

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-7B"
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"

# 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-7B, 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 r111-csrt-158961257600439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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