About the Execution of ITS-Tools for ShieldRVs-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.510 | 1602293.00 | 4519948.00 | 2576.70 | TTFTTFTTFTTTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476400887.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476400887
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 3.7K May 14 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 498K May 12 20:42 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 ShieldRVs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1590626557423
[2020-05-28 00:42:39] [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-28 00:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 00:42:39] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-05-28 00:42:39] [INFO ] Transformed 1603 places.
[2020-05-28 00:42:39] [INFO ] Transformed 1803 transitions.
[2020-05-28 00:42:39] [INFO ] Found NUPN structural information;
[2020-05-28 00:42:39] [INFO ] Parsed PT model containing 1603 places and 1803 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 91 ms. (steps per millisecond=109 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1803 rows 1603 cols
[2020-05-28 00:42:39] [INFO ] Computed 161 place invariants in 37 ms
[2020-05-28 00:42:40] [INFO ] [Real]Absence check using 161 positive place invariants in 185 ms returned sat
[2020-05-28 00:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:42:44] [INFO ] [Real]Absence check using state equation in 4567 ms returned (error "Solver has unexpectedly terminated")
[2020-05-28 00:42:44] [INFO ] [Real]Absence check using 161 positive place invariants in 142 ms returned sat
[2020-05-28 00:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:42:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 00:42:49] [INFO ] [Real]Absence check using state equation in 4701 ms returned (error "Failed to check-sat")
[2020-05-28 00:42:50] [INFO ] [Real]Absence check using 161 positive place invariants in 206 ms returned sat
[2020-05-28 00:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:42:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 00:42:54] [INFO ] [Real]Absence check using state equation in 4568 ms returned (error "Failed to check-sat")
[2020-05-28 00:42:55] [INFO ] [Real]Absence check using 161 positive place invariants in 198 ms returned sat
[2020-05-28 00:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:42:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 00:42:59] [INFO ] [Real]Absence check using state equation in 4639 ms returned (error "Failed to check-sat")
[2020-05-28 00:43:00] [INFO ] [Real]Absence check using 161 positive place invariants in 145 ms returned sat
[2020-05-28 00:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:43:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 00:43:04] [INFO ] [Real]Absence check using state equation in 4700 ms returned (error "Failed to check-sat")
[2020-05-28 00:43:05] [INFO ] [Real]Absence check using 161 positive place invariants in 172 ms returned sat
[2020-05-28 00:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:43:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 00:43:09] [INFO ] [Real]Absence check using state equation in 4565 ms returned (error "Failed to check-sat")
Support contains 25 out of 1603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1603 transition count 1644
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1444 transition count 1644
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 318 place count 1444 transition count 1443
Deduced a syphon composed of 201 places in 7 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 720 place count 1243 transition count 1443
Symmetric choice reduction at 2 with 271 rule applications. Total rules 991 place count 1243 transition count 1443
Deduced a syphon composed of 271 places in 5 ms
Reduce places removed 271 places and 271 transitions.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1533 place count 972 transition count 1172
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 1533 place count 972 transition count 1058
Deduced a syphon composed of 114 places in 5 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 1761 place count 858 transition count 1058
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 278
Deduced a syphon composed of 278 places in 4 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 2 with 556 rules applied. Total rules applied 2317 place count 580 transition count 780
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 2396 place count 580 transition count 780
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2397 place count 579 transition count 779
Applied a total of 2397 rules in 590 ms. Remains 579 /1603 variables (removed 1024) and now considering 779/1803 (removed 1024) transitions.
Finished structural reductions, in 1 iterations. Remains : 579/1603 places, 779/1803 transitions.
Incomplete random walk after 1000000 steps, including 2028 resets, run finished after 3680 ms. (steps per millisecond=271 ) properties seen :[0, 1, 0, 0, 1, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 190 resets, run finished after 2220 ms. (steps per millisecond=450 ) properties seen :[1, 0, 0]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 232 resets, run finished after 2099 ms. (steps per millisecond=476 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 221 resets, run finished after 2421 ms. (steps per millisecond=413 ) properties seen :[0, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 779 rows 579 cols
[2020-05-28 00:43:20] [INFO ] Computed 161 place invariants in 19 ms
[2020-05-28 00:43:20] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-05-28 00:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:43:21] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2020-05-28 00:43:21] [INFO ] Deduced a trap composed of 10 places in 185 ms
[2020-05-28 00:43:22] [INFO ] Deduced a trap composed of 7 places in 161 ms
[2020-05-28 00:43:22] [INFO ] Deduced a trap composed of 19 places in 136 ms
[2020-05-28 00:43:22] [INFO ] Deduced a trap composed of 17 places in 206 ms
[2020-05-28 00:43:22] [INFO ] Deduced a trap composed of 28 places in 164 ms
[2020-05-28 00:43:23] [INFO ] Deduced a trap composed of 15 places in 181 ms
[2020-05-28 00:43:23] [INFO ] Deduced a trap composed of 14 places in 159 ms
[2020-05-28 00:43:23] [INFO ] Deduced a trap composed of 17 places in 126 ms
[2020-05-28 00:43:23] [INFO ] Deduced a trap composed of 16 places in 141 ms
[2020-05-28 00:43:23] [INFO ] Deduced a trap composed of 6 places in 119 ms
[2020-05-28 00:43:23] [INFO ] Deduced a trap composed of 9 places in 101 ms
[2020-05-28 00:43:23] [INFO ] Deduced a trap composed of 14 places in 96 ms
[2020-05-28 00:43:24] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2020-05-28 00:43:24] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2020-05-28 00:43:24] [INFO ] Deduced a trap composed of 13 places in 131 ms
[2020-05-28 00:43:24] [INFO ] Deduced a trap composed of 7 places in 130 ms
[2020-05-28 00:43:24] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2020-05-28 00:43:24] [INFO ] Deduced a trap composed of 11 places in 108 ms
[2020-05-28 00:43:24] [INFO ] Deduced a trap composed of 7 places in 104 ms
[2020-05-28 00:43:25] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-28 00:43:25] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-05-28 00:43:25] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-05-28 00:43:25] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3493 ms
[2020-05-28 00:43:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:43:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 89 ms returned sat
[2020-05-28 00:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:43:26] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2020-05-28 00:43:26] [INFO ] Deduced a trap composed of 14 places in 207 ms
[2020-05-28 00:43:26] [INFO ] Deduced a trap composed of 12 places in 161 ms
[2020-05-28 00:43:26] [INFO ] Deduced a trap composed of 7 places in 125 ms
[2020-05-28 00:43:27] [INFO ] Deduced a trap composed of 7 places in 153 ms
[2020-05-28 00:43:27] [INFO ] Deduced a trap composed of 12 places in 131 ms
[2020-05-28 00:43:27] [INFO ] Deduced a trap composed of 7 places in 132 ms
[2020-05-28 00:43:27] [INFO ] Deduced a trap composed of 11 places in 105 ms
[2020-05-28 00:43:27] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2020-05-28 00:43:27] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-05-28 00:43:27] [INFO ] Deduced a trap composed of 9 places in 65 ms
[2020-05-28 00:43:28] [INFO ] Deduced a trap composed of 10 places in 92 ms
[2020-05-28 00:43:28] [INFO ] Deduced a trap composed of 10 places in 78 ms
[2020-05-28 00:43:28] [INFO ] Deduced a trap composed of 9 places in 62 ms
[2020-05-28 00:43:28] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-28 00:43:28] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-05-28 00:43:28] [INFO ] Deduced a trap composed of 10 places in 85 ms
[2020-05-28 00:43:28] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2255 ms
[2020-05-28 00:43:28] [INFO ] Computed and/alt/rep : 772/4242/772 causal constraints in 77 ms.
[2020-05-28 00:43:49] [INFO ] Added : 675 causal constraints over 135 iterations in 20996 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 113 ms.
Incomplete Parikh walk after 93000 steps, including 985 resets, run finished after 588 ms. (steps per millisecond=158 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 579/579 places, 779/779 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 579 transition count 778
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 578 transition count 778
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 569 transition count 769
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 569 transition count 769
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 568 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 567 transition count 767
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 566 transition count 766
Applied a total of 26 rules in 249 ms. Remains 566 /579 variables (removed 13) and now considering 766/779 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/579 places, 766/779 transitions.
Incomplete random walk after 1000000 steps, including 2109 resets, run finished after 4389 ms. (steps per millisecond=227 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 241 resets, run finished after 2083 ms. (steps per millisecond=480 ) properties seen :[0]
Interrupted probabilistic random walk after 3744377 steps, run timeout after 30001 ms. (steps per millisecond=124 ) properties seen :[0]
Probabilistic random walk after 3744377 steps, saw 445625 distinct states, run finished after 30001 ms. (steps per millisecond=124 ) properties seen :[0]
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:44:27] [INFO ] Computed 161 place invariants in 6 ms
[2020-05-28 00:44:27] [INFO ] [Real]Absence check using 161 positive place invariants in 96 ms returned sat
[2020-05-28 00:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:44:28] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2020-05-28 00:44:28] [INFO ] Deduced a trap composed of 9 places in 311 ms
[2020-05-28 00:44:28] [INFO ] Deduced a trap composed of 7 places in 183 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 8 places in 108 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 12 places in 202 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 25 places in 48 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 21 places in 53 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 7 places in 51 ms
[2020-05-28 00:44:29] [INFO ] Deduced a trap composed of 10 places in 49 ms
[2020-05-28 00:44:30] [INFO ] Deduced a trap composed of 23 places in 53 ms
[2020-05-28 00:44:30] [INFO ] Deduced a trap composed of 27 places in 31 ms
[2020-05-28 00:44:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1654 ms
[2020-05-28 00:44:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:44:30] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2020-05-28 00:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:44:30] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 7 places in 48 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 22 places in 43 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 25 places in 51 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 23 places in 46 ms
[2020-05-28 00:44:31] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-05-28 00:44:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 762 ms
[2020-05-28 00:44:31] [INFO ] Computed and/alt/rep : 763/4099/763 causal constraints in 35 ms.
[2020-05-28 00:44:53] [INFO ] Added : 700 causal constraints over 140 iterations in 21374 ms.(timeout) Result :sat
[2020-05-28 00:44:53] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2020-05-28 00:44:53] [INFO ] Deduced a trap composed of 5 places in 65 ms
[2020-05-28 00:44:53] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-05-28 00:44:53] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2020-05-28 00:44:53] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2020-05-28 00:44:55] [INFO ] Deduced a trap composed of 10 places in 98 ms
[2020-05-28 00:44:55] [INFO ] Deduced a trap composed of 10 places in 116 ms
[2020-05-28 00:44:56] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-05-28 00:44:56] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2020-05-28 00:44:56] [INFO ] Deduced a trap composed of 9 places in 66 ms
[2020-05-28 00:44:56] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-05-28 00:44:56] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2020-05-28 00:44:57] [INFO ] Deduced a trap composed of 14 places in 71 ms
[2020-05-28 00:44:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4132 ms
Attempting to minimize the solution found.
Minimization took 119 ms.
Incomplete Parikh walk after 66400 steps, including 943 resets, run finished after 410 ms. (steps per millisecond=161 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 566 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 566/566 places, 766/766 transitions.
Applied a total of 0 rules in 21 ms. Remains 566 /566 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/566 places, 766/766 transitions.
Starting structural reductions, iteration 0 : 566/566 places, 766/766 transitions.
Applied a total of 0 rules in 18 ms. Remains 566 /566 variables (removed 0) and now considering 766/766 (removed 0) transitions.
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:44:57] [INFO ] Computed 161 place invariants in 23 ms
[2020-05-28 00:44:58] [INFO ] Implicit Places using invariants in 1091 ms returned []
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:44:58] [INFO ] Computed 161 place invariants in 11 ms
[2020-05-28 00:45:02] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 4668 ms to find 0 implicit places.
[2020-05-28 00:45:04] [INFO ] Redundant transitions in 1824 ms returned []
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:45:04] [INFO ] Computed 161 place invariants in 2 ms
[2020-05-28 00:45:05] [INFO ] Dead Transitions using invariants and state equation in 889 ms returned []
Finished structural reductions, in 1 iterations. Remains : 566/566 places, 766/766 transitions.
Incomplete random walk after 100000 steps, including 210 resets, run finished after 478 ms. (steps per millisecond=209 ) properties seen :[0]
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:45:05] [INFO ] Computed 161 place invariants in 3 ms
[2020-05-28 00:45:05] [INFO ] [Real]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-05-28 00:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:45:06] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2020-05-28 00:45:06] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-05-28 00:45:06] [INFO ] Deduced a trap composed of 7 places in 53 ms
[2020-05-28 00:45:06] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2020-05-28 00:45:06] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 25 places in 49 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 7 places in 42 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 10 places in 44 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2020-05-28 00:45:07] [INFO ] Deduced a trap composed of 27 places in 22 ms
[2020-05-28 00:45:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 986 ms
[2020-05-28 00:45:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:45:07] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2020-05-28 00:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:45:08] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-05-28 00:45:08] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-05-28 00:45:08] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2020-05-28 00:45:08] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2020-05-28 00:45:08] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2020-05-28 00:45:08] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2020-05-28 00:45:08] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-05-28 00:45:08] [INFO ] Deduced a trap composed of 25 places in 40 ms
[2020-05-28 00:45:09] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2020-05-28 00:45:09] [INFO ] Deduced a trap composed of 23 places in 39 ms
[2020-05-28 00:45:09] [INFO ] Deduced a trap composed of 29 places in 32 ms
[2020-05-28 00:45:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 819 ms
[2020-05-28 00:45:09] [INFO ] Computed and/alt/rep : 763/4099/763 causal constraints in 32 ms.
[2020-05-28 00:45:27] [INFO ] Added : 675 causal constraints over 135 iterations in 18390 ms. Result :unknown
Applied a total of 0 rules in 28 ms. Remains 566 /566 variables (removed 0) and now considering 766/766 (removed 0) transitions.
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:45:27] [INFO ] Computed 161 place invariants in 5 ms
[2020-05-28 00:45:28] [INFO ] [Real]Absence check using 161 positive place invariants in 168 ms returned sat
[2020-05-28 00:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:45:28] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 7 places in 46 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 12 places in 47 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 25 places in 41 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 21 places in 40 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 7 places in 41 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 10 places in 60 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 23 places in 32 ms
[2020-05-28 00:45:29] [INFO ] Deduced a trap composed of 27 places in 43 ms
[2020-05-28 00:45:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 963 ms
[2020-05-28 00:45:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:45:30] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2020-05-28 00:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:45:30] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2020-05-28 00:45:30] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-05-28 00:45:30] [INFO ] Deduced a trap composed of 7 places in 53 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 12 places in 51 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 22 places in 49 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 25 places in 39 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 23 places in 42 ms
[2020-05-28 00:45:31] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2020-05-28 00:45:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 695 ms
[2020-05-28 00:45:31] [INFO ] Computed and/alt/rep : 763/4099/763 causal constraints in 39 ms.
[2020-05-28 00:45:53] [INFO ] Added : 705 causal constraints over 141 iterations in 21901 ms.(timeout) Result :sat
[2020-05-28 00:45:53] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2020-05-28 00:45:53] [INFO ] Deduced a trap composed of 8 places in 108 ms
[2020-05-28 00:45:53] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-05-28 00:45:54] [INFO ] Deduced a trap composed of 10 places in 55 ms
[2020-05-28 00:45:54] [INFO ] Deduced a trap composed of 9 places in 66 ms
[2020-05-28 00:45:54] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2020-05-28 00:45:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1226 ms
Attempting to minimize the solution found.
Minimization took 114 ms.
[2020-05-28 00:45:55] [INFO ] Flatten gal took : 283 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 00:45:55] [INFO ] Applying decomposition
[2020-05-28 00:45:55] [INFO ] Flatten gal took : 179 ms
[2020-05-28 00:45:55] [INFO ] Flatten gal took : 147 ms
[2020-05-28 00:45:56] [INFO ] Input system was already deterministic with 766 transitions.
[2020-05-28 00:45:56] [INFO ] Input system was already deterministic with 766 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph18244510677567960114.txt, -o, /tmp/graph18244510677567960114.bin, -w, /tmp/graph18244510677567960114.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph18244510677567960114.bin, -l, -1, -v, -w, /tmp/graph18244510677567960114.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 00:45:56] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:45:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 00:45:56] [INFO ] Computed 161 place invariants in 16 ms
inv : p330 + p332 = 1
inv : p864 + p880 + p882 + p884 + p886 + p888 = 1
inv : p527 + p528 = 1
inv : p671 + p673 + p675 + p677 = 1
inv : p632 + p634 + p636 + p638 = 1
inv : p1490 + p1492 + p1494 + p1496 = 1
inv : p1036 + p1038 + p1040 + p1042 = 1
inv : p100 + p102 + p104 + p106 = 1
inv : p812 + p815 + p817 + p819 = 1
inv : p749 + p751 + p753 + p755 = 1
inv : p958 + p960 + p962 + p964 = 1
inv : p258 + p260 + p262 + p264 = 1
inv : p1568 + p1572 + p1574 = 1
inv : p890 + p893 + p895 + p897 = 1
inv : p1334 + p1336 + p1338 + p1340 = 1
inv : p1270 + p1272 + p1274 + p1276 = 1
inv : p135 + p137 = 1
inv : p556 + p558 + p560 + p562 = 1
inv : p1305 + p1307 = 1
inv : p954 + p956 = 1
inv : p490 + p492 + p494 + p496 = 1
inv : p398 + p400 + p402 + p404 = 1
inv : p1178 + p1180 + p1182 + p1184 = 1
inv : p1046 + p1049 + p1051 + p1053 = 1
inv : p734 + p737 + p739 + p741 = 1
inv : p1256 + p1258 + p1260 + p1262 = 1
inv : p1475 + p1478 + p1480 + p1482 = 1
inv : p110 + p113 + p115 + p117 = 1
inv : p334 + p336 + p338 + p340 = 1
inv : p447 + p449 = 1
inv : p1422 + p1424 = 1
inv : p1592 + p1595 + p1597 + p1599 = 1
inv : p476 + p478 + p480 + p482 = 1
inv : p968 + p971 + p973 + p975 = 1
inv : p1192 + p1194 + p1196 + p1198 = 1
inv : p1227 + p1229 = 1
inv : p642 + p644 = 1
inv : p1553 + p1556 + p1558 + p1560 = 1
inv : p252 + p254 = 1
inv : p412 + p414 + p416 + p418 = 1
inv : p827 + p829 + p831 + p833 = 1
inv : p1280 + p1283 + p1285 + p1287 = 1
inv : p837 + p839 = 1
inv : p1061 + p1063 + p1065 + p1067 = 1
inv : p57 + p59 = 1
inv : p1319 + p1322 + p1324 + p1326 = 1
inv : p383 + p386 + p388 + p390 = 1
inv : p763 + p765 + p767 + p769 = 1
inv : p47 + p49 + p51 + p53 = 1
inv : p1539 + p1541 = 1
inv : p500 + p503 + p505 + p507 = 1
inv : p408 + p410 = 1
inv : p1344 + p1346 = 1
inv : p344 + p347 + p349 + p351 = 1
inv : p603 + p605 = 1
inv : p944 + p946 + p948 + p950 = 1
inv : p1149 + p1151 = 1
inv : p1358 + p1361 + p1363 + p1365 = 1
inv : p657 + p659 + p661 + p663 + p665 = 1
inv : p149 + p152 + p154 + p156 = 1
inv : p86 + p88 + p90 + p92 = 1
inv : p1163 + p1166 + p1168 + p1170 = 1
inv : p188 + p191 + p193 + p195 = 1
inv : p1217 + p1219 + p1221 + p1223 = 1
inv : p451 + p453 + p455 + p457 = 1
inv : p681 + p683 = 1
inv : p919 + p921 + p923 + p925 = 1
inv : p1231 + p1233 + p1235 + p1237 = 1
inv : p1032 + p1034 = 1
inv : p242 + p244 + p246 + p248 = 1
inv : p905 + p907 + p909 + p911 = 1
inv : p213 + p215 = 1
inv : p1188 + p1190 = 1
inv : p788 + p790 + p792 + p794 = 1
inv : p1383 + p1385 = 1
inv : p1426 + p1428 + p1430 + p1432 = 1
inv : p1412 + p1414 + p1416 + p1418 = 1
inv : p1096 + p1098 + p1114 + p1116 + p1118 + p1120 = 1
inv : p437 + p439 + p441 + p443 = 1
inv : p1514 + p1517 + p1519 + p1521 = 1
inv : p1007 + p1010 + p1012 + p1014 = 1
inv : p695 + p698 + p700 + p702 = 1
inv : p802 + p804 + p806 + p808 = 1
inv : p646 + p648 + p650 + p652 = 1
inv : p539 + p542 + p544 + p546 = 1
inv : p139 + p141 + p143 + p145 = 1
inv : p993 + p995 = 1
inv : p61 + p63 + p65 + p67 = 1
inv : p1529 + p1531 + p1533 + p1535 = 1
inv : p1266 + p1268 = 1
inv : p1096 + p1124 + p1127 + p1129 + p1131 = 1
inv : p929 + p932 + p934 + p936 = 1
inv : p1461 + p1463 = 1
inv : p217 + p219 + p221 + p223 = 1
inv : p997 + p999 + p1001 + p1003 = 1
inv : p1096 + p1098 + p1100 + p1102 + p1104 + p1106 = 1
inv : p1373 + p1375 + p1377 + p1379 = 1
inv : p515 + p517 + p519 + p521 = 1
inv : p295 + p297 + p299 + p301 = 1
inv : p851 + p854 + p856 + p858 = 1
inv : p864 + p866 + p868 + p870 + p872 = 1
inv : p773 + p776 + p778 + p780 = 1
inv : p593 + p595 + p597 + p599 = 1
inv : p1295 + p1297 + p1299 + p1301 = 1
inv : p710 + p712 + p714 + p716 = 1
inv : p1309 + p1311 + p1313 + p1315 = 1
inv : p564 + p566 = 1
inv : p40 + p42 = 1
inv : p369 + p371 = 1
inv : p281 + p283 + p285 + p287 = 1
inv : p174 + p176 = 1
inv : p1465 + p1467 + p1469 + p1471 = 1
inv : p578 + p581 + p583 + p585 = 1
inv : p1071 + p1073 = 1
inv : p607 + p609 + p611 + p613 = 1
inv : p841 + p843 + p845 + p847 = 1
inv : p1075 + p1077 + p1079 + p1081 = 1
inv : p305 + p308 + p310 + p312 = 1
inv : p1451 + p1453 + p1455 + p1457 = 1
inv : p1387 + p1389 + p1391 + p1393 = 1
inv : p205 + p207 + p209 + p211 = 1
inv : p720 + p722 = 1
inv : p685 + p687 + p689 + p691 = 1
inv : p1202 + p1205 + p1207 + p1209 = 1
inv : p461 + p464 + p466 + p468 = 1
inv : p125 + p127 + p129 + p131 = 1
inv : p724 + p726 + p728 + p730 = 1
inv : p1241 + p1244 + p1246 + p1248 = 1
inv : p915 + p917 = 1
inv : p227 + p230 + p232 + p234 = 1
inv : p1436 + p1439 + p1441 + p1443 = 1
inv : p864 + p876 + p878 = 1
inv : p1504 + p1506 + p1508 + p1510 = 1
inv : p617 + p620 + p622 + p624 = 1
inv : p1397 + p1400 + p1402 + p1404 = 1
inv : p983 + p985 + p987 + p989 = 1
inv : p1582 + p1584 + p1586 + p1588 = 1
inv : p798 + p800 = 1
inv : p529 + p531 + p533 + p535 = 1
inv : p1543 + p1545 + p1547 + p1549 = 1
inv : p1500 + p1502 = 1
inv : p1096 + p1098 + p1110 + p1112 = 1
inv : p1022 + p1024 + p1026 + p1028 = 1
inv : p422 + p425 + p427 + p429 = 1
inv : p320 + p322 + p324 + p326 = 1
inv : p359 + p361 + p363 + p365 = 1
inv : p96 + p98 = 1
inv : p71 + p74 + p76 + p78 = 1
inv : p373 + p375 + p377 + p379 = 1
inv : p1085 + p1088 + p1090 + p1092 = 1
inv : p568 + p570 + p572 + p574 = 1
inv : p486 + p488 = 1
inv : p1348 + p1350 + p1352 + p1354 = 1
inv : p1139 + p1141 + p1143 + p1145 = 1
inv : p291 + p293 = 1
inv : p1153 + p1155 + p1157 + p1159 = 1
inv : p759 + p761 = 1
inv : p1578 + p1580 = 1
inv : p164 + p166 + p168 + p170 = 1
inv : p266 + p269 + p271 + p273 = 1
inv : p178 + p180 + p182 + p184 = 1
Total of 161 invariants.
[2020-05-28 00:45:56] [INFO ] Computed 161 place invariants in 33 ms
[2020-05-28 00:45:56] [INFO ] Removed a total of 890 redundant transitions.
[2020-05-28 00:45:56] [INFO ] Flatten gal took : 155 ms
[2020-05-28 00:45:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 965 labels/synchronizations in 60 ms.
[2020-05-28 00:45:56] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 35 ms
[2020-05-28 00:45:56] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
[2020-05-28 00:45:57] [INFO ] Ran tautology test, simplified 0 / 1 in 1206 ms.
Loading property file ReachabilityFireability.prop.
Read [invariant] property : ShieldRVs-PT-040B-ReachabilityFireability-07 with value :(((i6.i1.u54.p657!=1)||(i9.i0.u77.p880!=1))||((i13.u110.p1237!=1)&&(i12.i0.u96.p1098!=1)))
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-28 00:45:57] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=0 took 64 ms
[2020-05-28 00:45:57] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=1 took 1 ms
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 766 rows 566 cols
[2020-05-28 00:45:57] [INFO ] Computed 161 place invariants in 2 ms
inv : p330 + p332 = 1
inv : p864 + p880 + p882 + p884 + p886 + p888 = 1
inv : p527 + p528 = 1
inv : p671 + p673 + p675 + p677 = 1
inv : p632 + p634 + p636 + p638 = 1
inv : p1490 + p1492 + p1494 + p1496 = 1
inv : p1036 + p1038 + p1040 + p1042 = 1
inv : p100 + p102 + p104 + p106 = 1
inv : p812 + p815 + p817 + p819 = 1
inv : p749 + p751 + p753 + p755 = 1
inv : p958 + p960 + p962 + p964 = 1
inv : p258 + p260 + p262 + p264 = 1
inv : p1568 + p1572 + p1574 = 1
inv : p890 + p893 + p895 + p897 = 1
inv : p1334 + p1336 + p1338 + p1340 = 1
inv : p1270 + p1272 + p1274 + p1276 = 1
inv : p135 + p137 = 1
inv : p556 + p558 + p560 + p562 = 1
inv : p1305 + p1307 = 1
inv : p954 + p956 = 1
inv : p490 + p492 + p494 + p496 = 1
inv : p398 + p400 + p402 + p404 = 1
inv : p1178 + p1180 + p1182 + p1184 = 1
inv : p1046 + p1049 + p1051 + p1053 = 1
inv : p734 + p737 + p739 + p741 = 1
inv : p1256 + p1258 + p1260 + p1262 = 1
inv : p1475 + p1478 + p1480 + p1482 = 1
inv : p110 + p113 + p115 + p117 = 1
inv : p334 + p336 + p338 + p340 = 1
inv : p447 + p449 = 1
inv : p1422 + p1424 = 1
inv : p1592 + p1595 + p1597 + p1599 = 1
inv : p476 + p478 + p480 + p482 = 1
inv : p968 + p971 + p973 + p975 = 1
inv : p1192 + p1194 + p1196 + p1198 = 1
inv : p1227 + p1229 = 1
inv : p642 + p644 = 1
inv : p1553 + p1556 + p1558 + p1560 = 1
inv : p252 + p254 = 1
inv : p412 + p414 + p416 + p418 = 1
inv : p827 + p829 + p831 + p833 = 1
inv : p1280 + p1283 + p1285 + p1287 = 1
inv : p837 + p839 = 1
inv : p1061 + p1063 + p1065 + p1067 = 1
inv : p57 + p59 = 1
inv : p1319 + p1322 + p1324 + p1326 = 1
inv : p383 + p386 + p388 + p390 = 1
inv : p763 + p765 + p767 + p769 = 1
inv : p47 + p49 + p51 + p53 = 1
inv : p1539 + p1541 = 1
inv : p500 + p503 + p505 + p507 = 1
inv : p408 + p410 = 1
inv : p1344 + p1346 = 1
inv : p344 + p347 + p349 + p351 = 1
inv : p603 + p605 = 1
inv : p944 + p946 + p948 + p950 = 1
inv : p1149 + p1151 = 1
inv : p1358 + p1361 + p1363 + p1365 = 1
inv : p657 + p659 + p661 + p663 + p665 = 1
inv : p149 + p152 + p154 + p156 = 1
inv : p86 + p88 + p90 + p92 = 1
inv : p1163 + p1166 + p1168 + p1170 = 1
inv : p188 + p191 + p193 + p195 = 1
inv : p1217 + p1219 + p1221 + p1223 = 1
inv : p451 + p453 + p455 + p457 = 1
inv : p681 + p683 = 1
inv : p919 + p921 + p923 + p925 = 1
inv : p1231 + p1233 + p1235 + p1237 = 1
inv : p1032 + p1034 = 1
inv : p242 + p244 + p246 + p248 = 1
inv : p905 + p907 + p909 + p911 = 1
inv : p213 + p215 = 1
inv : p1188 + p1190 = 1
inv : p788 + p790 + p792 + p794 = 1
inv : p1383 + p1385 = 1
inv : p1426 + p1428 + p1430 + p1432 = 1
inv : p1412 + p1414 + p1416 + p1418 = 1
inv : p1096 + p1098 + p1114 + p1116 + p1118 + p1120 = 1
inv : p437 + p439 + p441 + p443 = 1
inv : p1514 + p1517 + p1519 + p1521 = 1
inv : p1007 + p1010 + p1012 + p1014 = 1
inv : p695 + p698 + p700 + p702 = 1
inv : p802 + p804 + p806 + p808 = 1
inv : p646 + p648 + p650 + p652 = 1
inv : p539 + p542 + p544 + p546 = 1
inv : p139 + p141 + p143 + p145 = 1
inv : p993 + p995 = 1
inv : p61 + p63 + p65 + p67 = 1
inv : p1529 + p1531 + p1533 + p1535 = 1
inv : p1266 + p1268 = 1
inv : p1096 + p1124 + p1127 + p1129 + p1131 = 1
inv : p929 + p932 + p934 + p936 = 1
inv : p1461 + p1463 = 1
inv : p217 + p219 + p221 + p223 = 1
inv : p997 + p999 + p1001 + p1003 = 1
inv : p1096 + p1098 + p1100 + p1102 + p1104 + p1106 = 1
inv : p1373 + p1375 + p1377 + p1379 = 1
inv : p515 + p517 + p519 + p521 = 1
inv : p295 + p297 + p299 + p301 = 1
inv : p851 + p854 + p856 + p858 = 1
inv : p864 + p866 + p868 + p870 + p872 = 1
inv : p773 + p776 + p778 + p780 = 1
inv : p593 + p595 + p597 + p599 = 1
inv : p1295 + p1297 + p1299 + p1301 = 1
inv : p710 + p712 + p714 + p716 = 1
inv : p1309 + p1311 + p1313 + p1315 = 1
inv : p564 + p566 = 1
inv : p40 + p42 = 1
inv : p369 + p371 = 1
inv : p281 + p283 + p285 + p287 = 1
inv : p174 + p176 = 1
inv : p1465 + p1467 + p1469 + p1471 = 1
inv : p578 + p581 + p583 + p585 = 1
inv : p1071 + p1073 = 1
inv : p607 + p609 + p611 + p613 = 1
inv : p841 + p843 + p845 + p847 = 1
inv : p1075 + p1077 + p1079 + p1081 = 1
inv : p305 + p308 + p310 + p312 = 1
inv : p1451 + p1453 + p1455 + p1457 = 1
inv : p1387 + p1389 + p1391 + p1393 = 1
inv : p205 + p207 + p209 + p211 = 1
inv : p720 + p722 = 1
inv : p685 + p687 + p689 + p691 = 1
inv : p1202 + p1205 + p1207 + p1209 = 1
inv : p461 + p464 + p466 + p468 = 1
inv : p125 + p127 + p129 + p131 = 1
inv : p724 + p726 + p728 + p730 = 1
inv : p1241 + p1244 + p1246 + p1248 = 1
inv : p915 + p917 = 1
inv : p227 + p230 + p232 + p234 = 1
inv : p1436 + p1439 + p1441 + p1443 = 1
inv : p864 + p876 + p878 = 1
inv : p1504 + p1506 + p1508 + p1510 = 1
inv : p617 + p620 + p622 + p624 = 1
inv : p1397 + p1400 + p1402 + p1404 = 1
inv : p983 + p985 + p987 + p989 = 1
inv : p1582 + p1584 + p1586 + p1588 = 1
inv : p798 + p800 = 1
inv : p529 + p531 + p533 + p535 = 1
inv : p1543 + p1545 + p1547 + p1549 = 1
inv : p1500 + p1502 = 1
inv : p1096 + p1098 + p1110 + p1112 = 1
inv : p1022 + p1024 + p1026 + p1028 = 1
inv : p422 + p425 + p427 + p429 = 1
inv : p320 + p322 + p324 + p326 = 1
inv : p359 + p361 + p363 + p365 = 1
inv : p96 + p98 = 1
inv : p71 + p74 + p76 + p78 = 1
inv : p373 + p375 + p377 + p379 = 1
inv : p1085 + p1088 + p1090 + p1092 = 1
inv : p568 + p570 + p572 + p574 = 1
inv : p486 + p488 = 1
inv : p1348 + p1350 + p1352 + p1354 = 1
inv : p1139 + p1141 + p1143 + p1145 = 1
inv : p291 + p293 = 1
inv : p1153 + p1155 + p1157 + p1159 = 1
inv : p759 + p761 = 1
inv : p1578 + p1580 = 1
inv : p164 + p166 + p168 + p170 = 1
inv : p266 + p269 + p271 + p273 = 1
inv : p178 + p180 + p182 + p184 = 1
Total of 161 invariants.
[2020-05-28 00:45:57] [INFO ] Computed 161 place invariants in 4 ms
[2020-05-28 00:45:57] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=2 took 236 ms
SDD proceeding with computation, new max is 4096
[2020-05-28 00:45:57] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=3 took 295 ms
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
[2020-05-28 00:46:00] [INFO ] Proved 566 variables to be positive in 3103 ms
[2020-05-28 00:46:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-07
[2020-05-28 00:46:00] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(SAT) depth K=0 took 60 ms
[2020-05-28 00:46:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-07
[2020-05-28 00:46:00] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(SAT) depth K=1 took 163 ms
[2020-05-28 00:46:01] [INFO ] Proved 566 variables to be positive in 4762 ms
[2020-05-28 00:46:01] [INFO ] Computing symmetric may disable matrix : 766 transitions.
[2020-05-28 00:46:01] [INFO ] Computation of disable matrix completed :0/766 took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:46:01] [INFO ] Computation of Complete disable matrix. took 177 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:46:01] [INFO ] Computing symmetric may enable matrix : 766 transitions.
[2020-05-28 00:46:01] [INFO ] Computation of Complete enable matrix. took 129 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:46:01] [INFO ] Computing symmetric co enabling matrix : 766 transitions.
[2020-05-28 00:46:04] [INFO ] Computation of co-enabling matrix(80/766) took 2993 ms. Total solver calls (SAT/UNSAT): 1013(162/851)
[2020-05-28 00:46:09] [INFO ] Computation of co-enabling matrix(124/766) took 7366 ms. Total solver calls (SAT/UNSAT): 1577(250/1327)
[2020-05-28 00:46:12] [INFO ] Computation of co-enabling matrix(221/766) took 10384 ms. Total solver calls (SAT/UNSAT): 3033(380/2653)
[2020-05-28 00:46:15] [INFO ] Computation of co-enabling matrix(290/766) took 13689 ms. Total solver calls (SAT/UNSAT): 4525(591/3934)
SDD proceeding with computation, new max is 32768
[2020-05-28 00:46:18] [INFO ] Computation of co-enabling matrix(338/766) took 16689 ms. Total solver calls (SAT/UNSAT): 5281(683/4598)
[2020-05-28 00:46:21] [INFO ] Computation of co-enabling matrix(421/766) took 19699 ms. Total solver calls (SAT/UNSAT): 6158(752/5406)
[2020-05-28 00:46:24] [INFO ] Computation of co-enabling matrix(535/766) took 22714 ms. Total solver calls (SAT/UNSAT): 7429(849/6580)
[2020-05-28 00:46:27] [INFO ] Computation of co-enabling matrix(586/766) took 25717 ms. Total solver calls (SAT/UNSAT): 7947(889/7058)
[2020-05-28 00:46:30] [INFO ] Computation of co-enabling matrix(617/766) took 28725 ms. Total solver calls (SAT/UNSAT): 8269(912/7357)
[2020-05-28 00:46:32] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=4 took 34847 ms
[2020-05-28 00:46:33] [INFO ] Computation of co-enabling matrix(647/766) took 31729 ms. Total solver calls (SAT/UNSAT): 8572(936/7636)
[2020-05-28 00:46:36] [INFO ] Computation of co-enabling matrix(746/766) took 34745 ms. Total solver calls (SAT/UNSAT): 8784(958/7826)
[2020-05-28 00:46:36] [INFO ] Computation of Finished co-enabling matrix. took 35227 ms. Total solver calls (SAT/UNSAT): 8810(960/7850)
[2020-05-28 00:46:37] [INFO ] Computing Do-Not-Accords matrix : 766 transitions.
[2020-05-28 00:46:37] [INFO ] Computation of Completed DNA matrix. took 163 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:46:37] [INFO ] Built C files in 41366ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 17929 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 105 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT040BReachabilityFireability07==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT040BReachabilityFireability07==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT040BReachabilityFireability07==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 65536
[2020-05-28 00:48:09] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=5 took 97255 ms
SDD proceeding with computation, new max is 131072
[2020-05-28 00:51:50] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=6 took 220277 ms
[2020-05-28 00:51:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-07
[2020-05-28 00:51:58] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(SAT) depth K=2 took 357882 ms
SDD proceeding with computation, new max is 262144
[2020-05-28 01:01:16] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-07(UNSAT) depth K=7 took 566023 ms
Detected timeout of ITS tools.
[2020-05-28 01:07:02] [INFO ] Applying decomposition
[2020-05-28 01:07:02] [INFO ] Flatten gal took : 100 ms
[2020-05-28 01:07:02] [INFO ] Decomposing Gal with order
[2020-05-28 01:07:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:07:02] [INFO ] Removed a total of 919 redundant transitions.
[2020-05-28 01:07:02] [INFO ] Flatten gal took : 147 ms
[2020-05-28 01:07:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1401 labels/synchronizations in 36 ms.
[2020-05-28 01:07:02] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 26 ms
[2020-05-28 01:07:02] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [invariant] property : ShieldRVs-PT-040B-ReachabilityFireability-07 with value :(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u152.p657!=1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u193.p880!=1))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u256.p1237!=1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u390.p1098!=1)))
built 1 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.62352e+21,136.129,909416,1717,32,1.15279e+06,52,481,4.93583e+06,58,262,0
Total reachable state count : 3623517084941985476864
Verifying 1 reachability properties.
Invariant property ShieldRVs-PT-040B-ReachabilityFireability-07 is true.
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVs-PT-040B-ReachabilityFireability-07,0,136.286,909416,1,0,1.15279e+06,52,572,4.93583e+06,61,262,747
[2020-05-28 01:09:19] [WARNING] Interrupting SMT solver.
[2020-05-28 01:09:19] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-28 01:09:19] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVs-PT-040B-ReachabilityFireability-07 K-induction depth 3
Exception in thread "Thread-7" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-28 01:09:19] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-28 01:09:19] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVs-PT-040B-ReachabilityFireability-07 SMT depth 8
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-28 01:09:19] [INFO ] During BMC, SMT solver timed out at depth 8
[2020-05-28 01:09:19] [INFO ] BMC solving timed out (3600000 secs) at depth 8
[2020-05-28 01:09:19] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
BK_STOP 1590628159716
--------------------
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="ShieldRVs-PT-040B"
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 ShieldRVs-PT-040B, 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 r210-tajo-159033476400887"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040B.tgz
mv ShieldRVs-PT-040B 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 '
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 ;