fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902546000302
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DES-PT-40b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15757.740 219644.00 436898.00 192.50 FTFTFTTFTFTFTFFF 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-158902546000302.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-40b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 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.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 26 08:18 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 115K 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-40b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589553222979

[2020-05-15 14:33:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 14:33:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 14:33:46] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2020-05-15 14:33:46] [INFO ] Transformed 439 places.
[2020-05-15 14:33:46] [INFO ] Transformed 390 transitions.
[2020-05-15 14:33:46] [INFO ] Found NUPN structural information;
[2020-05-15 14:33:46] [INFO ] Parsed PT model containing 439 places and 390 transitions in 242 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-40b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 112 ms. (steps per millisecond=89 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 1, 1]
FORMULA DES-PT-40b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[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]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0]
// Phase 1: matrix 390 rows 439 cols
[2020-05-15 14:33:46] [INFO ] Computed 65 place invariants in 77 ms
[2020-05-15 14:33:47] [INFO ] [Real]Absence check using 39 positive place invariants in 69 ms returned sat
[2020-05-15 14:33:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 43 ms returned sat
[2020-05-15 14:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:33:48] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2020-05-15 14:33:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:33:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 112 ms returned sat
[2020-05-15 14:33:49] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-05-15 14:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:33:50] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2020-05-15 14:33:50] [INFO ] Deduced a trap composed of 24 places in 325 ms
[2020-05-15 14:33:50] [INFO ] Deduced a trap composed of 45 places in 167 ms
[2020-05-15 14:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 616 ms
[2020-05-15 14:33:50] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 42 ms.
[2020-05-15 14:33:53] [INFO ] Added : 80 causal constraints over 16 iterations in 2660 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-15 14:33:53] [INFO ] [Real]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-05-15 14:33:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-05-15 14:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:33:54] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2020-05-15 14:33:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:33:55] [INFO ] [Nat]Absence check using 39 positive place invariants in 107 ms returned sat
[2020-05-15 14:33:55] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 65 ms returned sat
[2020-05-15 14:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:33:56] [INFO ] [Nat]Absence check using state equation in 1394 ms returned sat
[2020-05-15 14:33:57] [INFO ] Deduced a trap composed of 15 places in 348 ms
[2020-05-15 14:33:57] [INFO ] Deduced a trap composed of 15 places in 350 ms
[2020-05-15 14:33:57] [INFO ] Deduced a trap composed of 16 places in 233 ms
[2020-05-15 14:33:58] [INFO ] Deduced a trap composed of 19 places in 439 ms
[2020-05-15 14:33:58] [INFO ] Deduced a trap composed of 8 places in 211 ms
[2020-05-15 14:33:58] [INFO ] Deduced a trap composed of 19 places in 259 ms
[2020-05-15 14:33:59] [INFO ] Deduced a trap composed of 23 places in 233 ms
[2020-05-15 14:33:59] [INFO ] Deduced a trap composed of 25 places in 235 ms
[2020-05-15 14:33:59] [INFO ] Deduced a trap composed of 23 places in 124 ms
[2020-05-15 14:33:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2866 ms
[2020-05-15 14:33:59] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 42 ms.
[2020-05-15 14:34:00] [INFO ] Added : 15 causal constraints over 3 iterations in 368 ms. Result :(error "Failed to check-sat")
[2020-05-15 14:34:00] [INFO ] [Real]Absence check using 39 positive place invariants in 50 ms returned sat
[2020-05-15 14:34:00] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 62 ms returned sat
[2020-05-15 14:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:34:01] [INFO ] [Real]Absence check using state equation in 1524 ms returned sat
[2020-05-15 14:34:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:34:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 136 ms returned sat
[2020-05-15 14:34:02] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 110 ms returned sat
[2020-05-15 14:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:34:03] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2020-05-15 14:34:04] [INFO ] Deduced a trap composed of 16 places in 722 ms
[2020-05-15 14:34:04] [INFO ] Deduced a trap composed of 15 places in 286 ms
[2020-05-15 14:34:05] [INFO ] Deduced a trap composed of 15 places in 219 ms
[2020-05-15 14:34:05] [INFO ] Deduced a trap composed of 18 places in 265 ms
[2020-05-15 14:34:05] [INFO ] Deduced a trap composed of 27 places in 207 ms
[2020-05-15 14:34:05] [INFO ] Deduced a trap composed of 17 places in 172 ms
[2020-05-15 14:34:06] [INFO ] Deduced a trap composed of 10 places in 143 ms
[2020-05-15 14:34:06] [INFO ] Deduced a trap composed of 19 places in 180 ms
[2020-05-15 14:34:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2609 ms
[2020-05-15 14:34:06] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 44 ms.
[2020-05-15 14:34:06] [INFO ] Added : 15 causal constraints over 3 iterations in 444 ms. Result :unknown
Incomplete Parikh walk after 294000 steps, including 3091 resets, run finished after 1278 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 15 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 390/390 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.40 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 428 transition count 362
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 407 transition count 362
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 45 place count 407 transition count 356
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 401 transition count 356
Symmetric choice reduction at 2 with 19 rule applications. Total rules 76 place count 401 transition count 356
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 114 place count 382 transition count 337
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 382 transition count 336
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 381 transition count 336
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 381 transition count 336
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 161 place count 366 transition count 321
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 176 place count 366 transition count 306
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 179 place count 364 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 179 place count 364 transition count 303
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 362 transition count 303
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 327 place count 290 transition count 231
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 331 place count 288 transition count 233
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 333 place count 288 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 287 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 286 transition count 232
Applied a total of 335 rules in 386 ms. Remains 286 /439 variables (removed 153) and now considering 232/390 (removed 158) transitions.
Finished structural reductions, in 1 iterations. Remains : 286/439 places, 232/390 transitions.
Incomplete random walk after 1000000 steps, including 34579 resets, run finished after 4135 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6085 resets, run finished after 1867 ms. (steps per millisecond=535 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6446 resets, run finished after 2220 ms. (steps per millisecond=450 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4885 resets, run finished after 2510 ms. (steps per millisecond=398 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 7696455 steps, run timeout after 30001 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0]
Probabilistic random walk after 7696455 steps, saw 1008292 distinct states, run finished after 30013 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0]
// Phase 1: matrix 232 rows 286 cols
[2020-05-15 14:34:49] [INFO ] Computed 60 place invariants in 24 ms
[2020-05-15 14:34:49] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-05-15 14:34:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2020-05-15 14:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:34:50] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2020-05-15 14:34:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:34:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-05-15 14:34:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2020-05-15 14:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:34:51] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2020-05-15 14:34:51] [INFO ] Deduced a trap composed of 7 places in 119 ms
[2020-05-15 14:34:51] [INFO ] Deduced a trap composed of 10 places in 95 ms
[2020-05-15 14:34:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2020-05-15 14:34:51] [INFO ] Computed and/alt/rep : 227/852/227 causal constraints in 57 ms.
[2020-05-15 14:34:53] [INFO ] Added : 148 causal constraints over 30 iterations in 1869 ms. Result :sat
[2020-05-15 14:34:53] [INFO ] Deduced a trap composed of 19 places in 164 ms
[2020-05-15 14:34:53] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2020-05-15 14:34:53] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-05-15 14:34:54] [INFO ] Deduced a trap composed of 40 places in 98 ms
[2020-05-15 14:34:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 777 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-15 14:34:54] [INFO ] [Real]Absence check using 36 positive place invariants in 93 ms returned sat
[2020-05-15 14:34:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2020-05-15 14:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:34:55] [INFO ] [Real]Absence check using state equation in 1111 ms returned sat
[2020-05-15 14:34:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:34:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 68 ms returned sat
[2020-05-15 14:34:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 154 ms returned sat
[2020-05-15 14:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:34:56] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2020-05-15 14:34:57] [INFO ] Computed and/alt/rep : 227/852/227 causal constraints in 43 ms.
[2020-05-15 14:34:59] [INFO ] Added : 180 causal constraints over 36 iterations in 2439 ms. Result :sat
[2020-05-15 14:34:59] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-05-15 14:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-15 14:34:59] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-05-15 14:34:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2020-05-15 14:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:35:00] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2020-05-15 14:35:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:35:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-05-15 14:35:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 481 ms returned sat
[2020-05-15 14:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:35:02] [INFO ] [Nat]Absence check using state equation in 1103 ms returned sat
[2020-05-15 14:35:02] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2020-05-15 14:35:02] [INFO ] Deduced a trap composed of 13 places in 145 ms
[2020-05-15 14:35:03] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2020-05-15 14:35:03] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2020-05-15 14:35:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 599 ms
[2020-05-15 14:35:03] [INFO ] Computed and/alt/rep : 227/852/227 causal constraints in 28 ms.
[2020-05-15 14:35:04] [INFO ] Added : 145 causal constraints over 29 iterations in 1493 ms. Result :unsat
FORMULA DES-PT-40b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 146500 steps, including 5259 resets, run finished after 635 ms. (steps per millisecond=230 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 176900 steps, including 6737 resets, run finished after 781 ms. (steps per millisecond=226 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 286 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 286/286 places, 232/232 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 286 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 284 transition count 230
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 280 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 279 transition count 225
Applied a total of 13 rules in 75 ms. Remains 279 /286 variables (removed 7) and now considering 225/232 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/286 places, 225/232 transitions.
Incomplete random walk after 1000000 steps, including 45195 resets, run finished after 4316 ms. (steps per millisecond=231 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 8513 resets, run finished after 1995 ms. (steps per millisecond=501 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 8964 resets, run finished after 2147 ms. (steps per millisecond=465 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8170279 steps, run timeout after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0]
Probabilistic random walk after 8170279 steps, saw 1145652 distinct states, run finished after 30003 ms. (steps per millisecond=272 ) properties seen :[0, 0]
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:35:44] [INFO ] Computed 60 place invariants in 10 ms
[2020-05-15 14:35:44] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-05-15 14:35:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2020-05-15 14:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:35:45] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2020-05-15 14:35:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:35:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-05-15 14:35:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2020-05-15 14:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:35:46] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2020-05-15 14:35:46] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 30 ms.
[2020-05-15 14:35:47] [INFO ] Added : 141 causal constraints over 29 iterations in 1578 ms. Result :sat
[2020-05-15 14:35:47] [INFO ] Deduced a trap composed of 40 places in 49 ms
[2020-05-15 14:35:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-15 14:35:48] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-05-15 14:35:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2020-05-15 14:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:35:48] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2020-05-15 14:35:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:35:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-05-15 14:35:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 68 ms returned sat
[2020-05-15 14:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:35:49] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2020-05-15 14:35:49] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 33 ms.
[2020-05-15 14:35:52] [INFO ] Added : 179 causal constraints over 36 iterations in 2272 ms. Result :sat
[2020-05-15 14:35:52] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2020-05-15 14:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
Incomplete Parikh walk after 181000 steps, including 6002 resets, run finished after 762 ms. (steps per millisecond=237 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 157600 steps, including 5272 resets, run finished after 648 ms. (steps per millisecond=243 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 225/225 transitions.
Applied a total of 0 rules in 21 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 225/225 transitions.
Starting structural reductions, iteration 0 : 279/279 places, 225/225 transitions.
Applied a total of 0 rules in 20 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:35:53] [INFO ] Computed 60 place invariants in 6 ms
[2020-05-15 14:35:54] [INFO ] Implicit Places using invariants in 992 ms returned []
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:35:54] [INFO ] Computed 60 place invariants in 12 ms
[2020-05-15 14:35:58] [INFO ] Implicit Places using invariants and state equation in 3762 ms returned []
Implicit Place search using SMT with State Equation took 4756 ms to find 0 implicit places.
[2020-05-15 14:35:58] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:35:58] [INFO ] Computed 60 place invariants in 11 ms
[2020-05-15 14:35:59] [INFO ] Dead Transitions using invariants and state equation in 812 ms returned []
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 225/225 transitions.
Incomplete random walk after 100000 steps, including 4564 resets, run finished after 470 ms. (steps per millisecond=212 ) properties seen :[0, 0]
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:35:59] [INFO ] Computed 60 place invariants in 7 ms
[2020-05-15 14:36:00] [INFO ] [Real]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-05-15 14:36:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2020-05-15 14:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:00] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2020-05-15 14:36:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:36:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-05-15 14:36:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-05-15 14:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:01] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2020-05-15 14:36:01] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 32 ms.
[2020-05-15 14:36:03] [INFO ] Added : 141 causal constraints over 29 iterations in 1661 ms. Result :sat
[2020-05-15 14:36:03] [INFO ] Deduced a trap composed of 40 places in 44 ms
[2020-05-15 14:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2020-05-15 14:36:03] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-05-15 14:36:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2020-05-15 14:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:04] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2020-05-15 14:36:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:36:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-05-15 14:36:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 68 ms returned sat
[2020-05-15 14:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:05] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2020-05-15 14:36:05] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 20 ms.
[2020-05-15 14:36:07] [INFO ] Added : 179 causal constraints over 36 iterations in 2136 ms. Result :sat
[2020-05-15 14:36:07] [INFO ] Deduced a trap composed of 40 places in 54 ms
[2020-05-15 14:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 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 279 transition count 225
Applied a total of 1 rules in 45 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:36:07] [INFO ] Computed 60 place invariants in 9 ms
[2020-05-15 14:36:07] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-05-15 14:36:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2020-05-15 14:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:08] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2020-05-15 14:36:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:36:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-05-15 14:36:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-05-15 14:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:09] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2020-05-15 14:36:09] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 25 ms.
[2020-05-15 14:36:11] [INFO ] Added : 140 causal constraints over 28 iterations in 2125 ms. Result :sat
[2020-05-15 14:36:11] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-05-15 14:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-15 14:36:11] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-05-15 14:36:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2020-05-15 14:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:12] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2020-05-15 14:36:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:36:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-05-15 14:36:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 98 ms returned sat
[2020-05-15 14:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:36:13] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2020-05-15 14:36:13] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 31 ms.
[2020-05-15 14:36:15] [INFO ] Added : 179 causal constraints over 36 iterations in 1794 ms. Result :sat
[2020-05-15 14:36:15] [INFO ] Deduced a trap composed of 46 places in 150 ms
[2020-05-15 14:36:15] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-15 14:36:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-15 14:36:16] [INFO ] Flatten gal took : 243 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 14:36:16] [INFO ] Applying decomposition
[2020-05-15 14:36:16] [INFO ] Flatten gal took : 93 ms
[2020-05-15 14:36:17] [INFO ] Input system was already deterministic with 225 transitions.
[2020-05-15 14:36:17] [INFO ] Flatten gal took : 141 ms
[2020-05-15 14:36:17] [INFO ] Input system was already deterministic with 225 transitions.
[2020-05-15 14:36:17] [INFO ] Ran tautology test, simplified 0 / 2 in 306 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:36:17] [INFO ] Computed 60 place invariants in 6 ms
inv : p234 + p235 + p236 + p244 = 1
inv : p431 + p437 + p438 = 1
inv : p283 + p285 = 1
inv : p310 + p329 + p332 - p360 + p363 + p387 - p389 = 1
inv : p318 - p332 + p342 - p363 - p375 + p389 = 0
inv : p364 + p386 + p387 + p392 + p393 = 1
inv : p352 + p354 = 1
inv : p257 + p258 - p259 - p260 = 0
inv : p346 + p348 = 1
inv : p279 + p280 = 1
inv : p364 + p382 + p383 + p392 + p393 = 1
inv : p397 + p399 + p400 + p403 + p406 + p410 + p411 + p416 + p417 = 1
inv : -78*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 - 40*p26 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 - 58*p35 - 60*p36 - 62*p37 - 64*p38 - 66*p39 - 68*p40 - 70*p41 - 72*p42 - 74*p43 - 76*p44 + 80*p45 + 2*p47 + 4*p48 + 6*p49 + 8*p50 + 10*p51 + 12*p52 + 14*p53 + 16*p54 + 18*p55 + 20*p56 + 22*p57 + 24*p58 + 26*p59 + 28*p60 + 30*p61 + 32*p62 + 34*p63 + 36*p64 + 38*p65 + 40*p66 + 42*p67 + 44*p68 + 46*p69 + 48*p70 + 50*p71 + 52*p72 + 54*p73 + 56*p74 + 58*p75 + 60*p76 + 62*p77 + 64*p78 + 66*p79 + 68*p80 + 70*p81 + 72*p82 + 74*p83 + 76*p84 + 78*p85 + p292 + p294 + p304 + p399 + p412 + p416 - p418 - p421 - p424 - p427 - 2*p431 - p436 - p438 = -1
inv : 39*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 + 20*p26 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 + 29*p35 + 30*p36 + 31*p37 + 32*p38 + 33*p39 + 34*p40 + 35*p41 + 36*p42 + 37*p43 + 38*p44 - 40*p45 - p47 - 2*p48 - 3*p49 - 4*p50 - 5*p51 - 6*p52 - 7*p53 - 8*p54 - 9*p55 - 10*p56 - 11*p57 - 12*p58 - 13*p59 - 14*p60 - 15*p61 - 16*p62 - 17*p63 - 18*p64 - 19*p65 - 20*p66 - 21*p67 - 22*p68 - 23*p69 - 24*p70 - 25*p71 - 26*p72 - 27*p73 - 28*p74 - 29*p75 - 30*p76 - 31*p77 - 32*p78 - 33*p79 - 34*p80 - 35*p81 - 36*p82 - 37*p83 - 38*p84 - 39*p85 - p292 + p301 - p310 - p332 - p363 + p364 + p389 + p392 - p396 - p399 - p410 - p414 + p431 + p436 = 2
inv : p175 + p178 = 1
inv : p214 + p221 = 1
inv : p322 - p332 + p348 - p363 - p379 + p389 = 0
inv : p364 + p380 + p381 + p392 + p393 = 1
inv : p358 + p360 = 1
inv : p293 + p294 = 1
inv : -39*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 - 20*p26 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 - 29*p35 - 30*p36 - 31*p37 - 32*p38 - 33*p39 - 34*p40 - 35*p41 - 36*p42 - 37*p43 - 38*p44 + 40*p45 + p47 + 2*p48 + 3*p49 + 4*p50 + 5*p51 + 6*p52 + 7*p53 + 8*p54 + 9*p55 + 10*p56 + 11*p57 + 12*p58 + 13*p59 + 14*p60 + 15*p61 + 16*p62 + 17*p63 + 18*p64 + 19*p65 + 20*p66 + 21*p67 + 22*p68 + 23*p69 + 24*p70 + 25*p71 + 26*p72 + 27*p73 + 28*p74 + 29*p75 + 30*p76 + 31*p77 + 32*p78 + 33*p79 + 34*p80 + 35*p81 + 36*p82 + 37*p83 + 38*p84 + 39*p85 + p292 + p302 + p310 + p332 + p363 - p364 - p389 - p392 + p396 + p399 + p410 + p414 - p431 - p436 = -1
inv : p229 + p231 = 1
inv : p324 - p332 + p351 - p363 - p381 + p389 = 0
inv : p340 + p342 = 1
inv : p281 + p282 = 1
inv : p320 - p332 + p345 - p363 - p377 + p389 = 0
inv : p310 + p319 + p332 - p345 + p363 + p377 - p389 = 1
inv : p349 + p351 = 1
inv : p364 + p388 + p389 + p392 + p393 = 1
inv : p326 - p332 + p354 - p363 - p383 + p389 = 0
inv : p310 + p317 + p332 - p342 + p363 + p375 - p389 = 1
inv : 78*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 + 40*p26 + 42*p27 + 44*p28 + 46*p29 + 48*p30 + 50*p31 + 52*p32 + 54*p33 + 56*p34 + 58*p35 + 60*p36 + 62*p37 + 64*p38 + 66*p39 + 68*p40 + 70*p41 + 72*p42 + 74*p43 + 76*p44 - 80*p45 - 2*p47 - 4*p48 - 6*p49 - 8*p50 - 10*p51 - 12*p52 - 14*p53 - 16*p54 - 18*p55 - 20*p56 - 22*p57 - 24*p58 - 26*p59 - 28*p60 - 30*p61 - 32*p62 - 34*p63 - 36*p64 - 38*p65 - 40*p66 - 42*p67 - 44*p68 - 46*p69 - 48*p70 - 50*p71 - 52*p72 - 54*p73 - 56*p74 - 58*p75 - 60*p76 - 62*p77 - 64*p78 - 66*p79 - 68*p80 - 70*p81 - 72*p82 - 74*p83 - 76*p84 - 78*p85 - p292 - p294 - p304 - p399 - p410 - p411 + p413 - p416 + p418 + p421 + p424 + p427 + 2*p431 + p436 + p438 = 1
inv : p310 + p331 + p332 = 1
inv : p330 - p332 + p360 - p363 - p387 + p389 = 0
inv : -39*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 - 20*p26 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 - 29*p35 - 30*p36 - 31*p37 - 32*p38 - 33*p39 - 34*p40 - 35*p41 - 36*p42 - 37*p43 - 38*p44 + 40*p45 + p47 + 2*p48 + 3*p49 + 4*p50 + 5*p51 + 6*p52 + 7*p53 + 8*p54 + 9*p55 + 10*p56 + 11*p57 + 12*p58 + 13*p59 + 14*p60 + 15*p61 + 16*p62 + 17*p63 + 18*p64 + 19*p65 + 20*p66 + 21*p67 + 22*p68 + 23*p69 + 24*p70 + 25*p71 + 26*p72 + 27*p73 + 28*p74 + 29*p75 + 30*p76 + 31*p77 + 32*p78 + 33*p79 + 34*p80 + 35*p81 + 36*p82 + 37*p83 + 38*p84 + 39*p85 + p206 + p221 + p294 + p304 + p397 + p399 + p410 + p411 + p416 + p417 - p418 - p431 - p436 = 1
inv : p364 + p374 + p375 + p392 + p393 = 1
inv : p310 + p321 + p332 - p348 + p363 + p379 - p389 = 1
inv : p355 + p357 = 1
inv : p255 + p259 + p260 + p263 + p264 = 1
inv : p291 + p292 = 1
inv : p328 - p332 + p357 - p363 - p385 + p389 = 0
inv : p414 + p415 - p416 - p417 = 0
inv : p364 + p378 + p379 + p392 + p393 = 1
inv : p303 + p304 = 1
inv : p189 + p190 + p191 = 1
inv : p310 + p325 + p332 - p354 + p363 + p383 - p389 = 1
inv : p255 + p259 + p260 + p261 + p262 = 1
inv : p343 + p345 = 1
inv : p310 + p323 + p332 - p351 + p363 + p381 - p389 = 1
inv : 39*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 + 20*p26 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 + 29*p35 + 30*p36 + 31*p37 + 32*p38 + 33*p39 + 34*p40 + 35*p41 + 36*p42 + 37*p43 + 38*p44 - 40*p45 - p47 - 2*p48 - 3*p49 - 4*p50 - 5*p51 - 6*p52 - 7*p53 - 8*p54 - 9*p55 - 10*p56 - 11*p57 - 12*p58 - 13*p59 - 14*p60 - 15*p61 - 16*p62 - 17*p63 - 18*p64 - 19*p65 - 20*p66 - 21*p67 - 22*p68 - 23*p69 - 24*p70 - 25*p71 - 26*p72 - 27*p73 - 28*p74 - 29*p75 - 30*p76 - 31*p77 - 32*p78 - 33*p79 - 34*p80 - 35*p81 - 36*p82 - 37*p83 - 38*p84 - 39*p85 + p213 - p221 - p294 - p304 - p397 - p399 - p410 - p411 - p416 - p417 + p418 + p431 + p436 = 0
inv : p394 + p396 = 1
inv : p364 + p384 + p385 + p392 + p393 = 1
inv : p361 + p363 = 1
inv : p310 + p327 + p332 - p357 + p363 + p385 - p389 = 1
inv : -78*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 - 40*p26 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 - 58*p35 - 60*p36 - 62*p37 - 64*p38 - 66*p39 - 68*p40 - 70*p41 - 72*p42 - 74*p43 - 76*p44 + 40*p45 + p47 + 2*p48 + 3*p49 + 4*p50 + 5*p51 + 6*p52 + 7*p53 + 8*p54 + 9*p55 + 10*p56 + 11*p57 + 12*p58 + 13*p59 + 14*p60 + 15*p61 + 16*p62 + 17*p63 + 18*p64 + 19*p65 + 20*p66 + 21*p67 + 22*p68 + 23*p69 + 24*p70 + 25*p71 + 26*p72 + 27*p73 + 28*p74 + 29*p75 + 30*p76 + 31*p77 + 32*p78 + 33*p79 + 34*p80 + 35*p81 + 36*p82 + 37*p83 + 38*p84 + 39*p85 + 40*p127 + p129 + 2*p130 + 3*p131 + 4*p132 + 5*p133 + 6*p134 + 7*p135 + 8*p136 + 9*p137 + 10*p138 + 11*p139 + 12*p140 + 13*p141 + 14*p142 + 15*p143 + 16*p144 + 17*p145 + 18*p146 + 19*p147 + 20*p148 + 21*p149 + 22*p150 + 23*p151 + 24*p152 + 25*p153 + 26*p154 + 27*p155 + 28*p156 + 29*p157 + 30*p158 + 31*p159 + 32*p160 + 33*p161 + 34*p162 + 35*p163 + 36*p164 + 37*p165 + 38*p166 + 39*p167 + p190 + p221 - p231 - p255 - p259 - p262 - p282 + p292 + p294 + p304 - p391 + p393 + p396 + p399 + p410 + p414 - p418 - p431 - p436 = 0
inv : p182 + p185 = 1
inv : p418 + p420 + p421 + p423 + p424 + p427 = 1
inv : p364 + p376 + p377 + p392 + p393 = 1
inv : p431 + p435 + p436 = 1
inv : p390 + p391 - p392 - p393 = 0
Total of 60 invariants.
[2020-05-15 14:36:17] [INFO ] Computed 60 place invariants in 19 ms
[2020-05-15 14:36:17] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-03(UNSAT) depth K=0 took 35 ms
[2020-05-15 14:36:17] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-05(UNSAT) depth K=0 took 7 ms
[2020-05-15 14:36:17] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-03(UNSAT) depth K=1 took 3 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/graph14455923217850633265.txt, -o, /tmp/graph14455923217850633265.bin, -w, /tmp/graph14455923217850633265.weights], workingDir=null]
[2020-05-15 14:36:17] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-05(UNSAT) depth K=1 took 5 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph14455923217850633265.bin, -l, -1, -v, -w, /tmp/graph14455923217850633265.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 14:36:17] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 225 rows 279 cols
[2020-05-15 14:36:17] [INFO ] Computed 60 place invariants in 8 ms
inv : p234 + p235 + p236 + p244 = 1
inv : p431 + p437 + p438 = 1
inv : p283 + p285 = 1
inv : p310 + p329 + p332 - p360 + p363 + p387 - p389 = 1
inv : p318 - p332 + p342 - p363 - p375 + p389 = 0
inv : p364 + p386 + p387 + p392 + p393 = 1
inv : p352 + p354 = 1
inv : p257 + p258 - p259 - p260 = 0
inv : p346 + p348 = 1
inv : p279 + p280 = 1
inv : p364 + p382 + p383 + p392 + p393 = 1
inv : p397 + p399 + p400 + p403 + p406 + p410 + p411 + p416 + p417 = 1
inv : -78*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 - 40*p26 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 - 58*p35 - 60*p36 - 62*p37 - 64*p38 - 66*p39 - 68*p40 - 70*p41 - 72*p42 - 74*p43 - 76*p44 + 80*p45 + 2*p47 + 4*p48 + 6*p49 + 8*p50 + 10*p51 + 12*p52 + 14*p53 + 16*p54 + 18*p55 + 20*p56 + 22*p57 + 24*p58 + 26*p59 + 28*p60 + 30*p61 + 32*p62 + 34*p63 + 36*p64 + 38*p65 + 40*p66 + 42*p67 + 44*p68 + 46*p69 + 48*p70 + 50*p71 + 52*p72 + 54*p73 + 56*p74 + 58*p75 + 60*p76 + 62*p77 + 64*p78 + 66*p79 + 68*p80 + 70*p81 + 72*p82 + 74*p83 + 76*p84 + 78*p85 + p292 + p294 + p304 + p399 + p412 + p416 - p418 - p421 - p424 - p427 - 2*p431 - p436 - p438 = -1
inv : 39*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 + 20*p26 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 + 29*p35 + 30*p36 + 31*p37 + 32*p38 + 33*p39 + 34*p40 + 35*p41 + 36*p42 + 37*p43 + 38*p44 - 40*p45 - p47 - 2*p48 - 3*p49 - 4*p50 - 5*p51 - 6*p52 - 7*p53 - 8*p54 - 9*p55 - 10*p56 - 11*p57 - 12*p58 - 13*p59 - 14*p60 - 15*p61 - 16*p62 - 17*p63 - 18*p64 - 19*p65 - 20*p66 - 21*p67 - 22*p68 - 23*p69 - 24*p70 - 25*p71 - 26*p72 - 27*p73 - 28*p74 - 29*p75 - 30*p76 - 31*p77 - 32*p78 - 33*p79 - 34*p80 - 35*p81 - 36*p82 - 37*p83 - 38*p84 - 39*p85 - p292 + p301 - p310 - p332 - p363 + p364 + p389 + p392 - p396 - p399 - p410 - p414 + p431 + p436 = 2
inv : p175 + p178 = 1
inv : p214 + p221 = 1
inv : p322 - p332 + p348 - p363 - p379 + p389 = 0
inv : p364 + p380 + p381 + p392 + p393 = 1
inv : p358 + p360 = 1
inv : p293 + p294 = 1
inv : -39*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 - 20*p26 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 - 29*p35 - 30*p36 - 31*p37 - 32*p38 - 33*p39 - 34*p40 - 35*p41 - 36*p42 - 37*p43 - 38*p44 + 40*p45 + p47 + 2*p48 + 3*p49 + 4*p50 + 5*p51 + 6*p52 + 7*p53 + 8*p54 + 9*p55 + 10*p56 + 11*p57 + 12*p58 + 13*p59 + 14*p60 + 15*p61 + 16*p62 + 17*p63 + 18*p64 + 19*p65 + 20*p66 + 21*p67 + 22*p68 + 23*p69 + 24*p70 + 25*p71 + 26*p72 + 27*p73 + 28*p74 + 29*p75 + 30*p76 + 31*p77 + 32*p78 + 33*p79 + 34*p80 + 35*p81 + 36*p82 + 37*p83 + 38*p84 + 39*p85 + p292 + p302 + p310 + p332 + p363 - p364 - p389 - p392 + p396 + p399 + p410 + p414 - p431 - p436 = -1
inv : p229 + p231 = 1
inv : p324 - p332 + p351 - p363 - p381 + p389 = 0
inv : p340 + p342 = 1
inv : p281 + p282 = 1
inv : p320 - p332 + p345 - p363 - p377 + p389 = 0
inv : p310 + p319 + p332 - p345 + p363 + p377 - p389 = 1
inv : p349 + p351 = 1
inv : p364 + p388 + p389 + p392 + p393 = 1
inv : p326 - p332 + p354 - p363 - p383 + p389 = 0
inv : p310 + p317 + p332 - p342 + p363 + p375 - p389 = 1
inv : 78*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 + 40*p26 + 42*p27 + 44*p28 + 46*p29 + 48*p30 + 50*p31 + 52*p32 + 54*p33 + 56*p34 + 58*p35 + 60*p36 + 62*p37 + 64*p38 + 66*p39 + 68*p40 + 70*p41 + 72*p42 + 74*p43 + 76*p44 - 80*p45 - 2*p47 - 4*p48 - 6*p49 - 8*p50 - 10*p51 - 12*p52 - 14*p53 - 16*p54 - 18*p55 - 20*p56 - 22*p57 - 24*p58 - 26*p59 - 28*p60 - 30*p61 - 32*p62 - 34*p63 - 36*p64 - 38*p65 - 40*p66 - 42*p67 - 44*p68 - 46*p69 - 48*p70 - 50*p71 - 52*p72 - 54*p73 - 56*p74 - 58*p75 - 60*p76 - 62*p77 - 64*p78 - 66*p79 - 68*p80 - 70*p81 - 72*p82 - 74*p83 - 76*p84 - 78*p85 - p292 - p294 - p304 - p399 - p410 - p411 + p413 - p416 + p418 + p421 + p424 + p427 + 2*p431 + p436 + p438 = 1
inv : p310 + p331 + p332 = 1
inv : p330 - p332 + p360 - p363 - p387 + p389 = 0
inv : -39*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 - 20*p26 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 - 29*p35 - 30*p36 - 31*p37 - 32*p38 - 33*p39 - 34*p40 - 35*p41 - 36*p42 - 37*p43 - 38*p44 + 40*p45 + p47 + 2*p48 + 3*p49 + 4*p50 + 5*p51 + 6*p52 + 7*p53 + 8*p54 + 9*p55 + 10*p56 + 11*p57 + 12*p58 + 13*p59 + 14*p60 + 15*p61 + 16*p62 + 17*p63 + 18*p64 + 19*p65 + 20*p66 + 21*p67 + 22*p68 + 23*p69 + 24*p70 + 25*p71 + 26*p72 + 27*p73 + 28*p74 + 29*p75 + 30*p76 + 31*p77 + 32*p78 + 33*p79 + 34*p80 + 35*p81 + 36*p82 + 37*p83 + 38*p84 + 39*p85 + p206 + p221 + p294 + p304 + p397 + p399 + p410 + p411 + p416 + p417 - p418 - p431 - p436 = 1
inv : p364 + p374 + p375 + p392 + p393 = 1
inv : p310 + p321 + p332 - p348 + p363 + p379 - p389 = 1
inv : p355 + p357 = 1
inv : p255 + p259 + p260 + p263 + p264 = 1
inv : p291 + p292 = 1
inv : p328 - p332 + p357 - p363 - p385 + p389 = 0
inv : p414 + p415 - p416 - p417 = 0
inv : p364 + p378 + p379 + p392 + p393 = 1
inv : p303 + p304 = 1
inv : p189 + p190 + p191 = 1
inv : p310 + p325 + p332 - p354 + p363 + p383 - p389 = 1
inv : p255 + p259 + p260 + p261 + p262 = 1
inv : p343 + p345 = 1
inv : p310 + p323 + p332 - p351 + p363 + p381 - p389 = 1
inv : 39*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 + 20*p26 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 + 29*p35 + 30*p36 + 31*p37 + 32*p38 + 33*p39 + 34*p40 + 35*p41 + 36*p42 + 37*p43 + 38*p44 - 40*p45 - p47 - 2*p48 - 3*p49 - 4*p50 - 5*p51 - 6*p52 - 7*p53 - 8*p54 - 9*p55 - 10*p56 - 11*p57 - 12*p58 - 13*p59 - 14*p60 - 15*p61 - 16*p62 - 17*p63 - 18*p64 - 19*p65 - 20*p66 - 21*p67 - 22*p68 - 23*p69 - 24*p70 - 25*p71 - 26*p72 - 27*p73 - 28*p74 - 29*p75 - 30*p76 - 31*p77 - 32*p78 - 33*p79 - 34*p80 - 35*p81 - 36*p82 - 37*p83 - 38*p84 - 39*p85 + p213 - p221 - p294 - p304 - p397 - p399 - p410 - p411 - p416 - p417 + p418 + p431 + p436 = 0
inv : p394 + p396 = 1
inv : p364 + p384 + p385 + p392 + p393 = 1
inv : p361 + p363 = 1
inv : p310 + p327 + p332 - p357 + p363 + p385 - p389 = 1
inv : -78*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 - 40*p26 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 - 58*p35 - 60*p36 - 62*p37 - 64*p38 - 66*p39 - 68*p40 - 70*p41 - 72*p42 - 74*p43 - 76*p44 + 40*p45 + p47 + 2*p48 + 3*p49 + 4*p50 + 5*p51 + 6*p52 + 7*p53 + 8*p54 + 9*p55 + 10*p56 + 11*p57 + 12*p58 + 13*p59 + 14*p60 + 15*p61 + 16*p62 + 17*p63 + 18*p64 + 19*p65 + 20*p66 + 21*p67 + 22*p68 + 23*p69 + 24*p70 + 25*p71 + 26*p72 + 27*p73 + 28*p74 + 29*p75 + 30*p76 + 31*p77 + 32*p78 + 33*p79 + 34*p80 + 35*p81 + 36*p82 + 37*p83 + 38*p84 + 39*p85 + 40*p127 + p129 + 2*p130 + 3*p131 + 4*p132 + 5*p133 + 6*p134 + 7*p135 + 8*p136 + 9*p137 + 10*p138 + 11*p139 + 12*p140 + 13*p141 + 14*p142 + 15*p143 + 16*p144 + 17*p145 + 18*p146 + 19*p147 + 20*p148 + 21*p149 + 22*p150 + 23*p151 + 24*p152 + 25*p153 + 26*p154 + 27*p155 + 28*p156 + 29*p157 + 30*p158 + 31*p159 + 32*p160 + 33*p161 + 34*p162 + 35*p163 + 36*p164 + 37*p165 + 38*p166 + 39*p167 + p190 + p221 - p231 - p255 - p259 - p262 - p282 + p292 + p294 + p304 - p391 + p393 + p396 + p399 + p410 + p414 - p418 - p431 - p436 = 0
inv : p182 + p185 = 1
inv : p418 + p420 + p421 + p423 + p424 + p427 = 1
inv : p364 + p376 + p377 + p392 + p393 = 1
inv : p431 + p435 + p436 = 1
inv : p390 + p391 - p392 - p393 = 0
Total of 60 invariants.
[2020-05-15 14:36:17] [INFO ] Computed 60 place invariants in 20 ms
[2020-05-15 14:36:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 14:36:17] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-03(UNSAT) depth K=2 took 242 ms
[2020-05-15 14:36:17] [INFO ] Removed a total of 76 redundant transitions.
[2020-05-15 14:36:17] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-05(UNSAT) depth K=2 took 118 ms
[2020-05-15 14:36:17] [INFO ] Flatten gal took : 144 ms
[2020-05-15 14:36:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 23 ms.
[2020-05-15 14:36:17] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 37 ms
[2020-05-15 14:36:17] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : DES-PT-40b-ReachabilityCardinality-03 with value :((u2.p158!=0)&&(i1.u8.p262!=1))
Read [reachable] property : DES-PT-40b-ReachabilityCardinality-05 with value :(((i4.u12.p22!=0)&&(i9.i0.u24.p342!=1))&&((i0.i0.u40.p390==1)||((i5.u18.p322!=0)&&(u46.p52!=1))))
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 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
[2020-05-15 14:36:19] [INFO ] Proved 279 variables to be positive in 1834 ms
[2020-05-15 14:36:19] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2020-05-15 14:36:19] [INFO ] Computation of disable matrix completed :0/225 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 14:36:19] [INFO ] Computation of Complete disable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 14:36:19] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2020-05-15 14:36:19] [INFO ] Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 4096
[2020-05-15 14:36:19] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-03(UNSAT) depth K=3 took 1646 ms
[2020-05-15 14:36:19] [INFO ] Proved 279 variables to be positive in 1907 ms
[2020-05-15 14:36:19] [INFO ] Computing symmetric co enabling matrix : 225 transitions.
[2020-05-15 14:36:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40b-ReachabilityCardinality-03
[2020-05-15 14:36:19] [INFO ] KInduction solution for property DES-PT-40b-ReachabilityCardinality-03(SAT) depth K=0 took 307 ms
[2020-05-15 14:36:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40b-ReachabilityCardinality-05
[2020-05-15 14:36:20] [INFO ] KInduction solution for property DES-PT-40b-ReachabilityCardinality-05(SAT) depth K=0 took 560 ms
[2020-05-15 14:36:21] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-05(UNSAT) depth K=3 took 1837 ms
SDD proceeding with computation, new max is 8192
[2020-05-15 14:36:22] [INFO ] Computation of co-enabling matrix(4/225) took 2794 ms. Total solver calls (SAT/UNSAT): 624(577/47)
[2020-05-15 14:36:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40b-ReachabilityCardinality-03
[2020-05-15 14:36:23] [INFO ] KInduction solution for property DES-PT-40b-ReachabilityCardinality-03(SAT) depth K=1 took 3674 ms
[2020-05-15 14:36:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40b-ReachabilityCardinality-05
[2020-05-15 14:36:24] [INFO ] KInduction solution for property DES-PT-40b-ReachabilityCardinality-05(SAT) depth K=1 took 202 ms
[2020-05-15 14:36:25] [INFO ] Computation of co-enabling matrix(9/225) took 6034 ms. Total solver calls (SAT/UNSAT): 1319(1227/92)
[2020-05-15 14:36:28] [INFO ] Computation of co-enabling matrix(14/225) took 9330 ms. Total solver calls (SAT/UNSAT): 1989(1852/137)
Reachability property DES-PT-40b-ReachabilityCardinality-03 is true.
FORMULA DES-PT-40b-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 16384
[2020-05-15 14:36:32] [INFO ] Computation of co-enabling matrix(20/225) took 12869 ms. Total solver calls (SAT/UNSAT): 2760(2569/191)
[2020-05-15 14:36:35] [INFO ] Computation of co-enabling matrix(25/225) took 15914 ms. Total solver calls (SAT/UNSAT): 3375(3139/236)
[2020-05-15 14:36:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40b-ReachabilityCardinality-03
[2020-05-15 14:36:37] [INFO ] KInduction solution for property DES-PT-40b-ReachabilityCardinality-03(SAT) depth K=2 took 13649 ms
[2020-05-15 14:36:38] [INFO ] Computation of co-enabling matrix(31/225) took 19130 ms. Total solver calls (SAT/UNSAT): 4080(3790/290)
[2020-05-15 14:36:42] [INFO ] Computation of co-enabling matrix(38/225) took 22582 ms. Total solver calls (SAT/UNSAT): 4857(4504/353)
[2020-05-15 14:36:45] [INFO ] Computation of co-enabling matrix(50/225) took 25606 ms. Total solver calls (SAT/UNSAT): 5499(5110/389)
SDD proceeding with computation, new max is 32768
[2020-05-15 14:36:48] [INFO ] Computation of co-enabling matrix(82/225) took 28834 ms. Total solver calls (SAT/UNSAT): 6097(5619/478)
[2020-05-15 14:36:51] [INFO ] Computation of co-enabling matrix(90/225) took 31865 ms. Total solver calls (SAT/UNSAT): 6717(6176/541)
[2020-05-15 14:36:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40b-ReachabilityCardinality-05
[2020-05-15 14:36:51] [INFO ] KInduction solution for property DES-PT-40b-ReachabilityCardinality-05(SAT) depth K=2 took 14185 ms
[2020-05-15 14:36:54] [INFO ] Computation of co-enabling matrix(103/225) took 35071 ms. Total solver calls (SAT/UNSAT): 7266(6620/646)
[2020-05-15 14:36:57] [INFO ] Computation of co-enabling matrix(114/225) took 38360 ms. Total solver calls (SAT/UNSAT): 7898(7209/689)
[2020-05-15 14:37:01] [INFO ] Computation of co-enabling matrix(123/225) took 41686 ms. Total solver calls (SAT/UNSAT): 8753(8046/707)
[2020-05-15 14:37:02] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-03(UNSAT) depth K=4 took 41755 ms
[2020-05-15 14:37:04] [INFO ] Computation of co-enabling matrix(132/225) took 44798 ms. Total solver calls (SAT/UNSAT): 9527(8802/725)
[2020-05-15 14:37:07] [INFO ] Computation of co-enabling matrix(142/225) took 48080 ms. Total solver calls (SAT/UNSAT): 10292(9547/745)
[2020-05-15 14:37:10] [INFO ] Computation of co-enabling matrix(159/225) took 51289 ms. Total solver calls (SAT/UNSAT): 10951(10181/770)
[2020-05-15 14:37:13] [INFO ] Computation of co-enabling matrix(174/225) took 54413 ms. Total solver calls (SAT/UNSAT): 11648(10788/860)
Reachability property DES-PT-40b-ReachabilityCardinality-05 is true.
FORMULA DES-PT-40b-ReachabilityCardinality-05 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 32769 fixpoint passes
[2020-05-15 14:37:17] [INFO ] Computation of co-enabling matrix(183/225) took 57659 ms. Total solver calls (SAT/UNSAT): 12044(11184/860)
[2020-05-15 14:37:20] [INFO ] Computation of co-enabling matrix(197/225) took 60759 ms. Total solver calls (SAT/UNSAT): 12499(11639/860)
[2020-05-15 14:37:21] [INFO ] BMC solution for property DES-PT-40b-ReachabilityCardinality-05(UNSAT) depth K=4 took 18393 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,2.35058e+13,63.3846,655516,13508,3506,1.24781e+06,10858,363,822698,394,71152,0
Total reachable state count : 23505819697634

Verifying 2 reachability properties.
Reachability property DES-PT-40b-ReachabilityCardinality-03 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-40b-ReachabilityCardinality-03,1008,63.5944,655012,71,160,1.24781e+06,10858,370,822698,399,71152,1281
Reachability property DES-PT-40b-ReachabilityCardinality-05 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-40b-ReachabilityCardinality-05,2016,63.7298,655012,73,195,1.24781e+06,10858,394,822698,407,71152,2769
[2020-05-15 14:37:21] [WARNING] Interrupting SMT solver.
[2020-05-15 14:37:21] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-15 14:37:21] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-15 14:37:21] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 159) (select s0 160)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 159) (select s0 160)))")
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 14:37:21] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-40b-ReachabilityCardinality-05 K-induction depth 3
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 14:37:21] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 159) (select s0 160)))), (assert (= 1 (+ (select s0 168) (select s0 169)))), (assert (= (+ (* 39 (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)) (* 10 (select s0 10)) (* 11 (select s0 11)) (* 12 (select s0 12)) (* 13 (select s0 13)) (* 14 (select s0 14)) (* 15 (select s0 15)) (* 16 (select s0 16)) (* 17 (select s0 17)) (* 18 (select s0 18)) (* 19 (select s0 19)) (* 20 (select s0 20)) (* 21 (select s0 21)) (* 22 (select s0 22)) (* 23 (select s0 23)) (* 24 (select s0 24)) (* 25 (select s0 25)) (* 26 (select s0 26)) (* 27 (select s0 27)) (* 28 (select s0 28)) (* 29 (select s0 29)) (* 30 (select s0 30)) (* 31 (select s0 31)) (* 32 (select s0 32)) (* 33 (select s0 33)) (* 34 (select s0 34)) (* 35 (select s0 35)) (* 36 (select s0 36)) (* 37 (select s0 37)) (* 38 (select s0 38)) (select s0 268) (select s0 274) (select s0 276) 1) (+ (* 40 (select s0 39)) (select s0 40) (* 2 (select s0 41)) (* 3 (select s0 42)) (* 4 (select s0 43)) (* 5 (select s0 44)) (* 6 (select s0 45)) (* 7 (select s0 46)) (* 8 (select s0 47)) (* 9 (select s0 48)) (* 10 (select s0 49)) (* 11 (select s0 50)) (* 12 (select s0 51)) (* 13 (select s0 52)) (* 14 (select s0 53)) (* 15 (select s0 54)) (* 16 (select s0 55)) (* 17 (select s0 56)) (* 18 (select s0 57)) (* 19 (select s0 58)) (* 20 (select s0 59)) (* 21 (select s0 60)) (* 22 (select s0 61)) (* 23 (select s0 62)) (* 24 (select s0 63)) (* 25 (select s0 64)) (* 26 (select s0 65)) (* 27 (select s0 66)) (* 28 (select s0 67)) (* 29 (select s0 68)) (* 30 (select s0 69)) (* 31 (select s0 70)) (* 32 (select s0 71)) (* 33 (select s0 72)) (* 34 (select s0 73)) (* 35 (select s0 74)) (* 36 (select s0 75)) (* 37 (select s0 76)) (* 38 (select s0 77)) (* 39 (select s0 78)) (select s0 166) (select s0 169) (select s0 194) (select s0 198) (select s0 255) (select s0 256) (select s0 260) (select s0 261) (select s0 266) (select s0 267)))), (assert (= 1 (+ (select s0 163) (select s0 164) (select s0 165)))), (assert (= (+ (* 78 (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)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (* 40 (select s0 20)) (* 42 (select s0 21)) (* 44 (select s0 22)) (* 46 (select s0 23)) (* 48 (select s0 24)) (* 50 (select s0 25)) (* 52 (select s0 26)) (* 54 (select s0 27)) (* 56 (select s0 28)) (* 58 (select s0 29)) (* 60 (select s0 30)) (* 62 (select s0 31)) (* 64 (select s0 32)) (* 66 (select s0 33)) (* 68 (select s0 34)) (* 70 (select s0 35)) (* 72 (select s0 36)) (* 74 (select s0 37)) (* 76 (select s0 38)) (select s0 171) (select s0 176) (select s0 179) (select s0 182) (select s0 188) (select s0 250) (select s0 268) (select s0 274) (select s0 276) 0) (+ (* 40 (select s0 39)) (select s0 40) (* 2 (select s0 41)) (* 3 (select s0 42)) (* 4 (select s0 43)) (* 5 (select s0 44)) (* 6 (select s0 45)) (* 7 (select s0 46)) (* 8 (select s0 47)) (* 9 (select s0 48)) (* 10 (select s0 49)) (* 11 (select s0 50)) (* 12 (select s0 51)) (* 13 (select s0 52)) (* 14 (select s0 53)) (* 15 (select s0 54)) (* 16 (select s0 55)) (* 17 (select s0 56)) (* 18 (select s0 57)) (* 19 (select s0 58)) (* 20 (select s0 59)) (* 21 (select s0 60)) (* 22 (select s0 61)) (* 23 (select s0 62)) (* 24 (select s0 63)) (* 25 (select s0 64)) (* 26 (select s0 65)) (* 27 (select s0 66)) (* 28 (select s0 67)) (* 29 (select s0 68)) (* 30 (select s0 69)) (* 31 (select s0 70)) (* 32 (select s0 71)) (* 33 (select s0 72)) (* 34 (select s0 73)) (* 35 (select s0 74)) (* 36 (select s0 75)) (* 37 (select s0 76)) (* 38 (select s0 77)) (* 39 (select s0 78)) (* 40 (select s0 119)) (select s0 120) (* 2 (select s0 121)) (* 3 (select s0 122)) (* 4 (select s0 123)) (* 5 (select s0 124)) (* 6 (select s0 125)) (* 7 (select s0 126)) (* 8 (select s0 127)) (* 9 (select s0 128)) (* 10 (select s0 129)) (* 11 (select s0 130)) (* 12 (select s0 131)) (* 13 (select s0 132)) (* 14 (select s0 133)) (* 15 (select s0 134)) (* 16 (select s0 135)) (* 17 (select s0 136)) (* 18 (select s0 137)) (* 19 (select s0 138)) (* 20 (select s0 139)) (* 21 (select s0 140)) (* 22 (select s0 141)) (* 23 (select s0 142)) (* 24 (select s0 143)) (* 25 (select s0 144)) (* 26 (select s0 145)) (* 27 (select s0 146)) (* 28 (select s0 147)) (* 29 (select s0 148)) (* 30 (select s0 149)) (* 31 (select s0 150)) (* 32 (select s0 151)) (* 33 (select s0 152)) (* 34 (select s0 153)) (* 35 (select s0 154)) (* 36 (select s0 155)) (* 37 (select s0 156)) (* 38 (select s0 157)) (* 39 (select s0 158)) (select s0 164) (select s0 169) (select s0 192) (select s0 194) (select s0 198) (select s0 252) (select s0 254) (select s0 256) (select s0 260) (select s0 264)))), (assert (= 1 (+ (select s0 161) (select s0 162)))), (assert (and (and (and (and (>= (select s0 159) 1) (>= (select s0 161) 1)) (>= (select s0 164) 1)) (>= (select s0 166) 1)) (>= (select s0 168) 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 20) 0)), (assert (>= (select s0 21) 0)), (assert (>= (select s0 22) 0)), (assert (>= (select s0 23) 0)), (assert (>= (select s0 24) 0)), (assert (>= (select s0 25) 0)), (assert (>= (select s0 26) 0)), (assert (>= (select s0 27) 0)), (assert (>= (select s0 28) 0)), (assert (>= (select s0 29) 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 42) 0)), (assert (>= (select s0 43) 0)), (assert (>= (select s0 44) 0)), (assert (>= (select s0 45) 0)), (assert (>= (select s0 46) 0)), (assert (>= (select s0 47) 0)), (assert (>= (select s0 48) 0)), (assert (>= (select s0 49) 0)), (assert (>= (select s0 50) 0)), (assert (>= (select s0 51) 0)), (assert (>= (select s0 52) 0)), (assert (>= (select s0 53) 0)), (assert (>= (select s0 54) 0)), (assert (>= (select s0 55) 0)), (assert (>= (select s0 56) 0)), (assert (>= (select s0 57) 0)), (assert (>= (select s0 58) 0)), (assert (>= (select s0 59) 0)), (assert (>= (select s0 60) 0)), (assert (>= (select s0 61) 0)), (assert (>= (select s0 62) 0)), (assert (>= (select s0 63) 0)), (assert (>= (select s0 64) 0)), (assert (>= (select s0 65) 0)), (assert (>= (select s0 66) 0)), (assert (>= (select s0 67) 0)), (assert (>= (select s0 68) 0)), (assert (>= (select s0 69) 0)), (assert (>= (select s0 70) 0)), (assert (>= (select s0 71) 0)), (assert (>= (select s0 72) 0)), (assert (>= (select s0 73) 0)), (assert (>= (select s0 74) 0)), (assert (>= (select s0 75) 0)), (assert (>= (select s0 76) 0)), (assert (>= (select s0 77) 0)), (assert (>= (select s0 78) 0)), (assert (>= (select s0 119) 0)), (assert (>= (select s0 120) 0)), (assert (>= (select s0 121) 0)), (assert (>= (select s0 122) 0)), (assert (>= (select s0 123) 0)), (assert (>= (select s0 124) 0)), (assert (>= (select s0 125) 0)), (assert (>= (select s0 126) 0)), (assert (>= (select s0 127) 0)), (assert (>= (select s0 128) 0)), (assert (>= (select s0 129) 0)), (assert (>= (select s0 130) 0)), (assert (>= (select s0 131) 0)), (assert (>= (select s0 132) 0)), (assert (>= (select s0 133) 0)), (assert (>= (select s0 134) 0)), (assert (>= (select s0 135) 0)), (assert (>= (select s0 136) 0)), (assert (>= (select s0 137) 0)), (assert (>= (select s0 138) 0)), (assert (>= (select s0 139) 0)), (assert (>= (select s0 140) 0)), (assert (>= (select s0 141) 0)), (assert (>= (select s0 142) 0)), (assert (>= (select s0 143) 0)), (assert (>= (select s0 144) 0)), (assert (>= (select s0 145) 0)), (assert (>= (select s0 146) 0)), (assert (>= (select s0 147) 0)), (assert (>= (select s0 148) 0)), (assert (>= (select s0 149) 0)), (assert (>= (select s0 150) 0)), (assert (>= (select s0 151) 0)), (assert (>= (select s0 152) 0)), (assert (>= (select s0 153) 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 171) 0)), (assert (>= (select s0 176) 0)), (assert (>= (select s0 179) 0)), (assert (>= (select s0 182) 0)), (assert (>= (select s0 188) 0)), (assert (>= (select s0 192) 0)), (assert (>= (select s0 194) 0)), (assert (>= (select s0 198) 0)), (assert (>= (select s0 250) 0)), (assert (>= (select s0 252) 0)), (assert (>= (select s0 254) 0)), (assert (>= (select s0 255) 0)), (assert (>= (select s0 256) 0)), (assert (>= (select s0 260) 0)), (assert (>= (select s0 261) 0)), (assert (>= (select s0 264) 0)), (assert (>= (select s0 266) 0)), (assert (>= (select s0 267) 0)), (assert (>= (select s0 268) 0)), (assert (>= (select s0 274) 0)), (assert (>= (select s0 276) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@2863f118
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@2863f118
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 14:37:22] [INFO ] Built C files in 65152ms 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 1589553442623

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-40b"
export BK_EXAMINATION="ReachabilityCardinality"
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-40b, examination is ReachabilityCardinality"
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-158902546000302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;