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.r174-csrt-158987853200455.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 itslola
Input is NoC3x3-PT-8B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.1K Apr 8 15:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 18:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 18:42 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.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.8K Apr 6 20:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 20:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 04:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 6 04:04 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 3.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-8B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591149220568

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:53:42] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 01:53:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:53:43] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2020-06-03 01:53:43] [INFO ] Transformed 9140 places.
[2020-06-03 01:53:43] [INFO ] Transformed 14577 transitions.
[2020-06-03 01:53:43] [INFO ] Found NUPN structural information;
[2020-06-03 01:53:43] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 583 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 258 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 191 ms. (steps per millisecond=52 ) properties seen :[1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 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, 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, 0, 0]
// Phase 1: matrix 14577 rows 9140 cols
[2020-06-03 01:53:44] [INFO ] Computed 99 place invariants in 491 ms
[2020-06-03 01:53:47] [INFO ] [Real]Absence check using 99 positive place invariants in 1201 ms returned sat
[2020-06-03 01:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:53:49] [INFO ] [Real]Absence check using state equation in 2161 ms returned (error "Failed to check-sat")
[2020-06-03 01:53:51] [INFO ] [Real]Absence check using 99 positive place invariants in 1070 ms returned unsat
[2020-06-03 01:53:54] [INFO ] [Real]Absence check using 99 positive place invariants in 1085 ms returned sat
[2020-06-03 01:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:56] [INFO ] [Real]Absence check using state equation in 2879 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 01:53:59] [INFO ] [Real]Absence check using 99 positive place invariants in 1125 ms returned sat
[2020-06-03 01:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:01] [INFO ] [Real]Absence check using state equation in 2866 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 01:54:04] [INFO ] [Real]Absence check using 99 positive place invariants in 1257 ms returned sat
[2020-06-03 01:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:06] [INFO ] [Real]Absence check using state equation in 2732 ms returned (error "Failed to check-sat")
[2020-06-03 01:54:09] [INFO ] [Real]Absence check using 99 positive place invariants in 1187 ms returned sat
[2020-06-03 01:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:11] [INFO ] [Real]Absence check using state equation in 2712 ms returned (error "Failed to check-sat")
[2020-06-03 01:54:14] [INFO ] [Real]Absence check using 99 positive place invariants in 1131 ms returned sat
[2020-06-03 01:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:16] [INFO ] [Real]Absence check using state equation in 2797 ms returned (error "Failed to check-sat")
[2020-06-03 01:54:19] [INFO ] [Real]Absence check using 99 positive place invariants in 1145 ms returned sat
[2020-06-03 01:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:21] [INFO ] [Real]Absence check using state equation in 2937 ms returned (error "Failed to check-sat")
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 99 positive place invariants in 1120 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:27] [INFO ] [Real]Absence check using state equation in 2776 ms returned (error "Failed to check-sat")
[2020-06-03 01:54:29] [INFO ] [Real]Absence check using 99 positive place invariants in 1169 ms returned sat
[2020-06-03 01:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:32] [INFO ] [Real]Absence check using state equation in 2866 ms returned (error "Failed to check-sat")
[2020-06-03 01:54:34] [INFO ] [Real]Absence check using 99 positive place invariants in 1147 ms returned sat
[2020-06-03 01:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:37] [INFO ] [Real]Absence check using state equation in 2795 ms returned (error "Failed to check-sat")
FORMULA NoC3x3-PT-8B-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 56 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13352 edges and 9140 vertex of which 2106 / 9140 are part of one of the 33 SCC in 59 ms
Free SCC test removed 2073 places
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Graph (complete) has 12777 edges and 7067 vertex of which 6954 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.37 ms
Drop transitions removed 3277 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 3381 transitions.
Performed 4388 Post agglomeration using F-continuation condition.Transition count delta: 4388
Iterating post reduction 0 with 7769 rules applied. Total rules applied 7771 place count 6954 transition count 6728
Reduce places removed 4388 places and 0 transitions.
Ensure Unique test removed 2476 transitions
Reduce isomorphic transitions removed 2476 transitions.
Performed 1225 Post agglomeration using F-continuation condition.Transition count delta: 1225
Iterating post reduction 1 with 8089 rules applied. Total rules applied 15860 place count 2566 transition count 3027
Reduce places removed 1225 places and 0 transitions.
Ensure Unique test removed 1225 transitions
Reduce isomorphic transitions removed 1225 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 2468 rules applied. Total rules applied 18328 place count 1341 transition count 1784
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 18346 place count 1323 transition count 1784
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 18346 place count 1323 transition count 1735
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 18444 place count 1274 transition count 1735
Symmetric choice reduction at 4 with 354 rule applications. Total rules 18798 place count 1274 transition count 1735
Deduced a syphon composed of 354 places in 6 ms
Reduce places removed 354 places and 354 transitions.
Iterating global reduction 4 with 708 rules applied. Total rules applied 19506 place count 920 transition count 1381
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 19559 place count 920 transition count 1328
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 60 Pre rules applied. Total rules applied 19559 place count 920 transition count 1268
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 19679 place count 860 transition count 1268
Symmetric choice reduction at 5 with 45 rule applications. Total rules 19724 place count 860 transition count 1268
Deduced a syphon composed of 45 places in 8 ms
Reduce places removed 45 places and 60 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 19814 place count 815 transition count 1208
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 19829 place count 815 transition count 1193
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 6 with 478 rules applied. Total rules applied 20307 place count 576 transition count 954
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 20330 place count 576 transition count 931
Symmetric choice reduction at 7 with 4 rule applications. Total rules 20334 place count 576 transition count 931
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 20342 place count 572 transition count 923
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 20356 place count 565 transition count 954
Free-agglomeration rule applied 210 times.
Iterating global reduction 7 with 210 rules applied. Total rules applied 20566 place count 565 transition count 744
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 52 transitions.
Discarding 4 places :
Also discarding 0 output transitions
Graph (complete) has 1089 edges and 355 vertex of which 351 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Iterating post reduction 7 with 263 rules applied. Total rules applied 20829 place count 351 transition count 692
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 20833 place count 351 transition count 688
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 20857 place count 351 transition count 688
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 20863 place count 351 transition count 688
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 20869 place count 351 transition count 682
Drop transitions removed 146 transitions
Redundant transition composition rules discarded 146 transitions
Iterating global reduction 10 with 146 rules applied. Total rules applied 21015 place count 351 transition count 536
Discarding 13 places :
Also discarding 0 output transitions
Graph (complete) has 953 edges and 351 vertex of which 338 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Iterating post reduction 10 with 1 rules applied. Total rules applied 21016 place count 338 transition count 536
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 21029 place count 338 transition count 523
Symmetric choice reduction at 12 with 5 rule applications. Total rules 21034 place count 338 transition count 523
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 7 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 21044 place count 333 transition count 516
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 21048 place count 333 transition count 512
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 21052 place count 329 transition count 512
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 21053 place count 329 transition count 512
Applied a total of 21053 rules in 1778 ms. Remains 329 /9140 variables (removed 8811) and now considering 512/14577 (removed 14065) transitions.
Finished structural reductions, in 1 iterations. Remains : 329/9140 places, 512/14577 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2591 ms. (steps per millisecond=385 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1360 ms. (steps per millisecond=735 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1222 ms. (steps per millisecond=818 ) properties seen :[1, 0, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1321 ms. (steps per millisecond=757 ) properties seen :[1, 0, 1, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1281 ms. (steps per millisecond=780 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties seen :[0, 1]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-03 01:54:47] [INFO ] Flow matrix only has 477 transitions (discarded 35 similar events)
// Phase 1: matrix 477 rows 329 cols
[2020-06-03 01:54:47] [INFO ] Computed 66 place invariants in 6 ms
[2020-06-03 01:54:47] [INFO ] [Real]Absence check using 66 positive place invariants in 46 ms returned sat
[2020-06-03 01:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:48] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2020-06-03 01:54:48] [INFO ] State equation strengthened by 190 read => feed constraints.
[2020-06-03 01:54:48] [INFO ] [Real]Added 190 Read/Feed constraints in 26 ms returned sat
[2020-06-03 01:54:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:48] [INFO ] [Nat]Absence check using 66 positive place invariants in 40 ms returned sat
[2020-06-03 01:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:48] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-06-03 01:54:48] [INFO ] [Nat]Added 190 Read/Feed constraints in 22 ms returned sat
[2020-06-03 01:54:48] [INFO ] Computed and/alt/rep : 509/2478/474 causal constraints in 40 ms.
[2020-06-03 01:54:53] [INFO ] Added : 436 causal constraints over 88 iterations in 4255 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 51 ms.
Incomplete Parikh walk after 56200 steps, including 350 resets, run finished after 240 ms. (steps per millisecond=234 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 329 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 329/329 places, 512/512 transitions.
Graph (trivial) has 106 edges and 329 vertex of which 20 / 329 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 314 transition count 460
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 80 place count 291 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 290 transition count 456
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 290 transition count 454
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 288 transition count 454
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 288 transition count 454
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 286 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 286 transition count 450
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 125 place count 270 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 127 place count 270 transition count 432
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 269 transition count 433
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 142 place count 269 transition count 420
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 763 edges and 256 vertex of which 254 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Iterating post reduction 5 with 19 rules applied. Total rules applied 161 place count 254 transition count 415
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 163 place count 254 transition count 413
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 168 place count 254 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 170 place count 254 transition count 411
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 176 place count 254 transition count 405
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 756 edges and 254 vertex of which 253 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Iterating post reduction 8 with 1 rules applied. Total rules applied 177 place count 253 transition count 405
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 178 place count 253 transition count 404
Applied a total of 178 rules in 135 ms. Remains 253 /329 variables (removed 76) and now considering 404/512 (removed 108) transitions.
Finished structural reductions, in 1 iterations. Remains : 253/329 places, 404/512 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2099 ms. (steps per millisecond=476 ) properties seen :[0]
Finished Best-First random walk after 6645 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=664 )
FORMULA NoC3x3-PT-8B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

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-8B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is NoC3x3-PT-8B, 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 r174-csrt-158987853200455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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