About the Execution of ITS-Tools for DES-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15756.950 | 104891.00 | 146537.00 | 177.00 | TTTTTFFTTTFTFTFT | 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.r051-ebro-158902545900255.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 DES-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900255
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 4.0K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 28 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 79K 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 DES-PT-10b-ReachabilityFireability-00
FORMULA_NAME DES-PT-10b-ReachabilityFireability-01
FORMULA_NAME DES-PT-10b-ReachabilityFireability-02
FORMULA_NAME DES-PT-10b-ReachabilityFireability-03
FORMULA_NAME DES-PT-10b-ReachabilityFireability-04
FORMULA_NAME DES-PT-10b-ReachabilityFireability-05
FORMULA_NAME DES-PT-10b-ReachabilityFireability-06
FORMULA_NAME DES-PT-10b-ReachabilityFireability-07
FORMULA_NAME DES-PT-10b-ReachabilityFireability-08
FORMULA_NAME DES-PT-10b-ReachabilityFireability-09
FORMULA_NAME DES-PT-10b-ReachabilityFireability-10
FORMULA_NAME DES-PT-10b-ReachabilityFireability-11
FORMULA_NAME DES-PT-10b-ReachabilityFireability-12
FORMULA_NAME DES-PT-10b-ReachabilityFireability-13
FORMULA_NAME DES-PT-10b-ReachabilityFireability-14
FORMULA_NAME DES-PT-10b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1589538236852
[2020-05-15 10:23:59] [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-15 10:23:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 10:24:00] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2020-05-15 10:24:00] [INFO ] Transformed 320 places.
[2020-05-15 10:24:00] [INFO ] Transformed 271 transitions.
[2020-05-15 10:24:00] [INFO ] Found NUPN structural information;
[2020-05-15 10:24:00] [INFO ] Parsed PT model containing 320 places and 271 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 90 resets, run finished after 156 ms. (steps per millisecond=64 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1]
FORMULA DES-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 271 rows 320 cols
[2020-05-15 10:24:00] [INFO ] Computed 65 place invariants in 37 ms
[2020-05-15 10:24:00] [INFO ] [Real]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-05-15 10:24:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2020-05-15 10:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:01] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2020-05-15 10:24:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:24:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-05-15 10:24:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-05-15 10:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:02] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2020-05-15 10:24:02] [INFO ] Deduced a trap composed of 16 places in 162 ms
[2020-05-15 10:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2020-05-15 10:24:02] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 37 ms.
[2020-05-15 10:24:05] [INFO ] Added : 262 causal constraints over 53 iterations in 2955 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-15 10:24:06] [INFO ] [Real]Absence check using 39 positive place invariants in 49 ms returned sat
[2020-05-15 10:24:06] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 10:24:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:07] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2020-05-15 10:24:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:24:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 49 ms returned sat
[2020-05-15 10:24:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 74 ms returned sat
[2020-05-15 10:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:09] [INFO ] [Nat]Absence check using state equation in 2479 ms returned sat
[2020-05-15 10:24:10] [INFO ] Deduced a trap composed of 39 places in 185 ms
[2020-05-15 10:24:10] [INFO ] Deduced a trap composed of 34 places in 205 ms
[2020-05-15 10:24:10] [INFO ] Deduced a trap composed of 31 places in 120 ms
[2020-05-15 10:24:10] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2020-05-15 10:24:10] [INFO ] Deduced a trap composed of 32 places in 102 ms
[2020-05-15 10:24:10] [INFO ] Deduced a trap composed of 31 places in 65 ms
[2020-05-15 10:24:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1029 ms
[2020-05-15 10:24:10] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 33 ms.
[2020-05-15 10:24:12] [INFO ] Added : 135 causal constraints over 27 iterations in 1321 ms. Result :(error "Failed to check-sat")
[2020-05-15 10:24:12] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2020-05-15 10:24:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2020-05-15 10:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:12] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2020-05-15 10:24:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:24:13] [INFO ] [Nat]Absence check using 39 positive place invariants in 58 ms returned sat
[2020-05-15 10:24:13] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-05-15 10:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:13] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2020-05-15 10:24:14] [INFO ] Deduced a trap composed of 14 places in 263 ms
[2020-05-15 10:24:14] [INFO ] Deduced a trap composed of 12 places in 215 ms
[2020-05-15 10:24:14] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2020-05-15 10:24:14] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2020-05-15 10:24:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 827 ms
[2020-05-15 10:24:14] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 36 ms.
[2020-05-15 10:24:17] [INFO ] Added : 260 causal constraints over 53 iterations in 2807 ms. Result :sat
[2020-05-15 10:24:17] [INFO ] Deduced a trap composed of 46 places in 171 ms
[2020-05-15 10:24:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-15 10:24:17] [INFO ] [Real]Absence check using 39 positive place invariants in 49 ms returned sat
[2020-05-15 10:24:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2020-05-15 10:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:18] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2020-05-15 10:24:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:24:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-05-15 10:24:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 43 ms returned sat
[2020-05-15 10:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:19] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2020-05-15 10:24:19] [INFO ] Deduced a trap composed of 8 places in 136 ms
[2020-05-15 10:24:19] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-05-15 10:24:19] [INFO ] Deduced a trap composed of 12 places in 123 ms
[2020-05-15 10:24:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2020-05-15 10:24:19] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 45 ms.
[2020-05-15 10:24:22] [INFO ] Added : 224 causal constraints over 45 iterations in 2675 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-05-15 10:24:22] [INFO ] [Real]Absence check using 39 positive place invariants in 39 ms returned sat
[2020-05-15 10:24:22] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 10:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:23] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2020-05-15 10:24:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:24:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 57 ms returned sat
[2020-05-15 10:24:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 10:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:24] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2020-05-15 10:24:24] [INFO ] Deduced a trap composed of 23 places in 182 ms
[2020-05-15 10:24:24] [INFO ] Deduced a trap composed of 21 places in 71 ms
[2020-05-15 10:24:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2020-05-15 10:24:25] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 93 ms.
[2020-05-15 10:24:27] [INFO ] Added : 238 causal constraints over 48 iterations in 2750 ms. Result :sat
[2020-05-15 10:24:27] [INFO ] Deduced a trap composed of 31 places in 100 ms
[2020-05-15 10:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
Attempting to minimize the solution found.
Minimization took 38 ms.
Incomplete Parikh walk after 41200 steps, including 443 resets, run finished after 292 ms. (steps per millisecond=141 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 14700 steps, including 180 resets, run finished after 71 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 1, 1] could not realise parikh vector
FORMULA DES-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 178700 steps, including 1919 resets, run finished after 690 ms. (steps per millisecond=258 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 168000 steps, including 1787 resets, run finished after 617 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 30 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 271/271 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.13 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 309 transition count 251
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 296 transition count 251
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 29 place count 296 transition count 244
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 43 place count 289 transition count 244
Symmetric choice reduction at 2 with 20 rule applications. Total rules 63 place count 289 transition count 244
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 103 place count 269 transition count 224
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 269 transition count 224
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 139 place count 257 transition count 212
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 151 place count 257 transition count 200
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 154 place count 255 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 255 transition count 198
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 254 transition count 198
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 278 place count 193 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 282 place count 191 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 191 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 189 transition count 137
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 189 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 290 place count 187 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 292 place count 187 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 186 transition count 134
Applied a total of 293 rules in 237 ms. Remains 186 /320 variables (removed 134) and now considering 134/271 (removed 137) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/320 places, 134/271 transitions.
Incomplete random walk after 1000000 steps, including 17268 resets, run finished after 3635 ms. (steps per millisecond=275 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3016 resets, run finished after 1736 ms. (steps per millisecond=576 ) properties seen :[1, 0, 0]
FORMULA DES-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3333 resets, run finished after 2833 ms. (steps per millisecond=352 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3267 resets, run finished after 1868 ms. (steps per millisecond=535 ) properties seen :[0, 0]
// Phase 1: matrix 134 rows 186 cols
[2020-05-15 10:24:40] [INFO ] Computed 61 place invariants in 15 ms
[2020-05-15 10:24:40] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-15 10:24:40] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 10:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:40] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-05-15 10:24:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:24:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-05-15 10:24:40] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 85 ms returned sat
[2020-05-15 10:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:40] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2020-05-15 10:24:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 10:24:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 10:24:41] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2020-05-15 10:24:41] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-05-15 10:24:41] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-05-15 10:24:41] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2020-05-15 10:24:41] [INFO ] Deduced a trap composed of 26 places in 57 ms
[2020-05-15 10:24:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 458 ms
[2020-05-15 10:24:41] [INFO ] Computed and/alt/rep : 133/524/133 causal constraints in 17 ms.
[2020-05-15 10:24:42] [INFO ] Added : 125 causal constraints over 25 iterations in 869 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-15 10:24:42] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2020-05-15 10:24:42] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2020-05-15 10:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:42] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-05-15 10:24:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:24:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 39 ms returned sat
[2020-05-15 10:24:42] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 10:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:24:43] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-15 10:24:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 10:24:43] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2020-05-15 10:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2020-05-15 10:24:43] [INFO ] Computed and/alt/rep : 133/524/133 causal constraints in 15 ms.
[2020-05-15 10:24:43] [INFO ] Added : 122 causal constraints over 25 iterations in 820 ms. Result :sat
[2020-05-15 10:24:44] [INFO ] Deduced a trap composed of 32 places in 52 ms
[2020-05-15 10:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 35400 steps, including 591 resets, run finished after 141 ms. (steps per millisecond=251 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 54500 steps, including 889 resets, run finished after 201 ms. (steps per millisecond=271 ) properties seen :[0, 0] could not realise parikh vector
Support contains 24 out of 186 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 186/186 places, 134/134 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 185 transition count 133
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 182 transition count 130
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 182 transition count 129
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 181 transition count 128
Applied a total of 11 rules in 35 ms. Remains 181 /186 variables (removed 5) and now considering 128/134 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/186 places, 128/134 transitions.
Incomplete random walk after 1000000 steps, including 18313 resets, run finished after 3554 ms. (steps per millisecond=281 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3626 resets, run finished after 2881 ms. (steps per millisecond=347 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3402 resets, run finished after 1804 ms. (steps per millisecond=554 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9613375 steps, run timeout after 30001 ms. (steps per millisecond=320 ) properties seen :[0, 0]
Probabilistic random walk after 9613375 steps, saw 1044653 distinct states, run finished after 30001 ms. (steps per millisecond=320 ) properties seen :[0, 0]
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:22] [INFO ] Computed 61 place invariants in 8 ms
[2020-05-15 10:25:22] [INFO ] [Real]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-05-15 10:25:22] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 10:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:23] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2020-05-15 10:25:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:25:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-05-15 10:25:23] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 41 ms returned sat
[2020-05-15 10:25:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:23] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2020-05-15 10:25:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 10:25:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 10:25:23] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-05-15 10:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-15 10:25:23] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 18 ms.
[2020-05-15 10:25:24] [INFO ] Added : 121 causal constraints over 25 iterations in 844 ms. Result :sat
[2020-05-15 10:25:24] [INFO ] Deduced a trap composed of 12 places in 33 ms
[2020-05-15 10:25:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-15 10:25:24] [INFO ] [Real]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-05-15 10:25:24] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 23 ms returned sat
[2020-05-15 10:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:25] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2020-05-15 10:25:25] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 10:25:25] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 16 ms.
[2020-05-15 10:25:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:25:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-05-15 10:25:25] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 48 ms returned sat
[2020-05-15 10:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:25] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2020-05-15 10:25:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 10:25:25] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-15 10:25:25] [INFO ] Deduced a trap composed of 12 places in 126 ms
[2020-05-15 10:25:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2020-05-15 10:25:26] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 22 ms.
[2020-05-15 10:25:26] [INFO ] Added : 124 causal constraints over 25 iterations in 808 ms. Result :sat
[2020-05-15 10:25:26] [INFO ] Deduced a trap composed of 8 places in 34 ms
[2020-05-15 10:25:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 75100 steps, including 1352 resets, run finished after 273 ms. (steps per millisecond=275 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 63600 steps, including 1181 resets, run finished after 232 ms. (steps per millisecond=274 ) properties seen :[0, 0] could not realise parikh vector
Support contains 24 out of 181 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 181/181 places, 128/128 transitions.
Applied a total of 0 rules in 15 ms. Remains 181 /181 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 128/128 transitions.
Starting structural reductions, iteration 0 : 181/181 places, 128/128 transitions.
Applied a total of 0 rules in 18 ms. Remains 181 /181 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:27] [INFO ] Computed 61 place invariants in 8 ms
[2020-05-15 10:25:27] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:27] [INFO ] Computed 61 place invariants in 10 ms
[2020-05-15 10:25:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 10:25:28] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2020-05-15 10:25:28] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:29] [INFO ] Computed 61 place invariants in 5 ms
[2020-05-15 10:25:29] [INFO ] Dead Transitions using invariants and state equation in 323 ms returned []
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 128/128 transitions.
Incomplete random walk after 100000 steps, including 1815 resets, run finished after 363 ms. (steps per millisecond=275 ) properties seen :[0, 0]
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:29] [INFO ] Computed 61 place invariants in 4 ms
[2020-05-15 10:25:29] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-15 10:25:29] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 10:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:30] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2020-05-15 10:25:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:25:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-05-15 10:25:30] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 31 ms returned sat
[2020-05-15 10:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:30] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2020-05-15 10:25:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 10:25:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 10:25:30] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-05-15 10:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2020-05-15 10:25:30] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 34 ms.
[2020-05-15 10:25:31] [INFO ] Added : 121 causal constraints over 25 iterations in 871 ms. Result :sat
[2020-05-15 10:25:31] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-05-15 10:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-05-15 10:25:31] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-05-15 10:25:31] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 23 ms returned sat
[2020-05-15 10:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:32] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2020-05-15 10:25:32] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 10:25:32] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 16 ms.
[2020-05-15 10:25:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:25:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-05-15 10:25:32] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 47 ms returned sat
[2020-05-15 10:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:32] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2020-05-15 10:25:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 10:25:32] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-15 10:25:32] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2020-05-15 10:25:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2020-05-15 10:25:32] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 14 ms.
[2020-05-15 10:25:33] [INFO ] Added : 124 causal constraints over 25 iterations in 780 ms. Result :sat
[2020-05-15 10:25:33] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-05-15 10:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 128
Applied a total of 1 rules in 21 ms. Remains 181 /181 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:33] [INFO ] Computed 61 place invariants in 4 ms
[2020-05-15 10:25:33] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-05-15 10:25:33] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 28 ms returned sat
[2020-05-15 10:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:34] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-05-15 10:25:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:25:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-05-15 10:25:34] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 10:25:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:34] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2020-05-15 10:25:34] [INFO ] Deduced a trap composed of 9 places in 80 ms
[2020-05-15 10:25:34] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-05-15 10:25:34] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2020-05-15 10:25:35] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2020-05-15 10:25:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 355 ms
[2020-05-15 10:25:35] [INFO ] Computed and/alt/rep : 127/517/127 causal constraints in 21 ms.
[2020-05-15 10:25:36] [INFO ] Added : 120 causal constraints over 24 iterations in 1025 ms. Result :sat
[2020-05-15 10:25:36] [INFO ] Deduced a trap composed of 30 places in 94 ms
[2020-05-15 10:25:36] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-05-15 10:25:36] [INFO ] Deduced a trap composed of 23 places in 65 ms
[2020-05-15 10:25:36] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2020-05-15 10:25:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 456 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-15 10:25:36] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-05-15 10:25:36] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2020-05-15 10:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:36] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-05-15 10:25:36] [INFO ] Computed and/alt/rep : 127/517/127 causal constraints in 13 ms.
[2020-05-15 10:25:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:25:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-05-15 10:25:37] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 64 ms returned sat
[2020-05-15 10:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:25:37] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2020-05-15 10:25:37] [INFO ] Computed and/alt/rep : 127/517/127 causal constraints in 22 ms.
[2020-05-15 10:25:38] [INFO ] Added : 118 causal constraints over 24 iterations in 891 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-15 10:25:38] [INFO ] Flatten gal took : 108 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 10:25:38] [INFO ] Applying decomposition
[2020-05-15 10:25:38] [INFO ] Flatten gal took : 55 ms
[2020-05-15 10:25:39] [INFO ] Flatten gal took : 40 ms
[2020-05-15 10:25:39] [INFO ] Input system was already deterministic with 128 transitions.
[2020-05-15 10:25:39] [INFO ] Input system was already deterministic with 128 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:39] [INFO ] Computed 61 place invariants in 4 ms
inv : 10*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 - 10*p16 - p18 - 2*p19 - 3*p20 - 4*p21 - 5*p22 - 6*p23 - 7*p24 - 8*p25 - 9*p26 + 3*p49 + 3*p167 - p171 - p173 + p182 - p213 - p244 + p270 + p273 - p277 - p280 - p291 - p295 + p312 + p317 = 3
inv : p49 + p167 + p210 + p213 - p241 + p244 + p268 - p270 = 1
inv : p49 + p167 + p230 + p232 = 1
inv : p49 + p167 + p171 + p172 + p173 = 1
inv : 10*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 - 10*p16 - p18 - 2*p19 - 3*p20 - 4*p21 - 5*p22 - 6*p23 - 7*p24 - 8*p25 - 9*p26 + 2*p49 + p50 + p52 + p53 + p87 + p88 + p90 + p102 + p167 - p171 - p173 + p278 + p285 + p294 + p298 - p299 - p301 - p304 + p312 + p319 = 2
inv : p49 + p167 + p299 + p301 + p302 + p304 + p305 + p308 + p311 = 1
inv : p49 + p167 + p198 + p213 - p223 + p244 + p256 - p270 = 1
inv : -p295 - p296 + p297 + p298 = 0
inv : p207 - p213 + p235 - p244 - p264 + p270 = 0
inv : p142 + p143 - p144 - p145 = 0
inv : p49 + p50 + p52 + p95 + p96 + p102 = 1
inv : p205 - p213 + p232 - p244 - p262 + p270 = 0
inv : -20*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 + 20*p16 + 2*p18 + 4*p19 + 6*p20 + 8*p21 + 10*p22 + 12*p23 + 14*p24 + 16*p25 + 18*p26 - 2*p49 - 2*p167 + 2*p171 + p173 + p175 + p181 + p185 + p280 + p291 + p292 - p294 + p295 + p296 - p298 + p301 + p304 - 2*p312 - p317 - p319 = -2
inv : p49 + p167 + p181 + p184 + p185 = 1
inv : p49 + p50 + p115 + p116 + p117 + p125 = 1
inv : p49 + p50 + p52 + p53 + p54 + p55 + p63 + p64 + p66 + p68 + p69 = 1
inv : p49 + p50 + p162 + p163 = 1
inv : p49 + p167 + p200 + p213 - p226 + p244 + p258 - p270 = 1
inv : p49 + p167 + p267 + p268 + p273 + p274 = 1
inv : p49 + p167 + p257 + p258 + p273 + p274 = 1
inv : p49 + p50 + p164 + p166 = 1
inv : p49 + p167 + p312 + p316 + p317 = 1
inv : p49 + p167 + p233 + p235 = 1
inv : p49 + p167 + p171 + p174 + p175 = 1
inv : p49 + p167 + p208 + p213 - p238 + p244 + p266 - p270 = 1
inv : -20*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 + 20*p16 + 2*p18 + 4*p19 + 6*p20 + 8*p21 + 10*p22 + 12*p23 + 14*p24 + 16*p25 + 18*p26 - 2*p49 - 2*p167 + 2*p171 + p173 + p175 + p181 + p185 + p280 + p293 + p295 + p296 - p298 + p301 + p304 - 2*p312 - p317 - p319 = -2
inv : p49 + p167 + p242 + p244 = 1
inv : p49 + p50 + p127 + p140 + p141 + p144 + p145 = 1
inv : p209 - p213 + p238 - p244 - p266 + p270 = 0
inv : p201 - p213 + p226 - p244 - p258 + p270 = 0
inv : p49 + p167 + p204 + p213 - p232 + p244 + p262 - p270 = 1
inv : p49 + p167 + p261 + p262 + p273 + p274 = 1
inv : 20*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 - 20*p16 - 2*p18 - 4*p19 - 6*p20 - 8*p21 - 10*p22 - 12*p23 - 14*p24 - 16*p25 - 18*p26 + 3*p49 + 3*p167 - 2*p171 - p173 - p175 - p181 - p185 + p278 + p284 + p285 + p288 + p290 + p294 + p298 - p301 - p304 + 2*p312 + p317 + p319 = 3
inv : p49 + p167 + p263 + p264 + p273 + p274 = 1
inv : p49 + p167 + p221 + p223 = 1
inv : -20*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 + 10*p16 + p18 + 2*p19 + 3*p20 + 4*p21 + 5*p22 + 6*p23 + 7*p24 + 8*p25 + 9*p26 + 10*p38 + p40 + 2*p41 + 3*p42 + 4*p43 + 5*p44 + 6*p45 + 7*p46 + 8*p47 + 9*p48 - p49 + p50 + p71 + p85 + p102 - p112 + p127 + p141 - p143 + p144 + p145 - p163 - 2*p167 + 2*p171 + p173 + p175 + p181 + p185 - p272 + p274 + p277 + p280 + p291 + p295 - p299 - p312 - p317 = -1
inv : p49 + p167 + p224 + p226 = 1
inv : p49 + p167 + p206 + p213 - p235 + p244 + p264 - p270 = 1
inv : p49 + p50 + p52 + p53 + p54 + p70 + p71 + p72 + p83 + p85 = 1
inv : p211 - p213 + p241 - p244 - p268 + p270 = 0
inv : p49 + p50 + p103 + p106 = 1
inv : p49 + p167 + p239 + p241 = 1
inv : p49 + p167 + p259 + p260 + p273 + p274 = 1
inv : p199 - p213 + p223 - p244 - p256 + p270 = 0
inv : p49 + p50 + p127 + p138 + p139 + p144 + p145 = 1
inv : p49 + p167 + p212 + p213 = 1
inv : p49 + p167 + p202 + p213 - p229 + p244 + p260 - p270 = 1
inv : p49 + p50 + p52 + p53 + p54 + p55 + p56 + p57 + p59 = 1
inv : p49 + p167 + p255 + p256 + p273 + p274 = 1
inv : -10*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 + 10*p16 + p18 + 2*p19 + 3*p20 + 4*p21 + 5*p22 + 6*p23 + 7*p24 + 8*p25 + 9*p26 - p49 + p89 + p91 - p102 - p167 + p171 + p173 - p278 - p285 - p294 - p298 + p299 + p301 + p304 - p312 - p319 = -1
inv : p49 + p167 + p269 + p270 + p273 + p274 = 1
inv : p49 + p50 + p110 + p112 = 1
inv : p49 + p50 + p160 + p161 = 1
inv : p271 + p272 - p273 - p274 = 0
inv : -10*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 + 10*p16 + p18 + 2*p19 + 3*p20 + 4*p21 + 5*p22 + 6*p23 + 7*p24 + 8*p25 + 9*p26 - 2*p49 - 2*p167 + p171 + p173 + p181 + p183 + p213 + p244 - p270 - p273 + p277 + p280 + p291 + p295 - p312 - p317 = -2
inv : p49 + p167 + p312 + p318 + p319 = 1
inv : p49 + p167 + p236 + p238 = 1
inv : p203 - p213 + p229 - p244 - p260 + p270 = 0
inv : p49 + p167 + p275 + p277 = 1
inv : p49 + p167 + p265 + p266 + p273 + p274 = 1
inv : p49 + p167 + p227 + p229 = 1
Total of 61 invariants.
[2020-05-15 10:25:39] [INFO ] Computed 61 place invariants in 15 ms
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/graph16797400792113393318.txt, -o, /tmp/graph16797400792113393318.bin, -w, /tmp/graph16797400792113393318.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/graph16797400792113393318.bin, -l, -1, -v, -w, /tmp/graph16797400792113393318.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 10:25:39] [INFO ] Ran tautology test, simplified 0 / 2 in 320 ms.
[2020-05-15 10:25:39] [INFO ] Decomposing Gal with order
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-01(UNSAT) depth K=0 took 14 ms
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-06(UNSAT) depth K=0 took 5 ms
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-01(UNSAT) depth K=1 took 3 ms
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-06(UNSAT) depth K=1 took 1 ms
[2020-05-15 10:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-01(UNSAT) depth K=2 took 33 ms
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-06(UNSAT) depth K=2 took 4 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 128 rows 181 cols
[2020-05-15 10:25:39] [INFO ] Computed 61 place invariants in 2 ms
inv : 10*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 - 10*p16 - p18 - 2*p19 - 3*p20 - 4*p21 - 5*p22 - 6*p23 - 7*p24 - 8*p25 - 9*p26 + 3*p49 + 3*p167 - p171 - p173 + p182 - p213 - p244 + p270 + p273 - p277 - p280 - p291 - p295 + p312 + p317 = 3
inv : p49 + p167 + p210 + p213 - p241 + p244 + p268 - p270 = 1
inv : p49 + p167 + p230 + p232 = 1
inv : p49 + p167 + p171 + p172 + p173 = 1
inv : 10*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 - 10*p16 - p18 - 2*p19 - 3*p20 - 4*p21 - 5*p22 - 6*p23 - 7*p24 - 8*p25 - 9*p26 + 2*p49 + p50 + p52 + p53 + p87 + p88 + p90 + p102 + p167 - p171 - p173 + p278 + p285 + p294 + p298 - p299 - p301 - p304 + p312 + p319 = 2
inv : p49 + p167 + p299 + p301 + p302 + p304 + p305 + p308 + p311 = 1
inv : p49 + p167 + p198 + p213 - p223 + p244 + p256 - p270 = 1
inv : -p295 - p296 + p297 + p298 = 0
inv : p207 - p213 + p235 - p244 - p264 + p270 = 0
inv : p142 + p143 - p144 - p145 = 0
inv : p49 + p50 + p52 + p95 + p96 + p102 = 1
inv : p205 - p213 + p232 - p244 - p262 + p270 = 0
inv : -20*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 + 20*p16 + 2*p18 + 4*p19 + 6*p20 + 8*p21 + 10*p22 + 12*p23 + 14*p24 + 16*p25 + 18*p26 - 2*p49 - 2*p167 + 2*p171 + p173 + p175 + p181 + p185 + p280 + p291 + p292 - p294 + p295 + p296 - p298 + p301 + p304 - 2*p312 - p317 - p319 = -2
inv : p49 + p167 + p181 + p184 + p185 = 1
inv : p49 + p50 + p115 + p116 + p117 + p125 = 1
inv : p49 + p50 + p52 + p53 + p54 + p55 + p63 + p64 + p66 + p68 + p69 = 1
inv : p49 + p50 + p162 + p163 = 1
inv : p49 + p167 + p200 + p213 - p226 + p244 + p258 - p270 = 1
inv : p49 + p167 + p267 + p268 + p273 + p274 = 1
inv : p49 + p167 + p257 + p258 + p273 + p274 = 1
inv : p49 + p50 + p164 + p166 = 1
inv : p49 + p167 + p312 + p316 + p317 = 1
inv : p49 + p167 + p233 + p235 = 1
inv : p49 + p167 + p171 + p174 + p175 = 1
inv : p49 + p167 + p208 + p213 - p238 + p244 + p266 - p270 = 1
inv : -20*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 + 20*p16 + 2*p18 + 4*p19 + 6*p20 + 8*p21 + 10*p22 + 12*p23 + 14*p24 + 16*p25 + 18*p26 - 2*p49 - 2*p167 + 2*p171 + p173 + p175 + p181 + p185 + p280 + p293 + p295 + p296 - p298 + p301 + p304 - 2*p312 - p317 - p319 = -2
inv : p49 + p167 + p242 + p244 = 1
inv : p49 + p50 + p127 + p140 + p141 + p144 + p145 = 1
inv : p209 - p213 + p238 - p244 - p266 + p270 = 0
inv : p201 - p213 + p226 - p244 - p258 + p270 = 0
inv : p49 + p167 + p204 + p213 - p232 + p244 + p262 - p270 = 1
inv : p49 + p167 + p261 + p262 + p273 + p274 = 1
inv : 20*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 - 20*p16 - 2*p18 - 4*p19 - 6*p20 - 8*p21 - 10*p22 - 12*p23 - 14*p24 - 16*p25 - 18*p26 + 3*p49 + 3*p167 - 2*p171 - p173 - p175 - p181 - p185 + p278 + p284 + p285 + p288 + p290 + p294 + p298 - p301 - p304 + 2*p312 + p317 + p319 = 3
inv : p49 + p167 + p263 + p264 + p273 + p274 = 1
inv : p49 + p167 + p221 + p223 = 1
inv : -20*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 + 10*p16 + p18 + 2*p19 + 3*p20 + 4*p21 + 5*p22 + 6*p23 + 7*p24 + 8*p25 + 9*p26 + 10*p38 + p40 + 2*p41 + 3*p42 + 4*p43 + 5*p44 + 6*p45 + 7*p46 + 8*p47 + 9*p48 - p49 + p50 + p71 + p85 + p102 - p112 + p127 + p141 - p143 + p144 + p145 - p163 - 2*p167 + 2*p171 + p173 + p175 + p181 + p185 - p272 + p274 + p277 + p280 + p291 + p295 - p299 - p312 - p317 = -1
inv : p49 + p167 + p224 + p226 = 1
inv : p49 + p167 + p206 + p213 - p235 + p244 + p264 - p270 = 1
inv : p49 + p50 + p52 + p53 + p54 + p70 + p71 + p72 + p83 + p85 = 1
inv : p211 - p213 + p241 - p244 - p268 + p270 = 0
inv : p49 + p50 + p103 + p106 = 1
inv : p49 + p167 + p239 + p241 = 1
inv : p49 + p167 + p259 + p260 + p273 + p274 = 1
inv : p199 - p213 + p223 - p244 - p256 + p270 = 0
inv : p49 + p50 + p127 + p138 + p139 + p144 + p145 = 1
inv : p49 + p167 + p212 + p213 = 1
inv : p49 + p167 + p202 + p213 - p229 + p244 + p260 - p270 = 1
inv : p49 + p50 + p52 + p53 + p54 + p55 + p56 + p57 + p59 = 1
inv : p49 + p167 + p255 + p256 + p273 + p274 = 1
inv : -10*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 + 10*p16 + p18 + 2*p19 + 3*p20 + 4*p21 + 5*p22 + 6*p23 + 7*p24 + 8*p25 + 9*p26 - p49 + p89 + p91 - p102 - p167 + p171 + p173 - p278 - p285 - p294 - p298 + p299 + p301 + p304 - p312 - p319 = -1
inv : p49 + p167 + p269 + p270 + p273 + p274 = 1
inv : p49 + p50 + p110 + p112 = 1
inv : p49 + p50 + p160 + p161 = 1
inv : p271 + p272 - p273 - p274 = 0
inv : -10*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 + 10*p16 + p18 + 2*p19 + 3*p20 + 4*p21 + 5*p22 + 6*p23 + 7*p24 + 8*p25 + 9*p26 - 2*p49 - 2*p167 + p171 + p173 + p181 + p183 + p213 + p244 - p270 - p273 + p277 + p280 + p291 + p295 - p312 - p317 = -2
inv : p49 + p167 + p312 + p318 + p319 = 1
inv : p49 + p167 + p236 + p238 = 1
inv : p203 - p213 + p229 - p244 - p260 + p270 = 0
inv : p49 + p167 + p275 + p277 = 1
inv : p49 + p167 + p265 + p266 + p273 + p274 = 1
inv : p49 + p167 + p227 + p229 = 1
Total of 61 invariants.
[2020-05-15 10:25:39] [INFO ] Computed 61 place invariants in 5 ms
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-01(UNSAT) depth K=3 took 137 ms
[2020-05-15 10:25:39] [INFO ] Removed a total of 59 redundant transitions.
[2020-05-15 10:25:39] [INFO ] Flatten gal took : 202 ms
[2020-05-15 10:25:39] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-06(UNSAT) depth K=3 took 185 ms
[2020-05-15 10:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 29 ms.
[2020-05-15 10:25:39] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 14 ms
[2020-05-15 10:25:39] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 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 [reachable] property : DES-PT-10b-ReachabilityFireability-01 with value :((((((i13.u47.p285==1)&&(u18.p10==1))&&(u18.p171==1))||(((i13.u19.p181==1)&&(i13.u48.p284==1))&&(i13.u48.p290==1)))||(((i1.u4.p69==1)&&(i1.u4.p66==1))&&(i3.u14.p144==1)))||((((((i1.u6.p90==1)&&(i3.u0.p50==1))&&(i14.u51.p311!=1))&&(i13.u46.p296==1))&&(i14.u50.p298==1))&&(((u52.p21==1)&&(u52.p312==1))||((((((i1.u3.p56==1)&&(i1.u4.p63==1))&&(i0.u5.p85==1))&&(i1.u6.p87==1))&&(i1.u7.p95==1))&&(i1.u8.p106==1)))))
Read [invariant] property : DES-PT-10b-ReachabilityFireability-06 with value :((i0.u5.p42!=1)||(i0.u5.p70!=1))
built 16 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 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
[2020-05-15 10:25:40] [INFO ] Proved 181 variables to be positive in 1136 ms
[2020-05-15 10:25:40] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2020-05-15 10:25:40] [INFO ] Computation of disable matrix completed :0/128 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:25:40] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:25:40] [INFO ] Computing symmetric may enable matrix : 128 transitions.
SDD proceeding with computation, new max is 2048
[2020-05-15 10:25:40] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:25:40] [INFO ] Proved 181 variables to be positive in 993 ms
[2020-05-15 10:25:40] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-01(UNSAT) depth K=4 took 830 ms
SDD proceeding with computation, new max is 4096
[2020-05-15 10:25:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-10b-ReachabilityFireability-01
[2020-05-15 10:25:40] [INFO ] KInduction solution for property DES-PT-10b-ReachabilityFireability-01(SAT) depth K=0 took 435 ms
[2020-05-15 10:25:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-10b-ReachabilityFireability-06
[2020-05-15 10:25:41] [INFO ] KInduction solution for property DES-PT-10b-ReachabilityFireability-06(SAT) depth K=0 took 141 ms
[2020-05-15 10:25:41] [INFO ] Computing symmetric co enabling matrix : 128 transitions.
Invariant property DES-PT-10b-ReachabilityFireability-06 does not hold.
FORMULA DES-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-10b-ReachabilityFireability-01 is true.
FORMULA DES-PT-10b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
[2020-05-15 10:25:41] [INFO ] BMC solution for property DES-PT-10b-ReachabilityFireability-06(UNSAT) depth K=4 took 718 ms
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,1.40602e+14,1.10577,25580,3299,517,60196,2125,352,43367,161,7927,0
Total reachable state count : 140602312778276
Verifying 2 reachability properties.
Reachability property DES-PT-10b-ReachabilityFireability-01 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-10b-ReachabilityFireability-01,1.05816e+11,1.12604,25580,146,166,60196,2125,465,43367,186,7927,3279
Invariant property DES-PT-10b-ReachabilityFireability-06 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-10b-ReachabilityFireability-06,1.22688e+06,1.1286,25580,68,100,60196,2125,477,43367,192,7927,3279
[2020-05-15 10:25:41] [WARNING] Interrupting SMT solver.
[2020-05-15 10:25:41] [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-15 10:25:41] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-10b-ReachabilityFireability-01 K-induction depth 1
Exception in thread "Thread-5" 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-15 10:25:41] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
[2020-05-15 10:25:41] [WARNING] Script execution failed on command (assert (= (+ (* 20 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 2 (select s0 40)) (* 2 (select s0 90)) (select s0 164) (select s0 168) (* 2 (select s0 176)) (select s0 178) (select s0 180) -2) (+ (* 20 (select s0 10)) (* 2 (select s0 11)) (* 4 (select s0 12)) (* 6 (select s0 13)) (* 8 (select s0 14)) (* 10 (select s0 15)) (* 12 (select s0 16)) (* 14 (select s0 17)) (* 16 (select s0 18)) (* 18 (select s0 19)) (* 2 (select s0 91)) (select s0 93) (select s0 95) (select s0 96) (select s0 100) (select s0 156) (select s0 161) (select s0 162) (select s0 165) (select s0 166) (select s0 170) (select s0 172)))) with error
[2020-05-15 10:25:41] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 40) (select s0 90) (select s0 96) (select s0 99) (select s0 100)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 40) (select s0 90) (select s0 96) (select s0 99) (select s0 100)))")
[(declare-fun s0 () (Array Int Int)), (assert (= (+ (* 20 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 2 (select s0 40)) (* 2 (select s0 90)) (select s0 164) (select s0 168) (* 2 (select s0 176)) (select s0 178) (select s0 180) -2) (+ (* 20 (select s0 10)) (* 2 (select s0 11)) (* 4 (select s0 12)) (* 6 (select s0 13)) (* 8 (select s0 14)) (* 10 (select s0 15)) (* 12 (select s0 16)) (* 14 (select s0 17)) (* 16 (select s0 18)) (* 18 (select s0 19)) (* 2 (select s0 91)) (select s0 93) (select s0 95) (select s0 96) (select s0 100) (select s0 156) (select s0 161) (select s0 162) (select s0 165) (select s0 166) (select s0 170) (select s0 172)))), (assert (= 1 (+ (select s0 40) (select s0 90) (select s0 96) (select s0 99) (select s0 100)))), (assert (= (+ (* 20 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 2 (select s0 40)) (* 2 (select s0 90)) (select s0 168) (* 2 (select s0 176)) (select s0 178) (select s0 180) -2) (+ (* 20 (select s0 10)) (* 2 (select s0 11)) (* 4 (select s0 12)) (* 6 (select s0 13)) (* 8 (select s0 14)) (* 10 (select s0 15)) (* 12 (select s0 16)) (* 14 (select s0 17)) (* 16 (select s0 18)) (* 18 (select s0 19)) (* 2 (select s0 91)) (select s0 93) (select s0 95) (select s0 96) (select s0 100) (select s0 156) (select s0 163) (select s0 165) (select s0 166) (select s0 170) (select s0 172)))), (assert (= (+ (* 20 (select s0 10)) (* 2 (select s0 11)) (* 4 (select s0 12)) (* 6 (select s0 13)) (* 8 (select s0 14)) (* 10 (select s0 15)) (* 12 (select s0 16)) (* 14 (select s0 17)) (* 16 (select s0 18)) (* 18 (select s0 19)) (* 2 (select s0 91)) (select s0 93) (select s0 95) (select s0 96) (select s0 100) (select s0 170) (select s0 172) 3) (+ (* 20 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 3 (select s0 40)) (* 3 (select s0 90)) (select s0 155) (select s0 157) (select s0 158) (select s0 159) (select s0 160) (select s0 164) (select s0 168) (* 2 (select s0 176)) (select s0 178) (select s0 180)))), (assert (= (+ (* 20 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (select s0 40) (select s0 70) (select s0 81) (select s0 87) (* 2 (select s0 90)) (select s0 150) (select s0 169) (select s0 176) (select s0 178) -1) (+ (* 10 (select s0 10)) (select s0 11) (* 2 (select s0 12)) (* 3 (select s0 13)) (* 4 (select s0 14)) (* 5 (select s0 15)) (* 6 (select s0 16)) (* 7 (select s0 17)) (* 8 (select s0 18)) (* 9 (select s0 19)) (* 10 (select s0 30)) (select s0 31) (* 2 (select s0 32)) (* 3 (select s0 33)) (* 4 (select s0 34)) (* 5 (select s0 35)) (* 6 (select s0 36)) (* 7 (select s0 37)) (* 8 (select s0 38)) (* 9 (select s0 39)) (select s0 41) (select s0 55) (select s0 58) (select s0 66) (select s0 75) (select s0 79) (select s0 82) (select s0 83) (* 2 (select s0 91)) (select s0 93) (select s0 95) (select s0 96) (select s0 100) (select s0 152) (select s0 154) (select s0 156) (select s0 161) (select s0 165)))), (assert (= (+ (* 10 (select s0 0)) (select s0 1) (* 2 (select s0 2)) (* 3 (select s0 3)) (* 4 (select s0 4)) (* 5 (select s0 5)) (* 6 (select s0 6)) (* 7 (select s0 7)) (* 8 (select s0 8)) (* 9 (select s0 9)) (* 2 (select s0 40)) (* 2 (select s0 90)) (select s0 148) (select s0 151) (select s0 176) (select s0 178) -2) (+ (* 10 (select s0 10)) (select s0 11) (* 2 (select s0 12)) (* 3 (select s0 13)) (* 4 (select s0 14)) (* 5 (select s0 15)) (* 6 (select s0 16)) (* 7 (select s0 17)) (* 8 (select s0 18)) (* 9 (select s0 19)) (select s0 91) (select s0 93) (select s0 96) (select s0 98) (select s0 116) (select s0 132) (select s0 154) (select s0 156) (select s0 161) (select s0 165)))), (assert (and (>= (select s0 98) 1) (>= (select s0 100) 1))), (assert (>= (select s0 0) 0)), (assert (>= (select s0 1) 0)), (assert (>= (select s0 2) 0)), (assert (>= (select s0 3) 0)), (assert (>= (select s0 4) 0)), (assert (>= (select s0 5) 0)), (assert (>= (select s0 6) 0)), (assert (>= (select s0 7) 0)), (assert (>= (select s0 8) 0)), (assert (>= (select s0 9) 0)), (assert (>= (select s0 10) 0)), (assert (>= (select s0 11) 0)), (assert (>= (select s0 12) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 14) 0)), (assert (>= (select s0 15) 0)), (assert (>= (select s0 16) 0)), (assert (>= (select s0 17) 0)), (assert (>= (select s0 18) 0)), (assert (>= (select s0 19) 0)), (assert (>= (select s0 30) 0)), (assert (>= (select s0 31) 0)), (assert (>= (select s0 32) 0)), (assert (>= (select s0 33) 0)), (assert (>= (select s0 34) 0)), (assert (>= (select s0 35) 0)), (assert (>= (select s0 36) 0)), (assert (>= (select s0 37) 0)), (assert (>= (select s0 38) 0)), (assert (>= (select s0 39) 0)), (assert (>= (select s0 40) 0)), (assert (>= (select s0 41) 0)), (assert (>= (select s0 55) 0)), (assert (>= (select s0 58) 0)), (assert (>= (select s0 66) 0)), (assert (>= (select s0 70) 0)), (assert (>= (select s0 75) 0)), (assert (>= (select s0 79) 0)), (assert (>= (select s0 81) 0)), (assert (>= (select s0 82) 0)), (assert (>= (select s0 83) 0)), (assert (>= (select s0 87) 0)), (assert (>= (select s0 90) 0)), (assert (>= (select s0 91) 0)), (assert (>= (select s0 93) 0)), (assert (>= (select s0 95) 0)), (assert (>= (select s0 96) 0)), (assert (>= (select s0 98) 0)), (assert (>= (select s0 99) 0)), (assert (>= (select s0 100) 0)), (assert (>= (select s0 116) 0)), (assert (>= (select s0 132) 0)), (assert (>= (select s0 148) 0)), (assert (>= (select s0 150) 0)), (assert (>= (select s0 151) 0)), (assert (>= (select s0 152) 0)), (assert (>= (select s0 154) 0)), (assert (>= (select s0 155) 0)), (assert (>= (select s0 156) 0)), (assert (>= (select s0 157) 0)), (assert (>= (select s0 158) 0)), (assert (>= (select s0 159) 0)), (assert (>= (select s0 160) 0)), (assert (>= (select s0 161) 0)), (assert (>= (select s0 162) 0)), (assert (>= (select s0 163) 0)), (assert (>= (select s0 164) 0)), (assert (>= (select s0 165) 0)), (assert (>= (select s0 166) 0)), (assert (>= (select s0 168) 0)), (assert (>= (select s0 169) 0)), (assert (>= (select s0 170) 0)), (assert (>= (select s0 172) 0)), (assert (>= (select s0 176) 0)), (assert (>= (select s0 178) 0)), (assert (>= (select s0 180) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@7e477477
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@7e477477
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 10:25:41] [INFO ] Built C files in 2426ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1589538341743
--------------------
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="DES-PT-10b"
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 DES-PT-10b, 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 r051-ebro-158902545900255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 ;