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

About the Execution of ITS-Tools for DES-PT-30a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.450 147513.00 207001.00 168.20 FTTTTTFFTTFFFFFT 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-158902545900278.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-30a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 24K 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.9K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:17 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 70K 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-30a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589545770672

[2020-05-15 12:29:33] [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 12:29:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 12:29:34] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2020-05-15 12:29:34] [INFO ] Transformed 234 places.
[2020-05-15 12:29:34] [INFO ] Transformed 191 transitions.
[2020-05-15 12:29:34] [INFO ] Found NUPN structural information;
[2020-05-15 12:29:34] [INFO ] Parsed PT model containing 234 places and 191 transitions in 348 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 232 resets, run finished after 118 ms. (steps per millisecond=84 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 0]
FORMULA DES-PT-30a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 177 rows 234 cols
[2020-05-15 12:29:34] [INFO ] Computed 59 place invariants in 34 ms
[2020-05-15 12:29:35] [INFO ] [Real]Absence check using 34 positive place invariants in 65 ms returned sat
[2020-05-15 12:29:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2020-05-15 12:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:35] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2020-05-15 12:29:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:29:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-05-15 12:29:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 70 ms returned sat
[2020-05-15 12:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:36] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2020-05-15 12:29:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 12:29:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-15 12:29:36] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 44 ms.
[2020-05-15 12:29:37] [INFO ] Added : 152 causal constraints over 31 iterations in 1450 ms. Result :sat
[2020-05-15 12:29:37] [INFO ] Deduced a trap composed of 12 places in 137 ms
[2020-05-15 12:29:38] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-05-15 12:29:38] [INFO ] Deduced a trap composed of 18 places in 91 ms
[2020-05-15 12:29:38] [INFO ] Deduced a trap composed of 9 places in 91 ms
[2020-05-15 12:29:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 624 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-05-15 12:29:38] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 12:29:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2020-05-15 12:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:38] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2020-05-15 12:29:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:29:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 54 ms returned sat
[2020-05-15 12:29:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 121 ms returned sat
[2020-05-15 12:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:39] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2020-05-15 12:29:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 12:29:39] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2020-05-15 12:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2020-05-15 12:29:39] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 24 ms.
[2020-05-15 12:29:41] [INFO ] Added : 148 causal constraints over 30 iterations in 1267 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-15 12:29:41] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 12:29:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 12:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:41] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2020-05-15 12:29:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:29:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-05-15 12:29:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 98 ms returned sat
[2020-05-15 12:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:42] [INFO ] [Nat]Absence check using state equation in 96 ms returned unsat
[2020-05-15 12:29:42] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 12:29:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 12:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:42] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2020-05-15 12:29:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:29:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 51 ms returned sat
[2020-05-15 12:29:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 12:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:43] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2020-05-15 12:29:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 12:29:43] [INFO ] Deduced a trap composed of 11 places in 88 ms
[2020-05-15 12:29:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2020-05-15 12:29:43] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 25 ms.
[2020-05-15 12:29:45] [INFO ] Added : 164 causal constraints over 33 iterations in 1725 ms. Result :sat
[2020-05-15 12:29:45] [INFO ] Deduced a trap composed of 9 places in 158 ms
[2020-05-15 12:29:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-15 12:29:45] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-05-15 12:29:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2020-05-15 12:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:29:46] [INFO ] [Real]Absence check using state equation in 75 ms returned unsat
FORMULA DES-PT-30a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 103900 steps, including 2357 resets, run finished after 559 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 122600 steps, including 2930 resets, run finished after 561 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 143800 steps, including 3722 resets, run finished after 621 ms. (steps per millisecond=231 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 234 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 234/234 places, 177/177 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 175
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 234 transition count 175
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 233 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 233 transition count 174
Applied a total of 10 rules in 141 ms. Remains 233 /234 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 233/234 places, 174/177 transitions.
Incomplete random walk after 1000000 steps, including 15519 resets, run finished after 4185 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3308 resets, run finished after 2239 ms. (steps per millisecond=446 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2918 resets, run finished after 2088 ms. (steps per millisecond=478 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2880 resets, run finished after 2258 ms. (steps per millisecond=442 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8255117 steps, run timeout after 30001 ms. (steps per millisecond=275 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8255117 steps, saw 1085005 distinct states, run finished after 30004 ms. (steps per millisecond=275 ) properties seen :[0, 0, 0]
// Phase 1: matrix 174 rows 233 cols
[2020-05-15 12:30:28] [INFO ] Computed 61 place invariants in 17 ms
[2020-05-15 12:30:28] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-15 12:30:28] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 12:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:30:29] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2020-05-15 12:30:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:30:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-05-15 12:30:29] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 70 ms returned sat
[2020-05-15 12:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:30:29] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2020-05-15 12:30:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-15 12:30:30] [INFO ] [Nat]Added 4 Read/Feed constraints in 36 ms returned sat
[2020-05-15 12:30:30] [INFO ] Deduced a trap composed of 31 places in 154 ms
[2020-05-15 12:30:30] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2020-05-15 12:30:30] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-05-15 12:30:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2020-05-15 12:30:30] [INFO ] Computed and/alt/rep : 173/787/173 causal constraints in 20 ms.
[2020-05-15 12:30:32] [INFO ] Added : 163 causal constraints over 33 iterations in 1400 ms. Result :sat
[2020-05-15 12:30:32] [INFO ] Deduced a trap composed of 10 places in 111 ms
[2020-05-15 12:30:32] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2020-05-15 12:30:32] [INFO ] Deduced a trap composed of 18 places in 66 ms
[2020-05-15 12:30:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-05-15 12:30:32] [INFO ] [Real]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-05-15 12:30:32] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 49 ms returned sat
[2020-05-15 12:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:30:33] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2020-05-15 12:30:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:30:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-05-15 12:30:33] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 12:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:30:33] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2020-05-15 12:30:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 16 ms returned sat
[2020-05-15 12:30:33] [INFO ] Deduced a trap composed of 31 places in 37 ms
[2020-05-15 12:30:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2020-05-15 12:30:33] [INFO ] Computed and/alt/rep : 173/787/173 causal constraints in 97 ms.
[2020-05-15 12:30:35] [INFO ] Added : 146 causal constraints over 30 iterations in 1435 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-15 12:30:35] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-05-15 12:30:35] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 49 ms returned sat
[2020-05-15 12:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:30:35] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2020-05-15 12:30:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:30:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-05-15 12:30:36] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 86 ms returned sat
[2020-05-15 12:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:30:36] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2020-05-15 12:30:36] [INFO ] [Nat]Added 4 Read/Feed constraints in 23 ms returned sat
[2020-05-15 12:30:36] [INFO ] Computed and/alt/rep : 173/787/173 causal constraints in 31 ms.
[2020-05-15 12:30:37] [INFO ] Added : 81 causal constraints over 17 iterations in 943 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 66300 steps, including 745 resets, run finished after 281 ms. (steps per millisecond=235 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 125200 steps, including 1301 resets, run finished after 492 ms. (steps per millisecond=254 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 143900 steps, including 1506 resets, run finished after 627 ms. (steps per millisecond=229 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 42 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 233/233 places, 174/174 transitions.
Starting structural reductions, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 30 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 233 cols
[2020-05-15 12:30:39] [INFO ] Computed 61 place invariants in 11 ms
[2020-05-15 12:30:40] [INFO ] Implicit Places using invariants in 1044 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1050 ms to find 1 implicit places.
[2020-05-15 12:30:40] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:30:40] [INFO ] Computed 60 place invariants in 9 ms
[2020-05-15 12:30:40] [INFO ] Dead Transitions using invariants and state equation in 591 ms returned []
Starting structural reductions, iteration 1 : 232/233 places, 174/174 transitions.
Applied a total of 0 rules in 26 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2020-05-15 12:30:40] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:30:40] [INFO ] Computed 60 place invariants in 12 ms
[2020-05-15 12:30:41] [INFO ] Dead Transitions using invariants and state equation in 765 ms returned []
Finished structural reductions, in 2 iterations. Remains : 232/233 places, 174/174 transitions.
Incomplete random walk after 1000000 steps, including 15544 resets, run finished after 3934 ms. (steps per millisecond=254 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3339 resets, run finished after 2012 ms. (steps per millisecond=497 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2962 resets, run finished after 1939 ms. (steps per millisecond=515 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2885 resets, run finished after 2069 ms. (steps per millisecond=483 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8941303 steps, run timeout after 30001 ms. (steps per millisecond=298 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8941303 steps, saw 1184729 distinct states, run finished after 30001 ms. (steps per millisecond=298 ) properties seen :[0, 0, 0]
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:21] [INFO ] Computed 60 place invariants in 7 ms
[2020-05-15 12:31:21] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-05-15 12:31:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2020-05-15 12:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:22] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-05-15 12:31:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:31:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-05-15 12:31:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2020-05-15 12:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:22] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2020-05-15 12:31:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 12:31:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 58 ms returned sat
[2020-05-15 12:31:22] [INFO ] Deduced a trap composed of 31 places in 41 ms
[2020-05-15 12:31:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2020-05-15 12:31:22] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 28 ms.
[2020-05-15 12:31:24] [INFO ] Added : 163 causal constraints over 33 iterations in 1460 ms. Result :sat
[2020-05-15 12:31:24] [INFO ] Deduced a trap composed of 12 places in 80 ms
[2020-05-15 12:31:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-15 12:31:24] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-05-15 12:31:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 12:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:25] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2020-05-15 12:31:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:31:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-05-15 12:31:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 100 ms returned sat
[2020-05-15 12:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:25] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2020-05-15 12:31:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 35 ms returned sat
[2020-05-15 12:31:25] [INFO ] Deduced a trap composed of 31 places in 50 ms
[2020-05-15 12:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2020-05-15 12:31:25] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 37 ms.
[2020-05-15 12:31:27] [INFO ] Added : 146 causal constraints over 30 iterations in 1558 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 45 ms.
[2020-05-15 12:31:27] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-05-15 12:31:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2020-05-15 12:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:28] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2020-05-15 12:31:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:31:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 95 ms returned sat
[2020-05-15 12:31:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 89 ms returned sat
[2020-05-15 12:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:28] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2020-05-15 12:31:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2020-05-15 12:31:28] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 22 ms.
[2020-05-15 12:31:29] [INFO ] Added : 81 causal constraints over 17 iterations in 1006 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 70100 steps, including 188 resets, run finished after 395 ms. (steps per millisecond=177 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA DES-PT-30a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 113700 steps, including 1313 resets, run finished after 616 ms. (steps per millisecond=184 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 125200 steps, including 1706 resets, run finished after 670 ms. (steps per millisecond=186 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 22 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 29 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:31] [INFO ] Computed 60 place invariants in 8 ms
[2020-05-15 12:31:32] [INFO ] Implicit Places using invariants in 903 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:32] [INFO ] Computed 60 place invariants in 28 ms
[2020-05-15 12:31:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 12:31:34] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned []
Implicit Place search using SMT with State Equation took 3218 ms to find 0 implicit places.
[2020-05-15 12:31:34] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:34] [INFO ] Computed 60 place invariants in 5 ms
[2020-05-15 12:31:35] [INFO ] Dead Transitions using invariants and state equation in 562 ms returned []
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Incomplete random walk after 100000 steps, including 1540 resets, run finished after 373 ms. (steps per millisecond=268 ) properties seen :[0, 0]
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:35] [INFO ] Computed 60 place invariants in 18 ms
[2020-05-15 12:31:36] [INFO ] [Real]Absence check using 35 positive place invariants in 93 ms returned sat
[2020-05-15 12:31:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 65 ms returned sat
[2020-05-15 12:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:37] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2020-05-15 12:31:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:31:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-05-15 12:31:37] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 65 ms returned sat
[2020-05-15 12:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:37] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2020-05-15 12:31:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 12:31:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 75 ms returned sat
[2020-05-15 12:31:37] [INFO ] Deduced a trap composed of 31 places in 40 ms
[2020-05-15 12:31:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-05-15 12:31:37] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 20 ms.
[2020-05-15 12:31:39] [INFO ] Added : 163 causal constraints over 33 iterations in 1330 ms. Result :sat
[2020-05-15 12:31:39] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-05-15 12:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2020-05-15 12:31:39] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-05-15 12:31:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 12:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:39] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2020-05-15 12:31:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:31:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-05-15 12:31:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 95 ms returned sat
[2020-05-15 12:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:40] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2020-05-15 12:31:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 35 ms returned sat
[2020-05-15 12:31:40] [INFO ] Deduced a trap composed of 31 places in 56 ms
[2020-05-15 12:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2020-05-15 12:31:40] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 20 ms.
[2020-05-15 12:31:42] [INFO ] Added : 146 causal constraints over 30 iterations in 1564 ms. Result :sat
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 232 transition count 174
Applied a total of 1 rules in 57 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:42] [INFO ] Computed 60 place invariants in 4 ms
[2020-05-15 12:31:42] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-05-15 12:31:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 12:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:42] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2020-05-15 12:31:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:31:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-05-15 12:31:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 110 ms returned sat
[2020-05-15 12:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:43] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2020-05-15 12:31:43] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-05-15 12:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-05-15 12:31:43] [INFO ] Computed and/alt/rep : 173/783/173 causal constraints in 22 ms.
[2020-05-15 12:31:45] [INFO ] Added : 162 causal constraints over 33 iterations in 1563 ms. Result :sat
[2020-05-15 12:31:45] [INFO ] Deduced a trap composed of 19 places in 124 ms
[2020-05-15 12:31:45] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-05-15 12:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-05-15 12:31:45] [INFO ] [Real]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-05-15 12:31:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 38 ms returned sat
[2020-05-15 12:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:46] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2020-05-15 12:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:31:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-05-15 12:31:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 110 ms returned sat
[2020-05-15 12:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:31:46] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-05-15 12:31:46] [INFO ] Deduced a trap composed of 8 places in 50 ms
[2020-05-15 12:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2020-05-15 12:31:47] [INFO ] Computed and/alt/rep : 173/783/173 causal constraints in 22 ms.
[2020-05-15 12:31:48] [INFO ] Added : 145 causal constraints over 30 iterations in 1419 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-15 12:31:48] [INFO ] Flatten gal took : 133 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 12:31:49] [INFO ] Applying decomposition
[2020-05-15 12:31:49] [INFO ] Flatten gal took : 123 ms
[2020-05-15 12:31:49] [INFO ] Input system was already deterministic with 174 transitions.
[2020-05-15 12:31:49] [INFO ] Flatten gal took : 91 ms
[2020-05-15 12:31:49] [INFO ] Input system was already deterministic with 174 transitions.
[2020-05-15 12:31:49] [INFO ] Ran tautology test, simplified 0 / 2 in 270 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:49] [INFO ] Computed 60 place invariants in 16 ms
inv : p0 + p179 + p180 = 1
inv : p0 + 29*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 - 30*p90 - p91 - 2*p92 - 3*p93 - 4*p94 - 5*p95 - 6*p96 - 7*p97 - 8*p98 - 9*p99 - 10*p100 - 11*p101 - 12*p102 - 13*p103 - 14*p104 - 15*p105 - 16*p106 - 17*p107 - 18*p108 - 19*p109 - 20*p110 - 21*p111 - 22*p112 - 23*p113 - 24*p114 - 25*p115 - 26*p116 - 27*p117 - 28*p118 - 29*p119 - p126 + p127 + p133 + p139 + p142 + p148 - p152 + p208 - p210 - p212 + p213 + p217 + p221 = 1
inv : p0 + p189 + p190 = 1
inv : -p220 - p221 + p222 + p223 = 0
inv : p166 - p174 + p182 - p190 - p198 + p206 = 0
inv : p0 + p149 + p150 = 1
inv : p0 + p163 + p174 - p180 + p190 + p196 - p206 = 1
inv : p0 + p229 + p232 + p233 = 1
inv : -58*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 + 30*p30 + p31 + 2*p32 + 3*p33 + 4*p34 + 5*p35 + 6*p36 + 7*p37 + 8*p38 + 9*p39 + 10*p40 + 11*p41 + 12*p42 + 13*p43 + 14*p44 + 15*p45 + 16*p46 + 17*p47 + 18*p48 + 19*p49 + 20*p50 + 21*p51 + 22*p52 + 23*p53 + 24*p54 + 25*p55 + 26*p56 + 27*p57 + 28*p58 + 29*p59 + 30*p90 + p91 + 2*p92 + 3*p93 + 4*p94 + 5*p95 + 6*p96 + 7*p97 + 8*p98 + 9*p99 + 10*p100 + 11*p101 + 12*p102 + 13*p103 + 14*p104 + 15*p105 + 16*p106 + 17*p107 + 18*p108 + 19*p109 + 20*p110 + 21*p111 + 22*p112 + 23*p113 + 24*p114 + 25*p115 + 26*p116 + 27*p117 + 28*p118 + 29*p119 + p126 + p130 - p133 - p139 - p142 - p148 + p152 + p154 + p158 - p208 + p210 + p212 + p214 + p216 + p220 - p224 - p229 - p231 = 0
inv : p0 + p139 + p140 + p143 + p144 = 1
inv : p0 + p120 + p121 = 1
inv : p0 + p191 + p192 + p209 + p210 = 1
inv : p164 - p174 + p180 - p190 - p196 + p206 = 0
inv : p0 + p181 + p182 = 1
inv : p137 + p138 - p139 - p140 = 0
inv : p0 + p147 + p148 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p211 + p212 = 1
inv : p168 - p174 + p184 - p190 - p200 + p206 = 0
inv : p0 + p205 + p206 + p209 + p210 = 1
inv : p0 + p229 + p230 + p231 = 1
inv : p0 + p171 + p174 - p188 + p190 + p204 - p206 = 1
inv : -p0 - 58*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 + 60*p30 + 2*p31 + 4*p32 + 6*p33 + 8*p34 + 10*p35 + 12*p36 + 14*p37 + 16*p38 + 18*p39 + 20*p40 + 22*p41 + 24*p42 + 26*p43 + 28*p44 + 30*p45 + 32*p46 + 34*p47 + 36*p48 + 38*p49 + 40*p50 + 42*p51 + 44*p52 + 46*p53 + 48*p54 + 50*p55 + 52*p56 + 54*p57 + 56*p58 + 58*p59 + p152 + p154 + p158 + p214 + p218 + p220 + p221 - p223 - p224 - p228 - 2*p229 - p231 - p233 = -1
inv : p0 + p187 + p188 = 1
inv : p0 + p195 + p196 + p209 + p210 = 1
inv : p0 + p159 + p174 - p176 + p190 + p192 - p206 = 1
inv : p0 + p122 + p123 = 1
inv : -p0 - 29*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 + 30*p30 + p31 + 2*p32 + 3*p33 + 4*p34 + 5*p35 + 6*p36 + 7*p37 + 8*p38 + 9*p39 + 10*p40 + 11*p41 + 12*p42 + 13*p43 + 14*p44 + 15*p45 + 16*p46 + 17*p47 + 18*p48 + 19*p49 + 20*p50 + 21*p51 + 22*p52 + 23*p53 + 24*p54 + 25*p55 + 26*p56 + 27*p57 + 28*p58 + 29*p59 + p152 + p156 + p174 + p190 - p206 - p209 + p212 + p214 + p216 + p220 - p229 - p231 = -1
inv : p0 + p173 + p174 = 1
inv : p0 + p224 + p225 + p226 + p228 = 1
inv : -29*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 + 30*p90 + p91 + 2*p92 + 3*p93 + 4*p94 + 5*p95 + 6*p96 + 7*p97 + 8*p98 + 9*p99 + 10*p100 + 11*p101 + 12*p102 + 13*p103 + 14*p104 + 15*p105 + 16*p106 + 17*p107 + 18*p108 + 19*p109 + 20*p110 + 21*p111 + 22*p112 + 23*p113 + 24*p114 + 25*p115 + 26*p116 + 27*p117 + 28*p118 + 29*p119 + p126 + p128 - p133 - p139 - p142 - p148 + p152 - p208 + p210 + p212 - p213 - p217 - p221 = 0
inv : p0 + p161 + p174 - p178 + p190 + p194 - p206 = 1
inv : p0 + p213 + p214 + p215 + p216 + p217 + p220 + p221 = 1
inv : p0 + p199 + p200 + p209 + p210 = 1
inv : p160 - p174 + p176 - p190 - p192 + p206 = 0
inv : p0 + p124 + p125 + p126 = 1
inv : 2*p0 + 29*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 - 30*p30 - p31 - 2*p32 - 3*p33 - 4*p34 - 5*p35 - 6*p36 - 7*p37 - 8*p38 - 9*p39 - 10*p40 - 11*p41 - 12*p42 - 13*p43 - 14*p44 - 15*p45 - 16*p46 - 17*p47 - 18*p48 - 19*p49 - 20*p50 - 21*p51 - 22*p52 - 23*p53 - 24*p54 - 25*p55 - 26*p56 - 27*p57 - 28*p58 - 29*p59 - p152 + p155 - p174 - p190 + p206 + p209 - p212 - p214 - p216 - p220 + p229 + p231 = 2
inv : p0 + p145 + p146 = 1
inv : p0 + p134 + p135 + p136 = 1
inv : p0 + p169 + p174 - p186 + p190 + p202 - p206 = 1
inv : p0 + p201 + p202 + p209 + p210 = 1
inv : p207 + p208 - p209 - p210 = 0
inv : p0 + 58*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 - 30*p30 - p31 - 2*p32 - 3*p33 - 4*p34 - 5*p35 - 6*p36 - 7*p37 - 8*p38 - 9*p39 - 10*p40 - 11*p41 - 12*p42 - 13*p43 - 14*p44 - 15*p45 - 16*p46 - 17*p47 - 18*p48 - 19*p49 - 20*p50 - 21*p51 - 22*p52 - 23*p53 - 24*p54 - 25*p55 - 26*p56 - 27*p57 - 28*p58 - 29*p59 - 30*p90 - p91 - 2*p92 - 3*p93 - 4*p94 - 5*p95 - 6*p96 - 7*p97 - 8*p98 - 9*p99 - 10*p100 - 11*p101 - 12*p102 - 13*p103 - 14*p104 - 15*p105 - 16*p106 - 17*p107 - 18*p108 - 19*p109 - 20*p110 - 21*p111 - 22*p112 - 23*p113 - 24*p114 - 25*p115 - 26*p116 - 27*p117 - 28*p118 - 29*p119 - p126 + p129 + p133 + p139 + p142 + p148 - p152 - p154 - p158 + p208 - p210 - p212 - p214 - p216 - p220 + p224 + p229 + p231 = 1
inv : p170 - p174 + p186 - p190 - p202 + p206 = 0
inv : p0 + 58*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 - 60*p30 - 2*p31 - 4*p32 - 6*p33 - 8*p34 - 10*p35 - 12*p36 - 14*p37 - 16*p38 - 18*p39 - 20*p40 - 22*p41 - 24*p42 - 26*p43 - 28*p44 - 30*p45 - 32*p46 - 34*p47 - 36*p48 - 38*p49 - 40*p50 - 42*p51 - 44*p52 - 46*p53 - 48*p54 - 50*p55 - 52*p56 - 54*p57 - 56*p58 - 58*p59 - p152 - p154 - p158 - p214 - p216 - p217 + p219 - p220 - p221 + p223 + p224 + p228 + 2*p229 + p231 + p233 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p185 + p186 = 1
inv : p172 - p174 + p188 - p190 - p204 + p206 = 0
inv : p0 + p203 + p204 + p209 + p210 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p193 + p194 + p209 + p210 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p165 + p174 - p182 + p190 + p198 - p206 = 1
inv : p0 + p139 + p140 + p141 + p142 = 1
inv : p0 + p167 + p174 - p184 + p190 + p200 - p206 = 1
inv : p162 - p174 + p178 - p190 - p194 + p206 = 0
inv : p0 + p183 + p184 = 1
inv : p0 + p197 + p198 + p209 + p210 = 1
inv : p0 + p151 + p152 = 1
Total of 60 invariants.
[2020-05-15 12:31:49] [INFO ] Computed 60 place invariants in 23 ms
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-03(UNSAT) depth K=0 took 14 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/graph8173389666285908999.txt, -o, /tmp/graph8173389666285908999.bin, -w, /tmp/graph8173389666285908999.weights], workingDir=null]
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-04(UNSAT) depth K=0 took 7 ms
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-03(UNSAT) depth K=1 took 6 ms
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-04(UNSAT) depth K=1 took 3 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/graph8173389666285908999.bin, -l, -1, -v, -w, /tmp/graph8173389666285908999.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 12:31:49] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 174 rows 232 cols
[2020-05-15 12:31:49] [INFO ] Computed 60 place invariants in 5 ms
inv : p0 + p179 + p180 = 1
inv : p0 + 29*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 - 30*p90 - p91 - 2*p92 - 3*p93 - 4*p94 - 5*p95 - 6*p96 - 7*p97 - 8*p98 - 9*p99 - 10*p100 - 11*p101 - 12*p102 - 13*p103 - 14*p104 - 15*p105 - 16*p106 - 17*p107 - 18*p108 - 19*p109 - 20*p110 - 21*p111 - 22*p112 - 23*p113 - 24*p114 - 25*p115 - 26*p116 - 27*p117 - 28*p118 - 29*p119 - p126 + p127 + p133 + p139 + p142 + p148 - p152 + p208 - p210 - p212 + p213 + p217 + p221 = 1
inv : p0 + p189 + p190 = 1
inv : -p220 - p221 + p222 + p223 = 0
inv : p166 - p174 + p182 - p190 - p198 + p206 = 0
inv : p0 + p149 + p150 = 1
inv : p0 + p163 + p174 - p180 + p190 + p196 - p206 = 1
inv : p0 + p229 + p232 + p233 = 1
inv : -58*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 + 30*p30 + p31 + 2*p32 + 3*p33 + 4*p34 + 5*p35 + 6*p36 + 7*p37 + 8*p38 + 9*p39 + 10*p40 + 11*p41 + 12*p42 + 13*p43 + 14*p44 + 15*p45 + 16*p46 + 17*p47 + 18*p48 + 19*p49 + 20*p50 + 21*p51 + 22*p52 + 23*p53 + 24*p54 + 25*p55 + 26*p56 + 27*p57 + 28*p58 + 29*p59 + 30*p90 + p91 + 2*p92 + 3*p93 + 4*p94 + 5*p95 + 6*p96 + 7*p97 + 8*p98 + 9*p99 + 10*p100 + 11*p101 + 12*p102 + 13*p103 + 14*p104 + 15*p105 + 16*p106 + 17*p107 + 18*p108 + 19*p109 + 20*p110 + 21*p111 + 22*p112 + 23*p113 + 24*p114 + 25*p115 + 26*p116 + 27*p117 + 28*p118 + 29*p119 + p126 + p130 - p133 - p139 - p142 - p148 + p152 + p154 + p158 - p208 + p210 + p212 + p214 + p216 + p220 - p224 - p229 - p231 = 0
inv : p0 + p139 + p140 + p143 + p144 = 1
inv : p0 + p120 + p121 = 1
inv : p0 + p191 + p192 + p209 + p210 = 1
inv : p164 - p174 + p180 - p190 - p196 + p206 = 0
inv : p0 + p181 + p182 = 1
inv : p137 + p138 - p139 - p140 = 0
inv : p0 + p147 + p148 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p211 + p212 = 1
inv : p168 - p174 + p184 - p190 - p200 + p206 = 0
inv : p0 + p205 + p206 + p209 + p210 = 1
inv : p0 + p229 + p230 + p231 = 1
inv : p0 + p171 + p174 - p188 + p190 + p204 - p206 = 1
inv : -p0 - 58*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 + 60*p30 + 2*p31 + 4*p32 + 6*p33 + 8*p34 + 10*p35 + 12*p36 + 14*p37 + 16*p38 + 18*p39 + 20*p40 + 22*p41 + 24*p42 + 26*p43 + 28*p44 + 30*p45 + 32*p46 + 34*p47 + 36*p48 + 38*p49 + 40*p50 + 42*p51 + 44*p52 + 46*p53 + 48*p54 + 50*p55 + 52*p56 + 54*p57 + 56*p58 + 58*p59 + p152 + p154 + p158 + p214 + p218 + p220 + p221 - p223 - p224 - p228 - 2*p229 - p231 - p233 = -1
inv : p0 + p187 + p188 = 1
inv : p0 + p195 + p196 + p209 + p210 = 1
inv : p0 + p159 + p174 - p176 + p190 + p192 - p206 = 1
inv : p0 + p122 + p123 = 1
inv : -p0 - 29*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 + 30*p30 + p31 + 2*p32 + 3*p33 + 4*p34 + 5*p35 + 6*p36 + 7*p37 + 8*p38 + 9*p39 + 10*p40 + 11*p41 + 12*p42 + 13*p43 + 14*p44 + 15*p45 + 16*p46 + 17*p47 + 18*p48 + 19*p49 + 20*p50 + 21*p51 + 22*p52 + 23*p53 + 24*p54 + 25*p55 + 26*p56 + 27*p57 + 28*p58 + 29*p59 + p152 + p156 + p174 + p190 - p206 - p209 + p212 + p214 + p216 + p220 - p229 - p231 = -1
inv : p0 + p173 + p174 = 1
inv : p0 + p224 + p225 + p226 + p228 = 1
inv : -29*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 + 30*p90 + p91 + 2*p92 + 3*p93 + 4*p94 + 5*p95 + 6*p96 + 7*p97 + 8*p98 + 9*p99 + 10*p100 + 11*p101 + 12*p102 + 13*p103 + 14*p104 + 15*p105 + 16*p106 + 17*p107 + 18*p108 + 19*p109 + 20*p110 + 21*p111 + 22*p112 + 23*p113 + 24*p114 + 25*p115 + 26*p116 + 27*p117 + 28*p118 + 29*p119 + p126 + p128 - p133 - p139 - p142 - p148 + p152 - p208 + p210 + p212 - p213 - p217 - p221 = 0
inv : p0 + p161 + p174 - p178 + p190 + p194 - p206 = 1
inv : p0 + p213 + p214 + p215 + p216 + p217 + p220 + p221 = 1
inv : p0 + p199 + p200 + p209 + p210 = 1
inv : p160 - p174 + p176 - p190 - p192 + p206 = 0
inv : p0 + p124 + p125 + p126 = 1
inv : 2*p0 + 29*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 - 30*p30 - p31 - 2*p32 - 3*p33 - 4*p34 - 5*p35 - 6*p36 - 7*p37 - 8*p38 - 9*p39 - 10*p40 - 11*p41 - 12*p42 - 13*p43 - 14*p44 - 15*p45 - 16*p46 - 17*p47 - 18*p48 - 19*p49 - 20*p50 - 21*p51 - 22*p52 - 23*p53 - 24*p54 - 25*p55 - 26*p56 - 27*p57 - 28*p58 - 29*p59 - p152 + p155 - p174 - p190 + p206 + p209 - p212 - p214 - p216 - p220 + p229 + p231 = 2
inv : p0 + p145 + p146 = 1
inv : p0 + p134 + p135 + p136 = 1
inv : p0 + p169 + p174 - p186 + p190 + p202 - p206 = 1
inv : p0 + p201 + p202 + p209 + p210 = 1
inv : p207 + p208 - p209 - p210 = 0
inv : p0 + 58*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 - 30*p30 - p31 - 2*p32 - 3*p33 - 4*p34 - 5*p35 - 6*p36 - 7*p37 - 8*p38 - 9*p39 - 10*p40 - 11*p41 - 12*p42 - 13*p43 - 14*p44 - 15*p45 - 16*p46 - 17*p47 - 18*p48 - 19*p49 - 20*p50 - 21*p51 - 22*p52 - 23*p53 - 24*p54 - 25*p55 - 26*p56 - 27*p57 - 28*p58 - 29*p59 - 30*p90 - p91 - 2*p92 - 3*p93 - 4*p94 - 5*p95 - 6*p96 - 7*p97 - 8*p98 - 9*p99 - 10*p100 - 11*p101 - 12*p102 - 13*p103 - 14*p104 - 15*p105 - 16*p106 - 17*p107 - 18*p108 - 19*p109 - 20*p110 - 21*p111 - 22*p112 - 23*p113 - 24*p114 - 25*p115 - 26*p116 - 27*p117 - 28*p118 - 29*p119 - p126 + p129 + p133 + p139 + p142 + p148 - p152 - p154 - p158 + p208 - p210 - p212 - p214 - p216 - p220 + p224 + p229 + p231 = 1
inv : p170 - p174 + p186 - p190 - p202 + p206 = 0
inv : p0 + 58*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 - 60*p30 - 2*p31 - 4*p32 - 6*p33 - 8*p34 - 10*p35 - 12*p36 - 14*p37 - 16*p38 - 18*p39 - 20*p40 - 22*p41 - 24*p42 - 26*p43 - 28*p44 - 30*p45 - 32*p46 - 34*p47 - 36*p48 - 38*p49 - 40*p50 - 42*p51 - 44*p52 - 46*p53 - 48*p54 - 50*p55 - 52*p56 - 54*p57 - 56*p58 - 58*p59 - p152 - p154 - p158 - p214 - p216 - p217 + p219 - p220 - p221 + p223 + p224 + p228 + 2*p229 + p231 + p233 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p185 + p186 = 1
inv : p172 - p174 + p188 - p190 - p204 + p206 = 0
inv : p0 + p203 + p204 + p209 + p210 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p193 + p194 + p209 + p210 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p165 + p174 - p182 + p190 + p198 - p206 = 1
inv : p0 + p139 + p140 + p141 + p142 = 1
inv : p0 + p167 + p174 - p184 + p190 + p200 - p206 = 1
inv : p162 - p174 + p178 - p190 - p194 + p206 = 0
inv : p0 + p183 + p184 = 1
inv : p0 + p197 + p198 + p209 + p210 = 1
inv : p0 + p151 + p152 = 1
Total of 60 invariants.
[2020-05-15 12:31:49] [INFO ] Computed 60 place invariants in 7 ms
[2020-05-15 12:31:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-03(UNSAT) depth K=2 took 169 ms
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-04(UNSAT) depth K=2 took 5 ms
[2020-05-15 12:31:49] [INFO ] Removed a total of 23 redundant transitions.
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-03(UNSAT) depth K=3 took 109 ms
[2020-05-15 12:31:49] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-04(UNSAT) depth K=3 took 44 ms
[2020-05-15 12:31:49] [INFO ] Flatten gal took : 125 ms
[2020-05-15 12:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 17 ms.
[2020-05-15 12:31:49] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 16 ms
[2020-05-15 12:31:49] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/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-30a-ReachabilityCardinality-03 with value :((((i0.u2.p97!=0)&&(i11.u15.p156!=1))&&(i0.u12.p148!=0))&&(u13.p72!=1))
Read [reachable] property : DES-PT-30a-ReachabilityCardinality-04 with value :((((i0.u2.p102!=0)&&(i5.u18.p161!=1))&&(i7.u39.p204!=0))&&(u47.p45!=1))
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 26 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
built 18 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-15 12:31:50] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-03(UNSAT) depth K=4 took 439 ms
SDD proceeding with computation, new max is 4096
[2020-05-15 12:31:51] [INFO ] Proved 232 variables to be positive in 1628 ms
[2020-05-15 12:31:51] [INFO ] Computing symmetric may disable matrix : 174 transitions.
[2020-05-15 12:31:51] [INFO ] Computation of disable matrix completed :0/174 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:31:51] [INFO ] Proved 232 variables to be positive in 1471 ms
[2020-05-15 12:31:51] [INFO ] Computation of Complete disable matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:31:51] [INFO ] Computing symmetric may enable matrix : 174 transitions.
[2020-05-15 12:31:51] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:31:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30a-ReachabilityCardinality-03
[2020-05-15 12:31:51] [INFO ] KInduction solution for property DES-PT-30a-ReachabilityCardinality-03(SAT) depth K=0 took 287 ms
[2020-05-15 12:31:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30a-ReachabilityCardinality-04
[2020-05-15 12:31:51] [INFO ] KInduction solution for property DES-PT-30a-ReachabilityCardinality-04(SAT) depth K=0 took 31 ms
[2020-05-15 12:31:51] [INFO ] Computing symmetric co enabling matrix : 174 transitions.
SDD proceeding with computation, new max is 8192
[2020-05-15 12:31:52] [INFO ] BMC solution for property DES-PT-30a-ReachabilityCardinality-04(UNSAT) depth K=4 took 2183 ms
[2020-05-15 12:31:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30a-ReachabilityCardinality-03
[2020-05-15 12:31:53] [INFO ] KInduction solution for property DES-PT-30a-ReachabilityCardinality-03(SAT) depth K=1 took 1547 ms
[2020-05-15 12:31:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30a-ReachabilityCardinality-04
[2020-05-15 12:31:53] [INFO ] KInduction solution for property DES-PT-30a-ReachabilityCardinality-04(SAT) depth K=1 took 101 ms
SDD proceeding with computation, new max is 16384
[2020-05-15 12:31:54] [INFO ] Computation of co-enabling matrix(8/174) took 2972 ms. Total solver calls (SAT/UNSAT): 746(475/271)
Reachability property DES-PT-30a-ReachabilityCardinality-04 is true.
FORMULA DES-PT-30a-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-30a-ReachabilityCardinality-03 is true.
FORMULA DES-PT-30a-ReachabilityCardinality-03 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 16385 fixpoint passes
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,8.35447e+12,7.49765,137304,10306,3201,325526,12548,304,321672,304,58574,0
Total reachable state count : 8354471599141

Verifying 2 reachability properties.
Reachability property DES-PT-30a-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-30a-ReachabilityCardinality-03,1200,7.57475,137304,101,163,325526,12548,324,321672,313,58574,2410
Reachability property DES-PT-30a-ReachabilityCardinality-04 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-30a-ReachabilityCardinality-04,2.02954e+06,7.59426,137304,110,149,325526,12548,340,321672,319,58574,2760
[2020-05-15 12:31:57] [WARNING] Interrupting SMT solver.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
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)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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 12:31:57] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-30a-ReachabilityCardinality-03 K-induction depth 2
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 12:31:57] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-30a-ReachabilityCardinality-03 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-15 12:31:57] [INFO ] During BMC, SMT solver timed out at depth 5
[2020-05-15 12:31:57] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2020-05-15 12:31:57] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
[2020-05-15 12:31:57] [INFO ] Built C files in 8802ms 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 1589545918185

--------------------
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-30a"
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-30a, 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-158902545900278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a 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 ;