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-158987853200415.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-6A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200415
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 3.6K Apr 8 15:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 8 15:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:37 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.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 20:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 20:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 297K 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-6A-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591145800253

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:56:43] [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 00:56:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:56:43] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2020-06-03 00:56:43] [INFO ] Transformed 512 places.
[2020-06-03 00:56:43] [INFO ] Transformed 1117 transitions.
[2020-06-03 00:56:43] [INFO ] Found NUPN structural information;
[2020-06-03 00:56:43] [INFO ] Parsed PT model containing 512 places and 1117 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 26 resets, run finished after 105 ms. (steps per millisecond=95 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1]
FORMULA NoC3x3-PT-6A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[1, 0, 0, 0]
FORMULA NoC3x3-PT-6A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0]
[2020-06-03 00:56:44] [INFO ] Flow matrix only has 1075 transitions (discarded 42 similar events)
// Phase 1: matrix 1075 rows 512 cols
[2020-06-03 00:56:44] [INFO ] Computed 66 place invariants in 28 ms
[2020-06-03 00:56:44] [INFO ] [Real]Absence check using 66 positive place invariants in 202 ms returned sat
[2020-06-03 00:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:56:45] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2020-06-03 00:56:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:56:46] [INFO ] [Nat]Absence check using 66 positive place invariants in 155 ms returned sat
[2020-06-03 00:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:56:48] [INFO ] [Nat]Absence check using state equation in 2008 ms returned sat
[2020-06-03 00:56:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2020-06-03 00:56:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 213 ms returned sat
[2020-06-03 00:56:49] [INFO ] Deduced a trap composed of 45 places in 410 ms
[2020-06-03 00:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 548 ms
[2020-06-03 00:56:49] [INFO ] Computed and/alt/rep : 1116/14062/1074 causal constraints in 156 ms.
[2020-06-03 00:56:51] [INFO ] Added : 50 causal constraints over 10 iterations in 1817 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 00:56:51] [INFO ] [Real]Absence check using 66 positive place invariants in 150 ms returned sat
[2020-06-03 00:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:56:53] [INFO ] [Real]Absence check using state equation in 1808 ms returned sat
[2020-06-03 00:56:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:56:53] [INFO ] [Nat]Absence check using 66 positive place invariants in 170 ms returned sat
[2020-06-03 00:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:56:55] [INFO ] [Nat]Absence check using state equation in 1557 ms returned sat
[2020-06-03 00:56:55] [INFO ] [Nat]Added 41 Read/Feed constraints in 278 ms returned sat
[2020-06-03 00:56:55] [INFO ] Computed and/alt/rep : 1116/14062/1074 causal constraints in 306 ms.
[2020-06-03 00:56:58] [INFO ] Added : 60 causal constraints over 12 iterations in 2781 ms. Result :unknown
[2020-06-03 00:56:58] [INFO ] [Real]Absence check using 66 positive place invariants in 102 ms returned sat
[2020-06-03 00:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:56:59] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2020-06-03 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:56:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 46 ms returned sat
[2020-06-03 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:57:01] [INFO ] [Nat]Absence check using state equation in 2024 ms returned sat
[2020-06-03 00:57:02] [INFO ] [Nat]Added 41 Read/Feed constraints in 238 ms returned sat
[2020-06-03 00:57:02] [INFO ] Deduced a trap composed of 20 places in 318 ms
[2020-06-03 00:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2020-06-03 00:57:02] [INFO ] Computed and/alt/rep : 1116/14062/1074 causal constraints in 120 ms.
[2020-06-03 00:57:04] [INFO ] Added : 45 causal constraints over 9 iterations in 2241 ms. Result :(error "Failed to check-sat")
Incomplete Parikh walk after 171400 steps, including 1000 resets, run finished after 1058 ms. (steps per millisecond=162 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 31 out of 512 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 512/512 places, 1117/1117 transitions.
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 512 transition count 1117
Deduced a syphon composed of 52 places in 15 ms
Reduce places removed 52 places and 179 transitions.
Iterating global reduction 0 with 104 rules applied. Total rules applied 156 place count 460 transition count 938
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 162 place count 457 transition count 963
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 185 place count 457 transition count 940
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 208 place count 434 transition count 940
Applied a total of 208 rules in 197 ms. Remains 434 /512 variables (removed 78) and now considering 940/1117 (removed 177) transitions.
Finished structural reductions, in 1 iterations. Remains : 434/512 places, 940/1117 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2574 ms. (steps per millisecond=388 ) properties seen :[0, 0, 1]
FORMULA NoC3x3-PT-6A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1883 ms. (steps per millisecond=531 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1252 ms. (steps per millisecond=798 ) properties seen :[0, 0]
[2020-06-03 00:57:11] [INFO ] Flow matrix only has 898 transitions (discarded 42 similar events)
// Phase 1: matrix 898 rows 434 cols
[2020-06-03 00:57:11] [INFO ] Computed 66 place invariants in 7 ms
[2020-06-03 00:57:12] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2020-06-03 00:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:57:13] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2020-06-03 00:57:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:57:13] [INFO ] [Nat]Absence check using 66 positive place invariants in 118 ms returned sat
[2020-06-03 00:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:57:15] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2020-06-03 00:57:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2020-06-03 00:57:15] [INFO ] [Nat]Added 41 Read/Feed constraints in 157 ms returned sat
[2020-06-03 00:57:15] [INFO ] Computed and/alt/rep : 932/13614/890 causal constraints in 160 ms.
[2020-06-03 00:57:36] [INFO ] Added : 265 causal constraints over 53 iterations in 20515 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
[2020-06-03 00:57:36] [INFO ] [Real]Absence check using 66 positive place invariants in 110 ms returned sat
[2020-06-03 00:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:57:38] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2020-06-03 00:57:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:57:38] [INFO ] [Nat]Absence check using 66 positive place invariants in 124 ms returned sat
[2020-06-03 00:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:57:39] [INFO ] [Nat]Absence check using state equation in 985 ms returned sat
[2020-06-03 00:57:39] [INFO ] [Nat]Added 41 Read/Feed constraints in 99 ms returned sat
[2020-06-03 00:57:39] [INFO ] Computed and/alt/rep : 932/13614/890 causal constraints in 109 ms.
[2020-06-03 00:58:00] [INFO ] Added : 310 causal constraints over 62 iterations in 20658 ms.(timeout) Result :sat
[2020-06-03 00:58:00] [INFO ] Deduced a trap composed of 29 places in 107 ms
[2020-06-03 00:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
Attempting to minimize the solution found.
Minimization took 99 ms.
Incomplete Parikh walk after 142000 steps, including 991 resets, run finished after 657 ms. (steps per millisecond=216 ) properties seen :[1, 0] could not realise parikh vector
FORMULA NoC3x3-PT-6A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 152500 steps, including 962 resets, run finished after 609 ms. (steps per millisecond=250 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 940/940 transitions.
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 434 transition count 940
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 20 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 15 place count 429 transition count 920
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 429 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 428 transition count 919
Applied a total of 17 rules in 129 ms. Remains 428 /434 variables (removed 6) and now considering 919/940 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/434 places, 919/940 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2053 ms. (steps per millisecond=487 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1165 ms. (steps per millisecond=858 ) properties seen :[0]
Interrupted probabilistic random walk after 4980380 steps, run timeout after 30001 ms. (steps per millisecond=166 ) properties seen :[0]
Probabilistic random walk after 4980380 steps, saw 770754 distinct states, run finished after 30015 ms. (steps per millisecond=165 ) properties seen :[0]
[2020-06-03 00:58:35] [INFO ] Flow matrix only has 877 transitions (discarded 42 similar events)
// Phase 1: matrix 877 rows 428 cols
[2020-06-03 00:58:35] [INFO ] Computed 66 place invariants in 5 ms
[2020-06-03 00:58:35] [INFO ] [Real]Absence check using 66 positive place invariants in 137 ms returned sat
[2020-06-03 00:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:58:37] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2020-06-03 00:58:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:58:37] [INFO ] [Nat]Absence check using 66 positive place invariants in 144 ms returned sat
[2020-06-03 00:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:58:39] [INFO ] [Nat]Absence check using state equation in 1674 ms returned sat
[2020-06-03 00:58:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2020-06-03 00:58:39] [INFO ] [Nat]Added 41 Read/Feed constraints in 244 ms returned sat
[2020-06-03 00:58:39] [INFO ] Computed and/alt/rep : 911/13044/869 causal constraints in 138 ms.
[2020-06-03 00:58:59] [INFO ] Added : 280 causal constraints over 56 iterations in 20319 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 131 ms.
Incomplete Parikh walk after 192700 steps, including 1000 resets, run finished after 701 ms. (steps per millisecond=274 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 428 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 428/428 places, 919/919 transitions.
Applied a total of 0 rules in 53 ms. Remains 428 /428 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 919/919 transitions.
Starting structural reductions, iteration 0 : 428/428 places, 919/919 transitions.
Applied a total of 0 rules in 57 ms. Remains 428 /428 variables (removed 0) and now considering 919/919 (removed 0) transitions.
[2020-06-03 00:59:01] [INFO ] Flow matrix only has 877 transitions (discarded 42 similar events)
// Phase 1: matrix 877 rows 428 cols
[2020-06-03 00:59:01] [INFO ] Computed 66 place invariants in 4 ms
[2020-06-03 00:59:02] [INFO ] Implicit Places using invariants in 938 ms returned [13, 50, 96, 136, 196, 276, 325, 364, 411]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 970 ms to find 9 implicit places.
[2020-06-03 00:59:03] [INFO ] Redundant transitions in 1192 ms returned []
[2020-06-03 00:59:03] [INFO ] Flow matrix only has 877 transitions (discarded 42 similar events)
// Phase 1: matrix 877 rows 419 cols
[2020-06-03 00:59:03] [INFO ] Computed 57 place invariants in 4 ms
[2020-06-03 00:59:05] [INFO ] Dead Transitions using invariants and state equation in 2601 ms returned []
Starting structural reductions, iteration 1 : 419/428 places, 919/919 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 396 transition count 896
Applied a total of 46 rules in 64 ms. Remains 396 /419 variables (removed 23) and now considering 896/919 (removed 23) transitions.
[2020-06-03 00:59:05] [INFO ] Flow matrix only has 854 transitions (discarded 42 similar events)
// Phase 1: matrix 854 rows 396 cols
[2020-06-03 00:59:05] [INFO ] Computed 57 place invariants in 3 ms
[2020-06-03 00:59:06] [INFO ] Implicit Places using invariants in 587 ms returned []
[2020-06-03 00:59:06] [INFO ] Flow matrix only has 854 transitions (discarded 42 similar events)
// Phase 1: matrix 854 rows 396 cols
[2020-06-03 00:59:06] [INFO ] Computed 57 place invariants in 8 ms
[2020-06-03 00:59:07] [INFO ] State equation strengthened by 61 read => feed constraints.
[2020-06-03 00:59:12] [INFO ] Implicit Places using invariants and state equation in 5597 ms returned []
Implicit Place search using SMT with State Equation took 6214 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 396/428 places, 896/919 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1945 ms. (steps per millisecond=514 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 1200 ms. (steps per millisecond=833 ) properties seen :[0]
Interrupted probabilistic random walk after 5013136 steps, run timeout after 30001 ms. (steps per millisecond=167 ) properties seen :[0]
Probabilistic random walk after 5013136 steps, saw 899202 distinct states, run finished after 30001 ms. (steps per millisecond=167 ) properties seen :[0]
[2020-06-03 00:59:45] [INFO ] Flow matrix only has 854 transitions (discarded 42 similar events)
// Phase 1: matrix 854 rows 396 cols
[2020-06-03 00:59:45] [INFO ] Computed 57 place invariants in 2 ms
[2020-06-03 00:59:45] [INFO ] [Real]Absence check using 57 positive place invariants in 84 ms returned sat
[2020-06-03 00:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:59:46] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2020-06-03 00:59:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:59:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 78 ms returned sat
[2020-06-03 00:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:59:47] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2020-06-03 00:59:47] [INFO ] State equation strengthened by 61 read => feed constraints.
[2020-06-03 00:59:48] [INFO ] [Nat]Added 61 Read/Feed constraints in 235 ms returned sat
[2020-06-03 00:59:48] [INFO ] Computed and/alt/rep : 888/12647/846 causal constraints in 57 ms.
[2020-06-03 01:00:08] [INFO ] Added : 240 causal constraints over 48 iterations in 20936 ms.(timeout) Result :sat
[2020-06-03 01:00:09] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2020-06-03 01:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1091 ms
Attempting to minimize the solution found.
Minimization took 67 ms.
Incomplete Parikh walk after 174800 steps, including 951 resets, run finished after 610 ms. (steps per millisecond=286 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 896/896 transitions.
Applied a total of 0 rules in 13 ms. Remains 396 /396 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 396/396 places, 896/896 transitions.
Starting structural reductions, iteration 0 : 396/396 places, 896/896 transitions.
Applied a total of 0 rules in 12 ms. Remains 396 /396 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2020-06-03 01:00:10] [INFO ] Flow matrix only has 854 transitions (discarded 42 similar events)
// Phase 1: matrix 854 rows 396 cols
[2020-06-03 01:00:10] [INFO ] Computed 57 place invariants in 2 ms
[2020-06-03 01:00:12] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2020-06-03 01:00:12] [INFO ] Flow matrix only has 854 transitions (discarded 42 similar events)
// Phase 1: matrix 854 rows 396 cols
[2020-06-03 01:00:12] [INFO ] Computed 57 place invariants in 3 ms
[2020-06-03 01:00:13] [INFO ] State equation strengthened by 61 read => feed constraints.
[2020-06-03 01:00:16] [INFO ] Implicit Places using invariants and state equation in 4564 ms returned []
Implicit Place search using SMT with State Equation took 6009 ms to find 0 implicit places.
[2020-06-03 01:00:17] [INFO ] Redundant transitions in 796 ms returned []
[2020-06-03 01:00:17] [INFO ] Flow matrix only has 854 transitions (discarded 42 similar events)
// Phase 1: matrix 854 rows 396 cols
[2020-06-03 01:00:17] [INFO ] Computed 57 place invariants in 5 ms
[2020-06-03 01:00:20] [INFO ] Dead Transitions using invariants and state equation in 2830 ms returned []
Finished structural reductions, in 1 iterations. Remains : 396/396 places, 896/896 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 207 ms. (steps per millisecond=483 ) properties seen :[0]
[2020-06-03 01:00:20] [INFO ] Flow matrix only has 854 transitions (discarded 42 similar events)
// Phase 1: matrix 854 rows 396 cols
[2020-06-03 01:00:20] [INFO ] Computed 57 place invariants in 2 ms
[2020-06-03 01:00:20] [INFO ] [Real]Absence check using 57 positive place invariants in 99 ms returned sat
[2020-06-03 01:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:00:22] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2020-06-03 01:00:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:00:22] [INFO ] [Nat]Absence check using 57 positive place invariants in 39 ms returned sat
[2020-06-03 01:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:00:23] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2020-06-03 01:00:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2020-06-03 01:00:23] [INFO ] [Nat]Added 61 Read/Feed constraints in 223 ms returned sat
[2020-06-03 01:00:23] [INFO ] Computed and/alt/rep : 888/12647/846 causal constraints in 154 ms.
[2020-06-03 01:00:42] [INFO ] Added : 240 causal constraints over 48 iterations in 18796 ms. Result :(error "Solver has unexpectedly terminated")
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 396 transition count 854
Symmetric choice reduction at 1 with 22 rule applications. Total rules 64 place count 396 transition count 854
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 83 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 108 place count 374 transition count 771
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 374 transition count 771
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 374 transition count 771
Applied a total of 120 rules in 64 ms. Remains 374 /396 variables (removed 22) and now considering 771/896 (removed 125) transitions.
// Phase 1: matrix 771 rows 374 cols
[2020-06-03 01:00:42] [INFO ] Computed 57 place invariants in 2 ms
[2020-06-03 01:00:42] [INFO ] [Real]Absence check using 57 positive place invariants in 246 ms returned sat
[2020-06-03 01:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:00:43] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2020-06-03 01:00:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:00:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 32 ms returned sat
[2020-06-03 01:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:00:44] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2020-06-03 01:00:44] [INFO ] Computed and/alt/rep : 763/9747/763 causal constraints in 55 ms.
[2020-06-03 01:01:05] [INFO ] Added : 245 causal constraints over 49 iterations in 21343 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 152 ms.
[2020-06-03 01:01:06] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-03 01:01:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
[2020-06-03 01:01:06] [INFO ] Flatten gal took : 319 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ NoC3x3-PT-6A @ 3570 seconds
check_solution: Variable C1 = -1 is below its lower bound 0
check_solution: Variable C2 = -1 is below its lower bound 0
check_solution: Variable C3 = -1 is below its lower bound 0
check_solution: Variable C4 = -1 is below its lower bound 0
check_solution: Variable C5 = -1 is below its lower bound 0
check_solution: Variable C10 = -1 is below its lower bound 0
check_solution: Variable C11 = -1 is below its lower bound 0
check_solution: Variable C12 = -1 is below its lower bound 0
check_solution: Variable C13 = -1 is below its lower bound 0
check_solution: Variable C23 = -1 is below its lower bound 0

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA NoC3x3-PT-6A-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3526
rslt: Output for ReachabilityFireability @ NoC3x3-PT-6A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 01:01:07 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 29932,
"runtime": 44.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((p165 <= 1) AND (1 <= p165) AND (1 <= p264) AND (p333 <= 1) AND (1 <= p333) AND (p362 <= 1) AND (1 <= p362) AND ((p157 <= 0) OR (p238 <= 0) OR ((1 <= p12) AND (1 <= p25)) OR ((p10 <= 1) AND (1 <= p10) AND (1 <= p15))))))",
"processed_size": 230,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3860,
"conflict_clusters": 25,
"places": 396,
"places_significant": 339,
"singleton_clusters": 0,
"transitions": 896
},
"result":
{
"edges": 126,
"markings": 119,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 35,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1292/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 396
lola: finding significant places
lola: 396 places, 896 transitions, 339 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: E (F (((p165 <= 1) AND (1 <= p165) AND (1 <= p264) AND (p333 <= 1) AND (1 <= p333) AND (p362 <= 1) AND (1 <= p362) AND ((p157 <= 0) OR (p238 <= 0) OR ((1 <= p12) AND (1 <= p25)) OR ((p10 <= 1) AND (1 <= p10) AND (1 <= p15))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p165 <= 1) AND (1 <= p165) AND (1 <= p264) AND (p333 <= 1) AND (1 <= p333) AND (p362 <= 1) AND (1 <= p362) AND ((p157 <= 0) OR (p238 <= 0) OR ((1 <= p12) AND (1 <= p25)) OR ((p10 <= 1) AND (1 <= p10) AND (1 <= p15))))))
lola: processed formula length: 230
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p165 <= 1) AND (1 <= p165) AND (1 <= p264) AND (p333 <= 1) AND (1 <= p333) AND (p362 <= 1) AND (1 <= p362) AND ((p157 <= 0) OR (p238 <= 0) OR ((1 <= p12) AND (1 <= p25)) OR ((p10 <= 1) AND (1 <= p10) AND (1 <= p15))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 35 literals and 4 conjunctive subformulas
lola: local time limit reached - aborting
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 119 markings, 126 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 29932 KB
lola: time consumption: 44 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
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-6A"
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-6A, 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-158987853200415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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