About the Execution of ITS-Tools for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.710 | 2543168.00 | 2995648.00 | 3447.30 | TTTFFTTFTFTTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476200743.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 ShieldPPPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476200743
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 4.0K May 14 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 19:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 19:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1590618321758
[2020-05-27 22:25:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 22:25:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 22:25:23] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2020-05-27 22:25:23] [INFO ] Transformed 7803 places.
[2020-05-27 22:25:23] [INFO ] Transformed 7103 transitions.
[2020-05-27 22:25:23] [INFO ] Found NUPN structural information;
[2020-05-27 22:25:23] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 594 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 187 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 192 ms. (steps per millisecond=52 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0]
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7103 rows 7803 cols
[2020-05-27 22:25:24] [INFO ] Computed 1101 place invariants in 145 ms
[2020-05-27 22:25:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 3859 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 22:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-05-27 22:25:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:25:34] [INFO ] [Real]Absence check using 1101 positive place invariants in 4012 ms returned (error "Failed to check-sat")
[2020-05-27 22:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-05-27 22:25:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:25:39] [INFO ] [Real]Absence check using 1101 positive place invariants in 4118 ms returned (error "Failed to check-sat")
[2020-05-27 22:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-05-27 22:25:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:25:44] [INFO ] [Real]Absence check using 1101 positive place invariants in 3963 ms returned (error "Failed to check-sat")
[2020-05-27 22:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-05-27 22:25:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:25:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 3958 ms returned (error "Failed to check-sat")
[2020-05-27 22:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-05-27 22:25:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:25:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 4155 ms returned (error "Failed to check-sat")
[2020-05-27 22:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
[2020-05-27 22:25:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:25:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 4072 ms returned (error "Failed to check-sat")
[2020-05-27 22:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:26:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2020-05-27 22:26:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:26:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 4107 ms returned (error "Failed to check-sat")
[2020-05-27 22:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:26:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
[2020-05-27 22:26:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 4103 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 22:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:26:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 8
[2020-05-27 22:26:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:26:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 4257 ms returned (error "Failed to check-sat")
[2020-05-27 22:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:26:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 9
[2020-05-27 22:26:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:26:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 4148 ms returned (error "Failed to check-sat")
[2020-05-27 22:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:26:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 10
Support contains 66 out of 7803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Performed 1870 Post agglomeration using F-continuation condition.Transition count delta: 1870
Iterating post reduction 0 with 1870 rules applied. Total rules applied 1870 place count 7803 transition count 5233
Reduce places removed 1870 places and 0 transitions.
Iterating post reduction 1 with 1870 rules applied. Total rules applied 3740 place count 5933 transition count 5233
Performed 404 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 404 Pre rules applied. Total rules applied 3740 place count 5933 transition count 4829
Deduced a syphon composed of 404 places in 22 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 2 with 808 rules applied. Total rules applied 4548 place count 5529 transition count 4829
Symmetric choice reduction at 2 with 695 rule applications. Total rules 5243 place count 5529 transition count 4829
Deduced a syphon composed of 695 places in 61 ms
Reduce places removed 695 places and 695 transitions.
Iterating global reduction 2 with 1390 rules applied. Total rules applied 6633 place count 4834 transition count 4134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 6635 place count 4834 transition count 4132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6636 place count 4833 transition count 4132
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 287 Pre rules applied. Total rules applied 6636 place count 4833 transition count 3845
Deduced a syphon composed of 287 places in 34 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 4 with 574 rules applied. Total rules applied 7210 place count 4546 transition count 3845
Performed 1670 Post agglomeration using F-continuation condition.Transition count delta: 1670
Deduced a syphon composed of 1670 places in 9 ms
Reduce places removed 1670 places and 0 transitions.
Iterating global reduction 4 with 3340 rules applied. Total rules applied 10550 place count 2876 transition count 2175
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 15 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10752 place count 2775 transition count 2175
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10954 place count 2674 transition count 2175
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 84 places in 9 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 11122 place count 2590 transition count 2175
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 11123 place count 2590 transition count 2174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 11124 place count 2589 transition count 2174
Partial Free-agglomeration rule applied 293 times.
Drop transitions removed 293 transitions
Iterating global reduction 5 with 293 rules applied. Total rules applied 11417 place count 2589 transition count 2174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 11418 place count 2588 transition count 2173
Applied a total of 11418 rules in 3817 ms. Remains 2588 /7803 variables (removed 5215) and now considering 2173/7103 (removed 4930) transitions.
Finished structural reductions, in 1 iterations. Remains : 2588/7803 places, 2173/7103 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13696 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 548492 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 510814 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 538240 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 528264 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 518006 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 499976 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 484614 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 502412 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 445319 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 517722 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2173 rows 2588 cols
[2020-05-27 22:27:27] [INFO ] Computed 1101 place invariants in 8 ms
[2020-05-27 22:27:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 1183 ms returned sat
[2020-05-27 22:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:27:40] [INFO ] [Real]Absence check using state equation in 10888 ms returned sat
[2020-05-27 22:27:40] [INFO ] State equation strengthened by 271 read => feed constraints.
[2020-05-27 22:27:40] [INFO ] [Real]Added 271 Read/Feed constraints in 61 ms returned sat
[2020-05-27 22:27:41] [INFO ] Deduced a trap composed of 3 places in 1116 ms
[2020-05-27 22:27:42] [INFO ] Deduced a trap composed of 6 places in 933 ms
[2020-05-27 22:27:43] [INFO ] Deduced a trap composed of 5 places in 958 ms
[2020-05-27 22:27:44] [INFO ] Deduced a trap composed of 3 places in 846 ms
[2020-05-27 22:27:45] [INFO ] Deduced a trap composed of 6 places in 989 ms
[2020-05-27 22:27:46] [INFO ] Deduced a trap composed of 6 places in 805 ms
[2020-05-27 22:27:47] [INFO ] Deduced a trap composed of 7 places in 866 ms
[2020-05-27 22:27:48] [INFO ] Deduced a trap composed of 5 places in 909 ms
[2020-05-27 22:27:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8177 ms
[2020-05-27 22:27:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:27:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1073 ms returned sat
[2020-05-27 22:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:28:02] [INFO ] [Nat]Absence check using state equation in 12389 ms returned sat
[2020-05-27 22:28:02] [INFO ] [Nat]Added 271 Read/Feed constraints in 132 ms returned sat
[2020-05-27 22:28:02] [INFO ] Deduced a trap composed of 6 places in 294 ms
[2020-05-27 22:28:03] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-05-27 22:28:03] [INFO ] Deduced a trap composed of 8 places in 248 ms
[2020-05-27 22:28:03] [INFO ] Deduced a trap composed of 5 places in 331 ms
[2020-05-27 22:28:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1695 ms
[2020-05-27 22:28:04] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 173 ms.
[2020-05-27 22:28:24] [INFO ] Added : 535 causal constraints over 107 iterations in 20135 ms.(timeout) Result :sat
[2020-05-27 22:28:24] [INFO ] Deduced a trap composed of 5 places in 359 ms
[2020-05-27 22:28:25] [INFO ] Deduced a trap composed of 6 places in 323 ms
[2020-05-27 22:28:25] [INFO ] Deduced a trap composed of 6 places in 325 ms
[2020-05-27 22:28:26] [INFO ] Deduced a trap composed of 5 places in 307 ms
[2020-05-27 22:28:26] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-05-27 22:28:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2474 ms
Attempting to minimize the solution found.
Minimization took 87 ms.
[2020-05-27 22:28:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 1255 ms returned sat
[2020-05-27 22:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:28:40] [INFO ] [Real]Absence check using state equation in 11679 ms returned sat
[2020-05-27 22:28:40] [INFO ] [Real]Added 271 Read/Feed constraints in 90 ms returned sat
[2020-05-27 22:28:41] [INFO ] Deduced a trap composed of 4 places in 997 ms
[2020-05-27 22:28:42] [INFO ] Deduced a trap composed of 4 places in 786 ms
[2020-05-27 22:28:43] [INFO ] Deduced a trap composed of 5 places in 969 ms
[2020-05-27 22:28:44] [INFO ] Deduced a trap composed of 6 places in 754 ms
[2020-05-27 22:28:45] [INFO ] Deduced a trap composed of 6 places in 864 ms
[2020-05-27 22:28:46] [INFO ] Deduced a trap composed of 6 places in 905 ms
[2020-05-27 22:28:47] [INFO ] Deduced a trap composed of 6 places in 909 ms
[2020-05-27 22:28:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6852 ms
[2020-05-27 22:28:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:28:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1094 ms returned sat
[2020-05-27 22:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:29:01] [INFO ] [Nat]Absence check using state equation in 13143 ms returned sat
[2020-05-27 22:29:02] [INFO ] [Nat]Added 271 Read/Feed constraints in 130 ms returned sat
[2020-05-27 22:29:02] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-05-27 22:29:02] [INFO ] Deduced a trap composed of 3 places in 274 ms
[2020-05-27 22:29:03] [INFO ] Deduced a trap composed of 5 places in 286 ms
[2020-05-27 22:29:03] [INFO ] Deduced a trap composed of 5 places in 273 ms
[2020-05-27 22:29:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1592 ms
[2020-05-27 22:29:03] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 156 ms.
[2020-05-27 22:29:23] [INFO ] Added : 555 causal constraints over 111 iterations in 20066 ms.(timeout) Result :sat
[2020-05-27 22:29:24] [INFO ] Deduced a trap composed of 5 places in 282 ms
[2020-05-27 22:29:24] [INFO ] Deduced a trap composed of 7 places in 279 ms
[2020-05-27 22:29:24] [INFO ] Deduced a trap composed of 7 places in 226 ms
[2020-05-27 22:29:25] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-05-27 22:29:25] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-05-27 22:29:26] [INFO ] Deduced a trap composed of 6 places in 294 ms
[2020-05-27 22:29:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2531 ms
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-05-27 22:29:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 1396 ms returned sat
[2020-05-27 22:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:29:41] [INFO ] [Real]Absence check using state equation in 12995 ms returned sat
[2020-05-27 22:29:41] [INFO ] [Real]Added 271 Read/Feed constraints in 58 ms returned sat
[2020-05-27 22:29:41] [INFO ] Deduced a trap composed of 5 places in 488 ms
[2020-05-27 22:29:42] [INFO ] Deduced a trap composed of 6 places in 489 ms
[2020-05-27 22:29:43] [INFO ] Deduced a trap composed of 8 places in 507 ms
[2020-05-27 22:29:43] [INFO ] Deduced a trap composed of 5 places in 512 ms
[2020-05-27 22:29:44] [INFO ] Deduced a trap composed of 10 places in 520 ms
[2020-05-27 22:29:44] [INFO ] Deduced a trap composed of 8 places in 448 ms
[2020-05-27 22:29:45] [INFO ] Deduced a trap composed of 10 places in 383 ms
[2020-05-27 22:29:45] [INFO ] Deduced a trap composed of 11 places in 400 ms
[2020-05-27 22:29:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4680 ms
[2020-05-27 22:29:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:29:47] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1269 ms returned sat
[2020-05-27 22:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:30:00] [INFO ] [Nat]Absence check using state equation in 13116 ms returned sat
[2020-05-27 22:30:00] [INFO ] [Nat]Added 271 Read/Feed constraints in 119 ms returned sat
[2020-05-27 22:30:01] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2020-05-27 22:30:01] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-05-27 22:30:01] [INFO ] Deduced a trap composed of 8 places in 277 ms
[2020-05-27 22:30:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1128 ms
[2020-05-27 22:30:02] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 151 ms.
[2020-05-27 22:30:22] [INFO ] Added : 595 causal constraints over 119 iterations in 20106 ms.(timeout) Result :sat
[2020-05-27 22:30:22] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-05-27 22:30:22] [INFO ] Deduced a trap composed of 6 places in 197 ms
[2020-05-27 22:30:23] [INFO ] Deduced a trap composed of 5 places in 195 ms
[2020-05-27 22:30:23] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-05-27 22:30:23] [INFO ] Deduced a trap composed of 7 places in 168 ms
[2020-05-27 22:30:24] [INFO ] Deduced a trap composed of 7 places in 169 ms
[2020-05-27 22:30:24] [INFO ] Deduced a trap composed of 5 places in 152 ms
[2020-05-27 22:30:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2408 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-05-27 22:30:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 1262 ms returned sat
[2020-05-27 22:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:30:39] [INFO ] [Real]Absence check using state equation in 13398 ms returned sat
[2020-05-27 22:30:39] [INFO ] [Real]Added 271 Read/Feed constraints in 53 ms returned sat
[2020-05-27 22:30:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:30:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1309 ms returned sat
[2020-05-27 22:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:30:55] [INFO ] [Nat]Absence check using state equation in 13857 ms returned sat
[2020-05-27 22:30:55] [INFO ] [Nat]Added 271 Read/Feed constraints in 93 ms returned sat
[2020-05-27 22:30:55] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 22:30:55] [INFO ] Deduced a trap composed of 6 places in 199 ms
[2020-05-27 22:30:56] [INFO ] Deduced a trap composed of 4 places in 220 ms
[2020-05-27 22:30:56] [INFO ] Deduced a trap composed of 7 places in 225 ms
[2020-05-27 22:30:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1253 ms
[2020-05-27 22:30:56] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 93 ms.
[2020-05-27 22:31:16] [INFO ] Added : 645 causal constraints over 129 iterations in 20219 ms.(timeout) Result :sat
[2020-05-27 22:31:17] [INFO ] Deduced a trap composed of 6 places in 433 ms
[2020-05-27 22:31:18] [INFO ] Deduced a trap composed of 6 places in 401 ms
[2020-05-27 22:31:18] [INFO ] Deduced a trap composed of 6 places in 408 ms
[2020-05-27 22:31:19] [INFO ] Deduced a trap composed of 5 places in 357 ms
[2020-05-27 22:31:19] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-05-27 22:31:20] [INFO ] Deduced a trap composed of 5 places in 322 ms
[2020-05-27 22:31:20] [INFO ] Deduced a trap composed of 7 places in 395 ms
[2020-05-27 22:31:21] [INFO ] Deduced a trap composed of 6 places in 381 ms
[2020-05-27 22:31:21] [INFO ] Deduced a trap composed of 6 places in 377 ms
[2020-05-27 22:31:22] [INFO ] Deduced a trap composed of 7 places in 323 ms
[2020-05-27 22:31:22] [INFO ] Deduced a trap composed of 5 places in 309 ms
[2020-05-27 22:31:22] [INFO ] Deduced a trap composed of 6 places in 307 ms
[2020-05-27 22:31:23] [INFO ] Deduced a trap composed of 9 places in 287 ms
[2020-05-27 22:31:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6673 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
[2020-05-27 22:31:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 1166 ms returned sat
[2020-05-27 22:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:31:38] [INFO ] [Real]Absence check using state equation in 13648 ms returned sat
[2020-05-27 22:31:38] [INFO ] [Real]Added 271 Read/Feed constraints in 47 ms returned sat
[2020-05-27 22:31:39] [INFO ] Deduced a trap composed of 7 places in 899 ms
[2020-05-27 22:31:40] [INFO ] Deduced a trap composed of 7 places in 913 ms
[2020-05-27 22:31:41] [INFO ] Deduced a trap composed of 4 places in 962 ms
[2020-05-27 22:31:43] [INFO ] Deduced a trap composed of 7 places in 1079 ms
[2020-05-27 22:31:44] [INFO ] Deduced a trap composed of 6 places in 899 ms
[2020-05-27 22:31:44] [INFO ] Deduced a trap composed of 8 places in 848 ms
[2020-05-27 22:31:45] [INFO ] Deduced a trap composed of 3 places in 866 ms
[2020-05-27 22:31:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7106 ms
[2020-05-27 22:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:31:47] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1171 ms returned sat
[2020-05-27 22:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:32:01] [INFO ] [Nat]Absence check using state equation in 13630 ms returned sat
[2020-05-27 22:32:01] [INFO ] [Nat]Added 271 Read/Feed constraints in 103 ms returned sat
[2020-05-27 22:32:01] [INFO ] Deduced a trap composed of 8 places in 269 ms
[2020-05-27 22:32:01] [INFO ] Deduced a trap composed of 7 places in 281 ms
[2020-05-27 22:32:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 804 ms
[2020-05-27 22:32:02] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 118 ms.
[2020-05-27 22:32:12] [INFO ] Added : 280 causal constraints over 56 iterations in 10136 ms. Result :unsat
[2020-05-27 22:32:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 1335 ms returned sat
[2020-05-27 22:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:32:26] [INFO ] [Real]Absence check using state equation in 12263 ms returned sat
[2020-05-27 22:32:26] [INFO ] [Real]Added 271 Read/Feed constraints in 52 ms returned sat
[2020-05-27 22:32:27] [INFO ] Deduced a trap composed of 4 places in 930 ms
[2020-05-27 22:32:28] [INFO ] Deduced a trap composed of 6 places in 903 ms
[2020-05-27 22:32:29] [INFO ] Deduced a trap composed of 7 places in 919 ms
[2020-05-27 22:32:30] [INFO ] Deduced a trap composed of 5 places in 840 ms
[2020-05-27 22:32:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3956 ms
[2020-05-27 22:32:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:32:31] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1158 ms returned sat
[2020-05-27 22:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:32:44] [INFO ] [Nat]Absence check using state equation in 12382 ms returned sat
[2020-05-27 22:32:44] [INFO ] [Nat]Added 271 Read/Feed constraints in 159 ms returned sat
[2020-05-27 22:32:44] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 98 ms.
[2020-05-27 22:33:04] [INFO ] Added : 600 causal constraints over 120 iterations in 20077 ms.(timeout) Result :sat
[2020-05-27 22:33:04] [INFO ] Deduced a trap composed of 5 places in 279 ms
[2020-05-27 22:33:05] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-05-27 22:33:05] [INFO ] Deduced a trap composed of 5 places in 278 ms
[2020-05-27 22:33:05] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-05-27 22:33:06] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-05-27 22:33:06] [INFO ] Deduced a trap composed of 6 places in 242 ms
[2020-05-27 22:33:07] [INFO ] Deduced a trap composed of 5 places in 260 ms
[2020-05-27 22:33:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2859 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-05-27 22:33:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 1312 ms returned sat
[2020-05-27 22:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:33:21] [INFO ] [Real]Absence check using state equation in 12158 ms returned sat
[2020-05-27 22:33:21] [INFO ] [Real]Added 271 Read/Feed constraints in 54 ms returned sat
[2020-05-27 22:33:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:33:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1358 ms returned sat
[2020-05-27 22:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:33:35] [INFO ] [Nat]Absence check using state equation in 12717 ms returned sat
[2020-05-27 22:33:35] [INFO ] [Nat]Added 271 Read/Feed constraints in 112 ms returned sat
[2020-05-27 22:33:36] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 129 ms.
[2020-05-27 22:33:56] [INFO ] Added : 540 causal constraints over 108 iterations in 20109 ms.(timeout) Result :sat
[2020-05-27 22:33:56] [INFO ] Deduced a trap composed of 5 places in 264 ms
[2020-05-27 22:33:56] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-05-27 22:33:57] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-05-27 22:33:57] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2020-05-27 22:33:58] [INFO ] Deduced a trap composed of 5 places in 248 ms
[2020-05-27 22:33:58] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-05-27 22:33:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2489 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-05-27 22:34:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 1219 ms returned sat
[2020-05-27 22:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:12] [INFO ] [Real]Absence check using state equation in 11871 ms returned sat
[2020-05-27 22:34:12] [INFO ] [Real]Added 271 Read/Feed constraints in 61 ms returned sat
[2020-05-27 22:34:13] [INFO ] Deduced a trap composed of 6 places in 1021 ms
[2020-05-27 22:34:14] [INFO ] Deduced a trap composed of 6 places in 1015 ms
[2020-05-27 22:34:15] [INFO ] Deduced a trap composed of 4 places in 869 ms
[2020-05-27 22:34:16] [INFO ] Deduced a trap composed of 10 places in 844 ms
[2020-05-27 22:34:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4194 ms
[2020-05-27 22:34:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1205 ms returned sat
[2020-05-27 22:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:31] [INFO ] [Nat]Absence check using state equation in 13042 ms returned sat
[2020-05-27 22:34:31] [INFO ] [Nat]Added 271 Read/Feed constraints in 136 ms returned sat
[2020-05-27 22:34:31] [INFO ] Deduced a trap composed of 5 places in 277 ms
[2020-05-27 22:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2020-05-27 22:34:31] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 117 ms.
[2020-05-27 22:34:51] [INFO ] Added : 550 causal constraints over 110 iterations in 20125 ms.(timeout) Result :sat
[2020-05-27 22:34:52] [INFO ] Deduced a trap composed of 9 places in 236 ms
[2020-05-27 22:34:52] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-05-27 22:34:52] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-05-27 22:34:53] [INFO ] Deduced a trap composed of 5 places in 258 ms
[2020-05-27 22:34:53] [INFO ] Deduced a trap composed of 5 places in 256 ms
[2020-05-27 22:34:54] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 22:34:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2537 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
[2020-05-27 22:34:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 1208 ms returned sat
[2020-05-27 22:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:35:08] [INFO ] [Real]Absence check using state equation in 12630 ms returned sat
[2020-05-27 22:35:08] [INFO ] [Real]Added 271 Read/Feed constraints in 73 ms returned sat
[2020-05-27 22:35:09] [INFO ] Deduced a trap composed of 6 places in 1023 ms
[2020-05-27 22:35:10] [INFO ] Deduced a trap composed of 5 places in 866 ms
[2020-05-27 22:35:11] [INFO ] Deduced a trap composed of 6 places in 940 ms
[2020-05-27 22:35:12] [INFO ] Deduced a trap composed of 5 places in 908 ms
[2020-05-27 22:35:13] [INFO ] Deduced a trap composed of 4 places in 811 ms
[2020-05-27 22:35:14] [INFO ] Deduced a trap composed of 6 places in 873 ms
[2020-05-27 22:35:15] [INFO ] Deduced a trap composed of 7 places in 801 ms
[2020-05-27 22:35:16] [INFO ] Deduced a trap composed of 6 places in 874 ms
[2020-05-27 22:35:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7758 ms
[2020-05-27 22:35:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:35:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1232 ms returned sat
[2020-05-27 22:35:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:35:31] [INFO ] [Nat]Absence check using state equation in 13563 ms returned sat
[2020-05-27 22:35:31] [INFO ] [Nat]Added 271 Read/Feed constraints in 101 ms returned sat
[2020-05-27 22:35:32] [INFO ] Deduced a trap composed of 7 places in 258 ms
[2020-05-27 22:35:32] [INFO ] Deduced a trap composed of 7 places in 251 ms
[2020-05-27 22:35:32] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-05-27 22:35:33] [INFO ] Deduced a trap composed of 7 places in 208 ms
[2020-05-27 22:35:33] [INFO ] Deduced a trap composed of 5 places in 256 ms
[2020-05-27 22:35:33] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-05-27 22:35:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2112 ms
[2020-05-27 22:35:34] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 169 ms.
[2020-05-27 22:35:54] [INFO ] Added : 545 causal constraints over 109 iterations in 20142 ms.(timeout) Result :sat
[2020-05-27 22:35:54] [INFO ] Deduced a trap composed of 5 places in 374 ms
[2020-05-27 22:35:55] [INFO ] Deduced a trap composed of 5 places in 367 ms
[2020-05-27 22:35:55] [INFO ] Deduced a trap composed of 5 places in 351 ms
[2020-05-27 22:35:56] [INFO ] Deduced a trap composed of 5 places in 325 ms
[2020-05-27 22:35:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2082 ms
Attempting to minimize the solution found.
Minimization took 82 ms.
[2020-05-27 22:35:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 1425 ms returned sat
[2020-05-27 22:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:36:10] [INFO ] [Real]Absence check using state equation in 11831 ms returned sat
[2020-05-27 22:36:10] [INFO ] [Real]Added 271 Read/Feed constraints in 54 ms returned sat
[2020-05-27 22:36:11] [INFO ] Deduced a trap composed of 6 places in 792 ms
[2020-05-27 22:36:11] [INFO ] Deduced a trap composed of 6 places in 815 ms
[2020-05-27 22:36:12] [INFO ] Deduced a trap composed of 6 places in 969 ms
[2020-05-27 22:36:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2876 ms
[2020-05-27 22:36:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:36:14] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1429 ms returned sat
[2020-05-27 22:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:36:27] [INFO ] [Nat]Absence check using state equation in 13135 ms returned sat
[2020-05-27 22:36:28] [INFO ] [Nat]Added 271 Read/Feed constraints in 142 ms returned sat
[2020-05-27 22:36:28] [INFO ] Deduced a trap composed of 5 places in 251 ms
[2020-05-27 22:36:28] [INFO ] Deduced a trap composed of 7 places in 207 ms
[2020-05-27 22:36:29] [INFO ] Deduced a trap composed of 7 places in 269 ms
[2020-05-27 22:36:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1039 ms
[2020-05-27 22:36:29] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 122 ms.
[2020-05-27 22:36:49] [INFO ] Added : 580 causal constraints over 116 iterations in 20128 ms.(timeout) Result :sat
[2020-05-27 22:36:49] [INFO ] Deduced a trap composed of 7 places in 289 ms
[2020-05-27 22:36:50] [INFO ] Deduced a trap composed of 7 places in 268 ms
[2020-05-27 22:36:50] [INFO ] Deduced a trap composed of 7 places in 293 ms
[2020-05-27 22:36:50] [INFO ] Deduced a trap composed of 5 places in 284 ms
[2020-05-27 22:36:51] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 22:36:51] [INFO ] Deduced a trap composed of 5 places in 275 ms
[2020-05-27 22:36:52] [INFO ] Deduced a trap composed of 7 places in 272 ms
[2020-05-27 22:36:52] [INFO ] Deduced a trap composed of 7 places in 267 ms
[2020-05-27 22:36:53] [INFO ] Deduced a trap composed of 5 places in 257 ms
[2020-05-27 22:36:53] [INFO ] Deduced a trap composed of 5 places in 268 ms
[2020-05-27 22:36:53] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2020-05-27 22:36:54] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 22:36:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5223 ms
Attempting to minimize the solution found.
Minimization took 85 ms.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 259400 steps, including 1002 resets, run finished after 3947 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 248300 steps, including 1002 resets, run finished after 3567 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 252500 steps, including 1002 resets, run finished after 3464 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 236300 steps, including 1002 resets, run finished after 3139 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 245200 steps, including 1002 resets, run finished after 3656 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 226600 steps, including 1002 resets, run finished after 3432 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 281900 steps, including 1002 resets, run finished after 3841 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 233300 steps, including 1002 resets, run finished after 3111 ms. (steps per millisecond=74 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 306900 steps, including 1002 resets, run finished after 4244 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 40 out of 2588 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2588/2588 places, 2173/2173 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2588 transition count 2171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2586 transition count 2171
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 4 place count 2586 transition count 2162
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 2577 transition count 2162
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 9 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 2561 transition count 2146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 64 place count 2556 transition count 2146
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 2556 transition count 2146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 2555 transition count 2145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 2554 transition count 2144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 2553 transition count 2143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 2552 transition count 2142
Applied a total of 70 rules in 742 ms. Remains 2552 /2588 variables (removed 36) and now considering 2142/2173 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 2552/2588 places, 2142/2173 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13673 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 507477 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 494660 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 472798 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 470751 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 522885 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 542628 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 543000 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 451282 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 956325 steps, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 956325 steps, saw 148132 distinct states, run finished after 30001 ms. (steps per millisecond=31 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2142 rows 2552 cols
[2020-05-27 22:38:51] [INFO ] Computed 1101 place invariants in 8 ms
[2020-05-27 22:38:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 1074 ms returned sat
[2020-05-27 22:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:39:04] [INFO ] [Real]Absence check using state equation in 11427 ms returned sat
[2020-05-27 22:39:04] [INFO ] State equation strengthened by 275 read => feed constraints.
[2020-05-27 22:39:04] [INFO ] [Real]Added 275 Read/Feed constraints in 52 ms returned sat
[2020-05-27 22:39:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:39:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1200 ms returned sat
[2020-05-27 22:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:39:17] [INFO ] [Nat]Absence check using state equation in 11977 ms returned sat
[2020-05-27 22:39:18] [INFO ] [Nat]Added 275 Read/Feed constraints in 105 ms returned sat
[2020-05-27 22:39:18] [INFO ] Deduced a trap composed of 6 places in 215 ms
[2020-05-27 22:39:18] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-05-27 22:39:19] [INFO ] Deduced a trap composed of 7 places in 266 ms
[2020-05-27 22:39:19] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-05-27 22:39:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1394 ms
[2020-05-27 22:39:19] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 150 ms.
[2020-05-27 22:39:39] [INFO ] Added : 590 causal constraints over 118 iterations in 20228 ms.(timeout) Result :sat
[2020-05-27 22:39:40] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-05-27 22:39:40] [INFO ] Deduced a trap composed of 7 places in 275 ms
[2020-05-27 22:39:40] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-05-27 22:39:41] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-05-27 22:39:41] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-05-27 22:39:42] [INFO ] Deduced a trap composed of 7 places in 257 ms
[2020-05-27 22:39:42] [INFO ] Deduced a trap composed of 7 places in 236 ms
[2020-05-27 22:39:43] [INFO ] Deduced a trap composed of 5 places in 255 ms
[2020-05-27 22:39:43] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-05-27 22:39:43] [INFO ] Deduced a trap composed of 5 places in 237 ms
[2020-05-27 22:39:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4310 ms
Attempting to minimize the solution found.
Minimization took 87 ms.
[2020-05-27 22:39:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 1419 ms returned sat
[2020-05-27 22:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:39:57] [INFO ] [Real]Absence check using state equation in 11998 ms returned sat
[2020-05-27 22:39:58] [INFO ] [Real]Added 275 Read/Feed constraints in 84 ms returned sat
[2020-05-27 22:39:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:39:59] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1279 ms returned sat
[2020-05-27 22:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:40:11] [INFO ] [Nat]Absence check using state equation in 11739 ms returned sat
[2020-05-27 22:40:11] [INFO ] [Nat]Added 275 Read/Feed constraints in 153 ms returned sat
[2020-05-27 22:40:11] [INFO ] Deduced a trap composed of 3 places in 268 ms
[2020-05-27 22:40:12] [INFO ] Deduced a trap composed of 4 places in 284 ms
[2020-05-27 22:40:12] [INFO ] Deduced a trap composed of 5 places in 281 ms
[2020-05-27 22:40:13] [INFO ] Deduced a trap composed of 6 places in 271 ms
[2020-05-27 22:40:13] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-05-27 22:40:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2008 ms
[2020-05-27 22:40:13] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 147 ms.
[2020-05-27 22:40:33] [INFO ] Added : 595 causal constraints over 119 iterations in 20114 ms.(timeout) Result :sat
[2020-05-27 22:40:34] [INFO ] Deduced a trap composed of 5 places in 275 ms
[2020-05-27 22:40:34] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-05-27 22:40:34] [INFO ] Deduced a trap composed of 7 places in 266 ms
[2020-05-27 22:40:35] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2020-05-27 22:40:35] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-05-27 22:40:36] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2020-05-27 22:40:36] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-05-27 22:40:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3167 ms
Attempting to minimize the solution found.
Minimization took 61 ms.
[2020-05-27 22:40:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 1258 ms returned sat
[2020-05-27 22:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:40:51] [INFO ] [Real]Absence check using state equation in 12419 ms returned sat
[2020-05-27 22:40:51] [INFO ] [Real]Added 275 Read/Feed constraints in 89 ms returned sat
[2020-05-27 22:40:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:40:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1364 ms returned sat
[2020-05-27 22:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:41:05] [INFO ] [Nat]Absence check using state equation in 12155 ms returned sat
[2020-05-27 22:41:05] [INFO ] [Nat]Added 275 Read/Feed constraints in 79 ms returned sat
[2020-05-27 22:41:05] [INFO ] Deduced a trap composed of 7 places in 247 ms
[2020-05-27 22:41:05] [INFO ] Deduced a trap composed of 5 places in 251 ms
[2020-05-27 22:41:06] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-05-27 22:41:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 997 ms
[2020-05-27 22:41:06] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 120 ms.
[2020-05-27 22:41:26] [INFO ] Added : 560 causal constraints over 112 iterations in 20245 ms.(timeout) Result :sat
[2020-05-27 22:41:26] [INFO ] Deduced a trap composed of 6 places in 401 ms
[2020-05-27 22:41:27] [INFO ] Deduced a trap composed of 6 places in 392 ms
[2020-05-27 22:41:28] [INFO ] Deduced a trap composed of 5 places in 376 ms
[2020-05-27 22:41:28] [INFO ] Deduced a trap composed of 6 places in 388 ms
[2020-05-27 22:41:29] [INFO ] Deduced a trap composed of 6 places in 389 ms
[2020-05-27 22:41:29] [INFO ] Deduced a trap composed of 5 places in 380 ms
[2020-05-27 22:41:30] [INFO ] Deduced a trap composed of 8 places in 395 ms
[2020-05-27 22:41:30] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-05-27 22:41:31] [INFO ] Deduced a trap composed of 6 places in 352 ms
[2020-05-27 22:41:31] [INFO ] Deduced a trap composed of 6 places in 348 ms
[2020-05-27 22:41:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5423 ms
Attempting to minimize the solution found.
Minimization took 58 ms.
[2020-05-27 22:41:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 1157 ms returned sat
[2020-05-27 22:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:41:46] [INFO ] [Real]Absence check using state equation in 13151 ms returned sat
[2020-05-27 22:41:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:41:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1199 ms returned sat
[2020-05-27 22:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:42:01] [INFO ] [Nat]Absence check using state equation in 12893 ms returned sat
[2020-05-27 22:42:01] [INFO ] [Nat]Added 275 Read/Feed constraints in 141 ms returned sat
[2020-05-27 22:42:01] [INFO ] Deduced a trap composed of 7 places in 311 ms
[2020-05-27 22:42:02] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2020-05-27 22:42:02] [INFO ] Deduced a trap composed of 4 places in 292 ms
[2020-05-27 22:42:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1230 ms
[2020-05-27 22:42:02] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 137 ms.
[2020-05-27 22:42:22] [INFO ] Added : 545 causal constraints over 109 iterations in 20062 ms.(timeout) Result :sat
[2020-05-27 22:42:23] [INFO ] Deduced a trap composed of 5 places in 303 ms
[2020-05-27 22:42:23] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-05-27 22:42:24] [INFO ] Deduced a trap composed of 6 places in 322 ms
[2020-05-27 22:42:24] [INFO ] Deduced a trap composed of 5 places in 323 ms
[2020-05-27 22:42:24] [INFO ] Deduced a trap composed of 6 places in 295 ms
[2020-05-27 22:42:25] [INFO ] Deduced a trap composed of 5 places in 281 ms
[2020-05-27 22:42:25] [INFO ] Deduced a trap composed of 5 places in 388 ms
[2020-05-27 22:42:26] [INFO ] Deduced a trap composed of 5 places in 287 ms
[2020-05-27 22:42:26] [INFO ] Deduced a trap composed of 6 places in 304 ms
[2020-05-27 22:42:27] [INFO ] Deduced a trap composed of 5 places in 293 ms
[2020-05-27 22:42:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4813 ms
Attempting to minimize the solution found.
Minimization took 84 ms.
[2020-05-27 22:42:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 1097 ms returned sat
[2020-05-27 22:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:42:40] [INFO ] [Real]Absence check using state equation in 11914 ms returned sat
[2020-05-27 22:42:41] [INFO ] [Real]Added 275 Read/Feed constraints in 51 ms returned sat
[2020-05-27 22:42:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:42:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1158 ms returned sat
[2020-05-27 22:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:42:54] [INFO ] [Nat]Absence check using state equation in 12033 ms returned sat
[2020-05-27 22:42:54] [INFO ] [Nat]Added 275 Read/Feed constraints in 163 ms returned sat
[2020-05-27 22:42:55] [INFO ] Deduced a trap composed of 7 places in 252 ms
[2020-05-27 22:42:55] [INFO ] Deduced a trap composed of 8 places in 228 ms
[2020-05-27 22:42:55] [INFO ] Deduced a trap composed of 5 places in 215 ms
[2020-05-27 22:42:56] [INFO ] Deduced a trap composed of 6 places in 191 ms
[2020-05-27 22:42:56] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-05-27 22:42:56] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-05-27 22:42:56] [INFO ] Deduced a trap composed of 7 places in 147 ms
[2020-05-27 22:42:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2004 ms
[2020-05-27 22:42:56] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 105 ms.
[2020-05-27 22:43:16] [INFO ] Added : 740 causal constraints over 148 iterations in 20198 ms.(timeout) Result :sat
[2020-05-27 22:43:17] [INFO ] Deduced a trap composed of 6 places in 355 ms
[2020-05-27 22:43:17] [INFO ] Deduced a trap composed of 5 places in 350 ms
[2020-05-27 22:43:18] [INFO ] Deduced a trap composed of 6 places in 331 ms
[2020-05-27 22:43:18] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-05-27 22:43:19] [INFO ] Deduced a trap composed of 5 places in 308 ms
[2020-05-27 22:43:19] [INFO ] Deduced a trap composed of 8 places in 318 ms
[2020-05-27 22:43:20] [INFO ] Deduced a trap composed of 5 places in 326 ms
[2020-05-27 22:43:20] [INFO ] Deduced a trap composed of 7 places in 329 ms
[2020-05-27 22:43:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4003 ms
Attempting to minimize the solution found.
Minimization took 107 ms.
[2020-05-27 22:43:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 1226 ms returned sat
[2020-05-27 22:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:43:34] [INFO ] [Real]Absence check using state equation in 11367 ms returned sat
[2020-05-27 22:43:34] [INFO ] [Real]Added 275 Read/Feed constraints in 84 ms returned sat
[2020-05-27 22:43:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:43:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1216 ms returned sat
[2020-05-27 22:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:43:47] [INFO ] [Nat]Absence check using state equation in 11213 ms returned sat
[2020-05-27 22:43:47] [INFO ] [Nat]Added 275 Read/Feed constraints in 96 ms returned sat
[2020-05-27 22:43:47] [INFO ] Deduced a trap composed of 6 places in 170 ms
[2020-05-27 22:43:47] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-05-27 22:43:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2020-05-27 22:43:47] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 86 ms.
[2020-05-27 22:44:07] [INFO ] Added : 630 causal constraints over 126 iterations in 20128 ms.(timeout) Result :sat
[2020-05-27 22:44:08] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2020-05-27 22:44:08] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-05-27 22:44:09] [INFO ] Deduced a trap composed of 7 places in 310 ms
[2020-05-27 22:44:09] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-05-27 22:44:10] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-05-27 22:44:10] [INFO ] Deduced a trap composed of 7 places in 336 ms
[2020-05-27 22:44:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2782 ms
Attempting to minimize the solution found.
Minimization took 96 ms.
[2020-05-27 22:44:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 1191 ms returned sat
[2020-05-27 22:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:44:24] [INFO ] [Real]Absence check using state equation in 12299 ms returned sat
[2020-05-27 22:44:24] [INFO ] [Real]Added 275 Read/Feed constraints in 71 ms returned sat
[2020-05-27 22:44:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:44:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1395 ms returned sat
[2020-05-27 22:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:44:39] [INFO ] [Nat]Absence check using state equation in 12750 ms returned sat
[2020-05-27 22:44:39] [INFO ] [Nat]Added 275 Read/Feed constraints in 94 ms returned sat
[2020-05-27 22:44:39] [INFO ] Deduced a trap composed of 5 places in 252 ms
[2020-05-27 22:44:40] [INFO ] Deduced a trap composed of 7 places in 232 ms
[2020-05-27 22:44:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 742 ms
[2020-05-27 22:44:40] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 129 ms.
[2020-05-27 22:45:00] [INFO ] Added : 685 causal constraints over 137 iterations in 20279 ms.(timeout) Result :sat
[2020-05-27 22:45:00] [INFO ] Deduced a trap composed of 7 places in 328 ms
[2020-05-27 22:45:01] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2020-05-27 22:45:01] [INFO ] Deduced a trap composed of 7 places in 257 ms
[2020-05-27 22:45:02] [INFO ] Deduced a trap composed of 7 places in 289 ms
[2020-05-27 22:45:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2003 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-05-27 22:45:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 1390 ms returned sat
[2020-05-27 22:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:45:17] [INFO ] [Real]Absence check using state equation in 12529 ms returned sat
[2020-05-27 22:45:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:45:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1380 ms returned sat
[2020-05-27 22:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:45:31] [INFO ] [Nat]Absence check using state equation in 12432 ms returned sat
[2020-05-27 22:45:31] [INFO ] [Nat]Added 275 Read/Feed constraints in 134 ms returned sat
[2020-05-27 22:45:31] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-05-27 22:45:32] [INFO ] Deduced a trap composed of 5 places in 268 ms
[2020-05-27 22:45:32] [INFO ] Deduced a trap composed of 5 places in 270 ms
[2020-05-27 22:45:32] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-05-27 22:45:33] [INFO ] Deduced a trap composed of 5 places in 260 ms
[2020-05-27 22:45:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1880 ms
[2020-05-27 22:45:33] [INFO ] Computed and/alt/rep : 2129/6726/2129 causal constraints in 135 ms.
[2020-05-27 22:45:53] [INFO ] Added : 645 causal constraints over 129 iterations in 20113 ms.(timeout) Result :sat
[2020-05-27 22:45:53] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 22:45:54] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-05-27 22:45:54] [INFO ] Deduced a trap composed of 5 places in 190 ms
[2020-05-27 22:45:54] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 22:45:55] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-05-27 22:45:55] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-05-27 22:45:56] [INFO ] Deduced a trap composed of 5 places in 243 ms
[2020-05-27 22:45:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2838 ms
Attempting to minimize the solution found.
Minimization took 83 ms.
Incomplete Parikh walk after 273900 steps, including 1002 resets, run finished after 3859 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 240600 steps, including 1002 resets, run finished after 3177 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 237700 steps, including 1002 resets, run finished after 3151 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 236100 steps, including 1002 resets, run finished after 3405 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 276400 steps, including 1002 resets, run finished after 3627 ms. (steps per millisecond=76 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 292200 steps, including 1002 resets, run finished after 3855 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 226100 steps, including 1002 resets, run finished after 3422 ms. (steps per millisecond=66 ) properties seen :[0, 1, 0, 0, 0, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 332000 steps, including 1002 resets, run finished after 5016 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 34 out of 2552 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2552/2552 places, 2142/2142 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2552 transition count 2140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2550 transition count 2140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 2550 transition count 2139
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2549 transition count 2139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 2548 transition count 2138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2547 transition count 2138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 2546 transition count 2137
Applied a total of 11 rules in 411 ms. Remains 2546 /2552 variables (removed 6) and now considering 2137/2142 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 2546/2552 places, 2137/2142 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13328 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 550759 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 549726 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 544579 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 520956 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 523205 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 978904 steps, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 978904 steps, saw 151002 distinct states, run finished after 30001 ms. (steps per millisecond=32 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2137 rows 2546 cols
[2020-05-27 22:47:34] [INFO ] Computed 1101 place invariants in 7 ms
[2020-05-27 22:47:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 1227 ms returned sat
[2020-05-27 22:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:47:48] [INFO ] [Real]Absence check using state equation in 11841 ms returned sat
[2020-05-27 22:47:48] [INFO ] State equation strengthened by 273 read => feed constraints.
[2020-05-27 22:47:48] [INFO ] [Real]Added 273 Read/Feed constraints in 68 ms returned sat
[2020-05-27 22:47:48] [INFO ] Deduced a trap composed of 3 places in 457 ms
[2020-05-27 22:47:49] [INFO ] Deduced a trap composed of 6 places in 457 ms
[2020-05-27 22:47:50] [INFO ] Deduced a trap composed of 6 places in 449 ms
[2020-05-27 22:47:50] [INFO ] Deduced a trap composed of 4 places in 467 ms
[2020-05-27 22:47:51] [INFO ] Deduced a trap composed of 6 places in 469 ms
[2020-05-27 22:47:51] [INFO ] Deduced a trap composed of 6 places in 463 ms
[2020-05-27 22:47:52] [INFO ] Deduced a trap composed of 7 places in 436 ms
[2020-05-27 22:47:52] [INFO ] Deduced a trap composed of 6 places in 436 ms
[2020-05-27 22:47:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4518 ms
[2020-05-27 22:47:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:47:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1160 ms returned sat
[2020-05-27 22:47:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:48:06] [INFO ] [Nat]Absence check using state equation in 12001 ms returned sat
[2020-05-27 22:48:06] [INFO ] [Nat]Added 273 Read/Feed constraints in 78 ms returned sat
[2020-05-27 22:48:06] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-05-27 22:48:07] [INFO ] Deduced a trap composed of 6 places in 262 ms
[2020-05-27 22:48:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 768 ms
[2020-05-27 22:48:07] [INFO ] Computed and/alt/rep : 2126/6714/2126 causal constraints in 117 ms.
[2020-05-27 22:48:27] [INFO ] Added : 545 causal constraints over 109 iterations in 20113 ms.(timeout) Result :sat
[2020-05-27 22:48:27] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-05-27 22:48:28] [INFO ] Deduced a trap composed of 5 places in 208 ms
[2020-05-27 22:48:28] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-05-27 22:48:28] [INFO ] Deduced a trap composed of 5 places in 186 ms
[2020-05-27 22:48:29] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2020-05-27 22:48:29] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-05-27 22:48:29] [INFO ] Deduced a trap composed of 5 places in 159 ms
[2020-05-27 22:48:29] [INFO ] Deduced a trap composed of 6 places in 161 ms
[2020-05-27 22:48:30] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-05-27 22:48:30] [INFO ] Deduced a trap composed of 5 places in 144 ms
[2020-05-27 22:48:30] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-05-27 22:48:30] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-05-27 22:48:31] [INFO ] Deduced a trap composed of 7 places in 142 ms
[2020-05-27 22:48:31] [INFO ] Deduced a trap composed of 5 places in 147 ms
[2020-05-27 22:48:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4146 ms
Attempting to minimize the solution found.
Minimization took 56 ms.
[2020-05-27 22:48:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 997 ms returned sat
[2020-05-27 22:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:48:45] [INFO ] [Real]Absence check using state equation in 12124 ms returned sat
[2020-05-27 22:48:45] [INFO ] [Real]Added 273 Read/Feed constraints in 74 ms returned sat
[2020-05-27 22:48:45] [INFO ] Deduced a trap composed of 5 places in 390 ms
[2020-05-27 22:48:46] [INFO ] Deduced a trap composed of 6 places in 402 ms
[2020-05-27 22:48:46] [INFO ] Deduced a trap composed of 3 places in 375 ms
[2020-05-27 22:48:47] [INFO ] Deduced a trap composed of 6 places in 346 ms
[2020-05-27 22:48:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1998 ms
[2020-05-27 22:48:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:48:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1441 ms returned sat
[2020-05-27 22:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:49:01] [INFO ] [Nat]Absence check using state equation in 12134 ms returned sat
[2020-05-27 22:49:01] [INFO ] [Nat]Added 273 Read/Feed constraints in 166 ms returned sat
[2020-05-27 22:49:01] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-05-27 22:49:02] [INFO ] Deduced a trap composed of 5 places in 248 ms
[2020-05-27 22:49:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 796 ms
[2020-05-27 22:49:02] [INFO ] Computed and/alt/rep : 2126/6714/2126 causal constraints in 114 ms.
[2020-05-27 22:49:22] [INFO ] Added : 520 causal constraints over 104 iterations in 20126 ms.(timeout) Result :sat
[2020-05-27 22:49:22] [INFO ] Deduced a trap composed of 5 places in 326 ms
[2020-05-27 22:49:23] [INFO ] Deduced a trap composed of 5 places in 336 ms
[2020-05-27 22:49:23] [INFO ] Deduced a trap composed of 5 places in 341 ms
[2020-05-27 22:49:24] [INFO ] Deduced a trap composed of 5 places in 337 ms
[2020-05-27 22:49:24] [INFO ] Deduced a trap composed of 6 places in 342 ms
[2020-05-27 22:49:25] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-05-27 22:49:25] [INFO ] Deduced a trap composed of 6 places in 313 ms
[2020-05-27 22:49:26] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-05-27 22:49:26] [INFO ] Deduced a trap composed of 5 places in 337 ms
[2020-05-27 22:49:27] [INFO ] Deduced a trap composed of 6 places in 320 ms
[2020-05-27 22:49:27] [INFO ] Deduced a trap composed of 6 places in 315 ms
[2020-05-27 22:49:28] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-05-27 22:49:28] [INFO ] Deduced a trap composed of 6 places in 311 ms
[2020-05-27 22:49:29] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-05-27 22:49:29] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6818 ms
Attempting to minimize the solution found.
Minimization took 81 ms.
[2020-05-27 22:49:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 1354 ms returned sat
[2020-05-27 22:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:49:43] [INFO ] [Real]Absence check using state equation in 12801 ms returned sat
[2020-05-27 22:49:44] [INFO ] [Real]Added 273 Read/Feed constraints in 74 ms returned sat
[2020-05-27 22:49:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:49:46] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1489 ms returned sat
[2020-05-27 22:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:49:58] [INFO ] [Nat]Absence check using state equation in 12710 ms returned sat
[2020-05-27 22:49:58] [INFO ] [Nat]Added 273 Read/Feed constraints in 65 ms returned sat
[2020-05-27 22:49:59] [INFO ] Deduced a trap composed of 5 places in 288 ms
[2020-05-27 22:49:59] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-05-27 22:49:59] [INFO ] Deduced a trap composed of 6 places in 311 ms
[2020-05-27 22:50:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1214 ms
[2020-05-27 22:50:00] [INFO ] Computed and/alt/rep : 2126/6714/2126 causal constraints in 120 ms.
[2020-05-27 22:50:20] [INFO ] Added : 605 causal constraints over 121 iterations in 20131 ms.(timeout) Result :sat
[2020-05-27 22:50:20] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-05-27 22:50:20] [INFO ] Deduced a trap composed of 6 places in 301 ms
[2020-05-27 22:50:21] [INFO ] Deduced a trap composed of 7 places in 312 ms
[2020-05-27 22:50:21] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-05-27 22:50:22] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 22:50:22] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-05-27 22:50:23] [INFO ] Deduced a trap composed of 7 places in 302 ms
[2020-05-27 22:50:23] [INFO ] Deduced a trap composed of 4 places in 280 ms
[2020-05-27 22:50:24] [INFO ] Deduced a trap composed of 6 places in 286 ms
[2020-05-27 22:50:24] [INFO ] Deduced a trap composed of 5 places in 274 ms
[2020-05-27 22:50:25] [INFO ] Deduced a trap composed of 5 places in 290 ms
[2020-05-27 22:50:25] [INFO ] Deduced a trap composed of 5 places in 270 ms
[2020-05-27 22:50:25] [INFO ] Deduced a trap composed of 5 places in 288 ms
[2020-05-27 22:50:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5931 ms
Attempting to minimize the solution found.
Minimization took 92 ms.
[2020-05-27 22:50:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 1279 ms returned sat
[2020-05-27 22:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:50:40] [INFO ] [Real]Absence check using state equation in 12248 ms returned sat
[2020-05-27 22:50:40] [INFO ] [Real]Added 273 Read/Feed constraints in 82 ms returned sat
[2020-05-27 22:50:40] [INFO ] Deduced a trap composed of 3 places in 395 ms
[2020-05-27 22:50:41] [INFO ] Deduced a trap composed of 5 places in 407 ms
[2020-05-27 22:50:41] [INFO ] Deduced a trap composed of 5 places in 399 ms
[2020-05-27 22:50:42] [INFO ] Deduced a trap composed of 6 places in 404 ms
[2020-05-27 22:50:42] [INFO ] Deduced a trap composed of 7 places in 409 ms
[2020-05-27 22:50:43] [INFO ] Deduced a trap composed of 7 places in 389 ms
[2020-05-27 22:50:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3083 ms
[2020-05-27 22:50:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:50:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1222 ms returned sat
[2020-05-27 22:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:50:56] [INFO ] [Nat]Absence check using state equation in 11689 ms returned sat
[2020-05-27 22:50:56] [INFO ] [Nat]Added 273 Read/Feed constraints in 81 ms returned sat
[2020-05-27 22:50:57] [INFO ] Computed and/alt/rep : 2126/6714/2126 causal constraints in 112 ms.
[2020-05-27 22:51:17] [INFO ] Added : 540 causal constraints over 108 iterations in 20414 ms.(timeout) Result :sat
[2020-05-27 22:51:17] [INFO ] Deduced a trap composed of 7 places in 254 ms
[2020-05-27 22:51:18] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-05-27 22:51:18] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2020-05-27 22:51:18] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-05-27 22:51:19] [INFO ] Deduced a trap composed of 5 places in 203 ms
[2020-05-27 22:51:19] [INFO ] Deduced a trap composed of 7 places in 230 ms
[2020-05-27 22:51:20] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 22:51:20] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2020-05-27 22:51:20] [INFO ] Deduced a trap composed of 5 places in 176 ms
[2020-05-27 22:51:21] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2020-05-27 22:51:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3974 ms
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-05-27 22:51:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 1299 ms returned sat
[2020-05-27 22:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:51:35] [INFO ] [Real]Absence check using state equation in 12115 ms returned sat
[2020-05-27 22:51:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:51:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1208 ms returned sat
[2020-05-27 22:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:51:48] [INFO ] [Nat]Absence check using state equation in 12112 ms returned sat
[2020-05-27 22:51:48] [INFO ] [Nat]Added 273 Read/Feed constraints in 110 ms returned sat
[2020-05-27 22:51:49] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-05-27 22:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2020-05-27 22:51:49] [INFO ] Computed and/alt/rep : 2126/6714/2126 causal constraints in 98 ms.
[2020-05-27 22:52:09] [INFO ] Added : 505 causal constraints over 101 iterations in 20187 ms.(timeout) Result :sat
[2020-05-27 22:52:10] [INFO ] Deduced a trap composed of 6 places in 402 ms
[2020-05-27 22:52:10] [INFO ] Deduced a trap composed of 6 places in 382 ms
[2020-05-27 22:52:11] [INFO ] Deduced a trap composed of 5 places in 418 ms
[2020-05-27 22:52:11] [INFO ] Deduced a trap composed of 5 places in 369 ms
[2020-05-27 22:52:12] [INFO ] Deduced a trap composed of 5 places in 396 ms
[2020-05-27 22:52:12] [INFO ] Deduced a trap composed of 5 places in 377 ms
[2020-05-27 22:52:13] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-05-27 22:52:13] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 22:52:14] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-05-27 22:52:14] [INFO ] Deduced a trap composed of 6 places in 367 ms
[2020-05-27 22:52:15] [INFO ] Deduced a trap composed of 6 places in 375 ms
[2020-05-27 22:52:15] [INFO ] Deduced a trap composed of 7 places in 379 ms
[2020-05-27 22:52:16] [INFO ] Deduced a trap composed of 7 places in 380 ms
[2020-05-27 22:52:16] [INFO ] Deduced a trap composed of 7 places in 317 ms
[2020-05-27 22:52:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7269 ms
Attempting to minimize the solution found.
Minimization took 84 ms.
Incomplete Parikh walk after 238800 steps, including 1002 resets, run finished after 3355 ms. (steps per millisecond=71 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 274300 steps, including 1002 resets, run finished after 3879 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 241500 steps, including 1002 resets, run finished after 3293 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 235500 steps, including 1002 resets, run finished after 3380 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 217000 steps, including 1002 resets, run finished after 3071 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 2546 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2546/2546 places, 2137/2137 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2546 transition count 2132
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 2541 transition count 2132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 2541 transition count 2129
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 2538 transition count 2129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 2535 transition count 2126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 2533 transition count 2126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 2532 transition count 2125
Applied a total of 27 rules in 293 ms. Remains 2532 /2546 variables (removed 14) and now considering 2125/2137 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2546 places, 2125/2137 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12805 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 535555 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 522005 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 503041 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 511823 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 860874 steps, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 860874 steps, saw 132588 distinct states, run finished after 30001 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 2125 rows 2532 cols
[2020-05-27 22:53:37] [INFO ] Computed 1101 place invariants in 8 ms
[2020-05-27 22:53:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 1199 ms returned sat
[2020-05-27 22:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:53:50] [INFO ] [Real]Absence check using state equation in 11953 ms returned sat
[2020-05-27 22:53:50] [INFO ] State equation strengthened by 276 read => feed constraints.
[2020-05-27 22:53:50] [INFO ] [Real]Added 276 Read/Feed constraints in 67 ms returned sat
[2020-05-27 22:53:51] [INFO ] Deduced a trap composed of 6 places in 442 ms
[2020-05-27 22:53:51] [INFO ] Deduced a trap composed of 5 places in 365 ms
[2020-05-27 22:53:52] [INFO ] Deduced a trap composed of 5 places in 372 ms
[2020-05-27 22:53:52] [INFO ] Deduced a trap composed of 5 places in 327 ms
[2020-05-27 22:53:53] [INFO ] Deduced a trap composed of 5 places in 341 ms
[2020-05-27 22:53:53] [INFO ] Deduced a trap composed of 4 places in 299 ms
[2020-05-27 22:53:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2701 ms
[2020-05-27 22:53:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:53:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1184 ms returned sat
[2020-05-27 22:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:54:05] [INFO ] [Nat]Absence check using state equation in 10721 ms returned sat
[2020-05-27 22:54:05] [INFO ] [Nat]Added 276 Read/Feed constraints in 83 ms returned sat
[2020-05-27 22:54:06] [INFO ] Deduced a trap composed of 5 places in 264 ms
[2020-05-27 22:54:06] [INFO ] Deduced a trap composed of 5 places in 258 ms
[2020-05-27 22:54:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 731 ms
[2020-05-27 22:54:06] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 118 ms.
[2020-05-27 22:54:26] [INFO ] Added : 675 causal constraints over 135 iterations in 20072 ms.(timeout) Result :sat
[2020-05-27 22:54:26] [INFO ] Deduced a trap composed of 6 places in 241 ms
[2020-05-27 22:54:27] [INFO ] Deduced a trap composed of 5 places in 235 ms
[2020-05-27 22:54:27] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 22:54:28] [INFO ] Deduced a trap composed of 5 places in 270 ms
[2020-05-27 22:54:28] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-05-27 22:54:28] [INFO ] Deduced a trap composed of 5 places in 264 ms
[2020-05-27 22:54:29] [INFO ] Deduced a trap composed of 6 places in 258 ms
[2020-05-27 22:54:29] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-05-27 22:54:30] [INFO ] Deduced a trap composed of 6 places in 258 ms
[2020-05-27 22:54:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3627 ms
Attempting to minimize the solution found.
Minimization took 72 ms.
[2020-05-27 22:54:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 1089 ms returned sat
[2020-05-27 22:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:54:43] [INFO ] [Real]Absence check using state equation in 11319 ms returned sat
[2020-05-27 22:54:43] [INFO ] [Real]Added 276 Read/Feed constraints in 81 ms returned sat
[2020-05-27 22:54:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:54:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1248 ms returned sat
[2020-05-27 22:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:54:56] [INFO ] [Nat]Absence check using state equation in 11610 ms returned sat
[2020-05-27 22:54:56] [INFO ] [Nat]Added 276 Read/Feed constraints in 58 ms returned sat
[2020-05-27 22:54:56] [INFO ] Deduced a trap composed of 6 places in 249 ms
[2020-05-27 22:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2020-05-27 22:54:57] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 108 ms.
[2020-05-27 22:55:16] [INFO ] Added : 695 causal constraints over 139 iterations in 20052 ms.(timeout) Result :sat
[2020-05-27 22:55:17] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-05-27 22:55:17] [INFO ] Deduced a trap composed of 5 places in 237 ms
[2020-05-27 22:55:18] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-05-27 22:55:18] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2020-05-27 22:55:18] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-05-27 22:55:19] [INFO ] Deduced a trap composed of 5 places in 228 ms
[2020-05-27 22:55:19] [INFO ] Deduced a trap composed of 7 places in 214 ms
[2020-05-27 22:55:19] [INFO ] Deduced a trap composed of 5 places in 196 ms
[2020-05-27 22:55:20] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 22:55:20] [INFO ] Deduced a trap composed of 5 places in 191 ms
[2020-05-27 22:55:21] [INFO ] Deduced a trap composed of 8 places in 221 ms
[2020-05-27 22:55:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4239 ms
Attempting to minimize the solution found.
Minimization took 99 ms.
[2020-05-27 22:55:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 1268 ms returned sat
[2020-05-27 22:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:55:35] [INFO ] [Real]Absence check using state equation in 12275 ms returned sat
[2020-05-27 22:55:35] [INFO ] [Real]Added 276 Read/Feed constraints in 67 ms returned sat
[2020-05-27 22:55:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:55:37] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1192 ms returned sat
[2020-05-27 22:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:55:49] [INFO ] [Nat]Absence check using state equation in 12290 ms returned sat
[2020-05-27 22:55:49] [INFO ] [Nat]Added 276 Read/Feed constraints in 64 ms returned sat
[2020-05-27 22:55:49] [INFO ] Deduced a trap composed of 7 places in 217 ms
[2020-05-27 22:55:50] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-05-27 22:55:50] [INFO ] Deduced a trap composed of 5 places in 167 ms
[2020-05-27 22:55:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 882 ms
[2020-05-27 22:55:50] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 144 ms.
[2020-05-27 22:56:10] [INFO ] Added : 590 causal constraints over 118 iterations in 20202 ms.(timeout) Result :sat
[2020-05-27 22:56:10] [INFO ] Deduced a trap composed of 5 places in 300 ms
[2020-05-27 22:56:11] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-05-27 22:56:11] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-05-27 22:56:12] [INFO ] Deduced a trap composed of 6 places in 284 ms
[2020-05-27 22:56:12] [INFO ] Deduced a trap composed of 5 places in 288 ms
[2020-05-27 22:56:13] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-05-27 22:56:13] [INFO ] Deduced a trap composed of 6 places in 286 ms
[2020-05-27 22:56:14] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-05-27 22:56:14] [INFO ] Deduced a trap composed of 7 places in 280 ms
[2020-05-27 22:56:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4127 ms
Attempting to minimize the solution found.
Minimization took 67 ms.
[2020-05-27 22:56:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 1264 ms returned sat
[2020-05-27 22:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:56:28] [INFO ] [Real]Absence check using state equation in 12191 ms returned sat
[2020-05-27 22:56:28] [INFO ] [Real]Added 276 Read/Feed constraints in 80 ms returned sat
[2020-05-27 22:56:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:56:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1092 ms returned sat
[2020-05-27 22:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:56:43] [INFO ] [Nat]Absence check using state equation in 12785 ms returned sat
[2020-05-27 22:56:43] [INFO ] [Nat]Added 276 Read/Feed constraints in 112 ms returned sat
[2020-05-27 22:56:43] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-05-27 22:56:43] [INFO ] Deduced a trap composed of 5 places in 239 ms
[2020-05-27 22:56:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 697 ms
[2020-05-27 22:56:44] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 135 ms.
[2020-05-27 22:57:03] [INFO ] Added : 665 causal constraints over 133 iterations in 20061 ms.(timeout) Result :sat
[2020-05-27 22:57:04] [INFO ] Deduced a trap composed of 5 places in 246 ms
[2020-05-27 22:57:04] [INFO ] Deduced a trap composed of 5 places in 237 ms
[2020-05-27 22:57:04] [INFO ] Deduced a trap composed of 5 places in 196 ms
[2020-05-27 22:57:05] [INFO ] Deduced a trap composed of 7 places in 238 ms
[2020-05-27 22:57:05] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 22:57:06] [INFO ] Deduced a trap composed of 7 places in 241 ms
[2020-05-27 22:57:06] [INFO ] Deduced a trap composed of 5 places in 228 ms
[2020-05-27 22:57:06] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-05-27 22:57:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3178 ms
Attempting to minimize the solution found.
Minimization took 93 ms.
Incomplete Parikh walk after 242000 steps, including 1002 resets, run finished after 3718 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 242600 steps, including 1002 resets, run finished after 3138 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 236800 steps, including 1002 resets, run finished after 3058 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 248200 steps, including 1002 resets, run finished after 3753 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 2532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2532/2532 places, 2125/2125 transitions.
Applied a total of 0 rules in 67 ms. Remains 2532 /2532 variables (removed 0) and now considering 2125/2125 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2125/2125 transitions.
Starting structural reductions, iteration 0 : 2532/2532 places, 2125/2125 transitions.
Applied a total of 0 rules in 66 ms. Remains 2532 /2532 variables (removed 0) and now considering 2125/2125 (removed 0) transitions.
// Phase 1: matrix 2125 rows 2532 cols
[2020-05-27 22:57:21] [INFO ] Computed 1101 place invariants in 6 ms
[2020-05-27 22:57:35] [INFO ] Implicit Places using invariants in 14229 ms returned []
// Phase 1: matrix 2125 rows 2532 cols
[2020-05-27 22:57:35] [INFO ] Computed 1101 place invariants in 6 ms
[2020-05-27 22:57:47] [INFO ] State equation strengthened by 276 read => feed constraints.
[2020-05-27 22:58:17] [INFO ] Performed 1084/2532 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-27 22:58:47] [INFO ] Performed 2089/2532 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-05-27 22:59:02] [INFO ] Implicit Places using invariants and state equation in 86809 ms returned []
Implicit Place search using SMT with State Equation took 101039 ms to find 0 implicit places.
[2020-05-27 22:59:02] [INFO ] Redundant transitions in 244 ms returned []
// Phase 1: matrix 2125 rows 2532 cols
[2020-05-27 22:59:02] [INFO ] Computed 1101 place invariants in 8 ms
[2020-05-27 22:59:13] [INFO ] Dead Transitions using invariants and state equation in 11225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2125/2125 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1571 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 2125 rows 2532 cols
[2020-05-27 22:59:15] [INFO ] Computed 1101 place invariants in 9 ms
[2020-05-27 22:59:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 1321 ms returned sat
[2020-05-27 22:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:59:28] [INFO ] [Real]Absence check using state equation in 11501 ms returned sat
[2020-05-27 22:59:28] [INFO ] State equation strengthened by 276 read => feed constraints.
[2020-05-27 22:59:28] [INFO ] [Real]Added 276 Read/Feed constraints in 79 ms returned sat
[2020-05-27 22:59:29] [INFO ] Deduced a trap composed of 6 places in 383 ms
[2020-05-27 22:59:29] [INFO ] Deduced a trap composed of 5 places in 403 ms
[2020-05-27 22:59:30] [INFO ] Deduced a trap composed of 5 places in 434 ms
[2020-05-27 22:59:30] [INFO ] Deduced a trap composed of 5 places in 417 ms
[2020-05-27 22:59:31] [INFO ] Deduced a trap composed of 5 places in 437 ms
[2020-05-27 22:59:31] [INFO ] Deduced a trap composed of 4 places in 411 ms
[2020-05-27 22:59:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3169 ms
[2020-05-27 22:59:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:59:33] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1147 ms returned sat
[2020-05-27 22:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:59:43] [INFO ] [Nat]Absence check using state equation in 10548 ms returned sat
[2020-05-27 22:59:44] [INFO ] [Nat]Added 276 Read/Feed constraints in 85 ms returned sat
[2020-05-27 22:59:44] [INFO ] Deduced a trap composed of 5 places in 264 ms
[2020-05-27 22:59:44] [INFO ] Deduced a trap composed of 5 places in 267 ms
[2020-05-27 22:59:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
[2020-05-27 22:59:44] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 117 ms.
[2020-05-27 22:59:51] [INFO ] Added : 185 causal constraints over 37 iterations in 7120 ms. Result :unknown
[2020-05-27 22:59:53] [INFO ] [Real]Absence check using 1101 positive place invariants in 1246 ms returned sat
[2020-05-27 22:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:00:04] [INFO ] [Real]Absence check using state equation in 11298 ms returned sat
[2020-05-27 23:00:04] [INFO ] [Real]Added 276 Read/Feed constraints in 88 ms returned sat
[2020-05-27 23:00:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:00:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1279 ms returned sat
[2020-05-27 23:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:00:18] [INFO ] [Nat]Absence check using state equation in 12078 ms returned sat
[2020-05-27 23:00:18] [INFO ] [Nat]Added 276 Read/Feed constraints in 55 ms returned sat
[2020-05-27 23:00:19] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 23:00:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2020-05-27 23:00:19] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 115 ms.
[2020-05-27 23:00:25] [INFO ] Added : 155 causal constraints over 31 iterations in 5873 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-27 23:00:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 1225 ms returned sat
[2020-05-27 23:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:00:38] [INFO ] [Real]Absence check using state equation in 11668 ms returned sat
[2020-05-27 23:00:38] [INFO ] [Real]Added 276 Read/Feed constraints in 85 ms returned sat
[2020-05-27 23:00:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:00:40] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1389 ms returned sat
[2020-05-27 23:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:00:52] [INFO ] [Nat]Absence check using state equation in 11858 ms returned sat
[2020-05-27 23:00:52] [INFO ] [Nat]Added 276 Read/Feed constraints in 62 ms returned sat
[2020-05-27 23:00:52] [INFO ] Deduced a trap composed of 7 places in 243 ms
[2020-05-27 23:00:52] [INFO ] Deduced a trap composed of 6 places in 322 ms
[2020-05-27 23:00:53] [INFO ] Deduced a trap composed of 5 places in 241 ms
[2020-05-27 23:00:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1152 ms
[2020-05-27 23:00:53] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 144 ms.
[2020-05-27 23:00:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t146 0) (and (or (and (> t143 0) (< o143 o146)) (and (> t144 0) (< o144 o146)) (and (> t2058 0) (< o2058 o146))) (or (and (> t837 0) (< o837 o146)) (and (> t839 0) (< o839 o146)))))") while checking expression at index 2
[2020-05-27 23:00:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 1080 ms returned sat
[2020-05-27 23:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:01:11] [INFO ] [Real]Absence check using state equation in 11590 ms returned sat
[2020-05-27 23:01:11] [INFO ] [Real]Added 276 Read/Feed constraints in 87 ms returned sat
[2020-05-27 23:01:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:01:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1136 ms returned sat
[2020-05-27 23:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:01:24] [INFO ] [Nat]Absence check using state equation in 11354 ms returned sat
[2020-05-27 23:01:24] [INFO ] [Nat]Added 276 Read/Feed constraints in 108 ms returned sat
[2020-05-27 23:01:25] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-05-27 23:01:25] [INFO ] Deduced a trap composed of 5 places in 220 ms
[2020-05-27 23:01:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
[2020-05-27 23:01:25] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 129 ms.
[2020-05-27 23:01:31] [INFO ] Added : 180 causal constraints over 36 iterations in 6347 ms. Result :unknown
Partial Free-agglomeration rule applied 620 times.
Drop transitions removed 620 transitions
Iterating global reduction 0 with 620 rules applied. Total rules applied 620 place count 2532 transition count 2125
Partial Post-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 679 place count 2532 transition count 2125
Applied a total of 679 rules in 354 ms. Remains 2532 /2532 variables (removed 0) and now considering 2125/2125 (removed 0) transitions.
// Phase 1: matrix 2125 rows 2532 cols
[2020-05-27 23:01:32] [INFO ] Computed 1101 place invariants in 8 ms
[2020-05-27 23:01:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 1093 ms returned sat
[2020-05-27 23:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:01:44] [INFO ] [Real]Absence check using state equation in 11036 ms returned sat
[2020-05-27 23:01:44] [INFO ] State equation strengthened by 605 read => feed constraints.
[2020-05-27 23:01:44] [INFO ] [Real]Added 605 Read/Feed constraints in 153 ms returned sat
[2020-05-27 23:01:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:01:46] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1214 ms returned sat
[2020-05-27 23:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:01:57] [INFO ] [Nat]Absence check using state equation in 10915 ms returned sat
[2020-05-27 23:01:57] [INFO ] [Nat]Added 605 Read/Feed constraints in 88 ms returned sat
[2020-05-27 23:01:57] [INFO ] Deduced a trap composed of 3 places in 22 ms
[2020-05-27 23:01:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2020-05-27 23:01:57] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 140 ms.
[2020-05-27 23:02:17] [INFO ] Added : 515 causal constraints over 103 iterations in 20249 ms.(timeout) Result :sat
[2020-05-27 23:02:18] [INFO ] Deduced a trap composed of 6 places in 135 ms
[2020-05-27 23:02:18] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2020-05-27 23:02:18] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2020-05-27 23:02:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 984 ms
Attempting to minimize the solution found.
Minimization took 94 ms.
[2020-05-27 23:02:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 1142 ms returned sat
[2020-05-27 23:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:02:32] [INFO ] [Real]Absence check using state equation in 11770 ms returned sat
[2020-05-27 23:02:32] [INFO ] [Real]Added 605 Read/Feed constraints in 179 ms returned sat
[2020-05-27 23:02:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:02:34] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1226 ms returned sat
[2020-05-27 23:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:02:46] [INFO ] [Nat]Absence check using state equation in 12496 ms returned sat
[2020-05-27 23:02:46] [INFO ] [Nat]Added 605 Read/Feed constraints in 105 ms returned sat
[2020-05-27 23:02:47] [INFO ] Deduced a trap composed of 3 places in 41 ms
[2020-05-27 23:02:47] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-27 23:02:47] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-05-27 23:02:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 537 ms
[2020-05-27 23:02:47] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 135 ms.
[2020-05-27 23:03:07] [INFO ] Added : 520 causal constraints over 104 iterations in 20165 ms.(timeout) Result :sat
[2020-05-27 23:03:07] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-05-27 23:03:08] [INFO ] Deduced a trap composed of 8 places in 90 ms
[2020-05-27 23:03:08] [INFO ] Deduced a trap composed of 12 places in 86 ms
[2020-05-27 23:03:08] [INFO ] Deduced a trap composed of 16 places in 84 ms
[2020-05-27 23:03:08] [INFO ] Deduced a trap composed of 8 places in 76 ms
[2020-05-27 23:03:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1382 ms
Attempting to minimize the solution found.
Minimization took 88 ms.
[2020-05-27 23:03:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 1208 ms returned sat
[2020-05-27 23:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:03:22] [INFO ] [Real]Absence check using state equation in 11326 ms returned sat
[2020-05-27 23:03:22] [INFO ] [Real]Added 605 Read/Feed constraints in 192 ms returned sat
[2020-05-27 23:03:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:03:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1256 ms returned sat
[2020-05-27 23:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:03:35] [INFO ] [Nat]Absence check using state equation in 11929 ms returned sat
[2020-05-27 23:03:35] [INFO ] [Nat]Added 605 Read/Feed constraints in 105 ms returned sat
[2020-05-27 23:03:36] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-05-27 23:03:36] [INFO ] Deduced a trap composed of 5 places in 31 ms
[2020-05-27 23:03:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2020-05-27 23:03:36] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 143 ms.
[2020-05-27 23:03:56] [INFO ] Added : 540 causal constraints over 108 iterations in 20091 ms.(timeout) Result :sat
[2020-05-27 23:03:56] [INFO ] Deduced a trap composed of 10 places in 121 ms
[2020-05-27 23:03:56] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-27 23:03:57] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-27 23:03:57] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2020-05-27 23:03:57] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2020-05-27 23:03:57] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2020-05-27 23:03:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1653 ms
Attempting to minimize the solution found.
Minimization took 98 ms.
[2020-05-27 23:04:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 1476 ms returned sat
[2020-05-27 23:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:04:12] [INFO ] [Real]Absence check using state equation in 12325 ms returned sat
[2020-05-27 23:04:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:04:14] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1211 ms returned sat
[2020-05-27 23:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:04:25] [INFO ] [Nat]Absence check using state equation in 11928 ms returned sat
[2020-05-27 23:04:26] [INFO ] [Nat]Added 605 Read/Feed constraints in 81 ms returned sat
[2020-05-27 23:04:26] [INFO ] Deduced a trap composed of 3 places in 22 ms
[2020-05-27 23:04:26] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-27 23:04:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2020-05-27 23:04:26] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 127 ms.
[2020-05-27 23:04:46] [INFO ] Added : 495 causal constraints over 99 iterations in 20197 ms.(timeout) Result :sat
[2020-05-27 23:04:46] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-27 23:04:47] [INFO ] Deduced a trap composed of 6 places in 52 ms
[2020-05-27 23:04:47] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-05-27 23:04:47] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2020-05-27 23:04:47] [INFO ] Deduced a trap composed of 6 places in 51 ms
[2020-05-27 23:04:47] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-05-27 23:04:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1422 ms
Attempting to minimize the solution found.
Minimization took 89 ms.
[2020-05-27 23:04:48] [INFO ] Flatten gal took : 463 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 23:04:49] [INFO ] Applying decomposition
[2020-05-27 23:04:49] [INFO ] Flatten gal took : 201 ms
[2020-05-27 23:04:49] [INFO ] Flatten gal took : 160 ms
[2020-05-27 23:04:49] [INFO ] Input system was already deterministic with 2125 transitions.
[2020-05-27 23:04:49] [INFO ] Too many transitions (2125) to apply POR reductions. Disabling POR matrices.
[2020-05-27 23:04:49] [INFO ] Input system was already deterministic with 2125 transitions.
[2020-05-27 23:04:49] [INFO ] Built C files in 478ms 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]
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/graph5685817389158641428.txt, -o, /tmp/graph5685817389158641428.bin, -w, /tmp/graph5685817389158641428.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph5685817389158641428.bin, -l, -1, -v, -w, /tmp/graph5685817389158641428.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 23:04:49] [INFO ] Decomposing Gal with order
[2020-05-27 23:04:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 23:04:50] [INFO ] Ran tautology test, simplified 0 / 4 in 956 ms.
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-00(UNSAT) depth K=0 took 32 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-04(UNSAT) depth K=0 took 1 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-05(UNSAT) depth K=0 took 0 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-14(UNSAT) depth K=0 took 10 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-00(UNSAT) depth K=1 took 9 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-04(UNSAT) depth K=1 took 12 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-05(UNSAT) depth K=1 took 7 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-14(UNSAT) depth K=1 took 18 ms
[2020-05-27 23:04:50] [INFO ] Removed a total of 1455 redundant transitions.
[2020-05-27 23:04:50] [INFO ] Flatten gal took : 295 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2125 rows 2532 cols
[2020-05-27 23:04:50] [INFO ] Computed 1101 place invariants in 17 ms
inv : p7275 + p7280 + p7281 = 1
inv : p5760 + p5765 = 1
inv : p5717 + p5722 = 1
inv : p61 + p2021 + p2026 = 1
inv : p7608 + p7613 = 1
inv : p61 + p1122 + p1125 + p1126 = 1
inv : p61 + p3029 + p3054 + p3059 + p3060 = 1
inv : p3740 + p3743 + p3744 = 1
inv : p4115 + p4117 = 1
inv : p7300 + p7305 = 1
inv : p4895 + p4900 + p4901 = 1
inv : p61 + p1728 + p1730 = 1
inv : p6274 + p6279 + p6280 = 1
inv : p4202 + p4207 + p4208 = 1
inv : p61 + p884 + p887 + p888 = 1
inv : p5409 + p5414 = 1
inv : p61 + p1584 + p1589 + p1590 = 1
inv : p7366 + p7369 + p7370 = 1
inv : p3807 + p3809 = 1
inv : p5126 + p5129 + p5130 = 1
inv : p6992 + p6997 = 1
inv : p61 + p2575 + p2577 = 1
inv : p61 + p3029 + p3099 + p3104 = 1
inv : p61 + p2893 + p2898 + p2899 = 1
inv : p4731 + p4733 = 1
inv : p61 + p94 + p95 + p205 + p210 + p211 = 1
inv : p6310 + p6314 = 1
inv : p7436 + p7439 + p7440 = 1
inv : p6365 + p6368 + p6369 = 1
inv : p4858 + p4863 = 1
inv : p4132 + p4137 + p4138 = 1
inv : p61 + p1112 + p1114 = 1
inv : p6652 + p6673 + p6676 + p6677 = 1
inv : p4272 + p4277 + p4278 = 1
inv : p61 + p1654 + p1659 + p1660 = 1
inv : p61 + p814 + p817 + p818 = 1
inv : p61 + p94 + p95 + p381 + p385 = 1
inv : p6204 + p6209 + p6210 = 1
inv : p5196 + p5199 + p5200 = 1
inv : p6398 + p6403 = 1
inv : p61 + p821 + p826 + p827 = 1
inv : p5826 + p5831 + p5832 = 1
inv : p61 + p1052 + p1055 + p1056 = 1
inv : p61 + p2406 + p2411 = 1
inv : p61 + p1020 + p1025 = 1
inv : p6197 + p6200 + p6201 = 1
inv : p3114 + p3116 = 1
inv : p4770 + p4774 = 1
inv : p5966 + p5971 + p5972 = 1
inv : p7118 + p7120 = 1
inv : p4825 + p4830 + p4831 = 1
inv : p7205 + p7210 + p7211 = 1
inv : p61 + p1745 + p1748 + p1749 = 1
inv : p61 + p94 + p95 + p345 + p350 + p351 = 1
inv : p6435 + p6438 + p6439 = 1
inv : p61 + p2655 + p2660 + p2661 = 1
inv : p61 + p2113 + p2115 = 1
inv : p61 + p1420 + p1422 = 1
inv : p3499 + p3501 = 1
inv : p7426 + p7428 = 1
inv : p5848 + p5852 = 1
inv : p3579 + p3584 + p3585 = 1
inv : p61 + p3029 + p3047 + p3050 + p3051 = 1
inv : p61 + p727 + p729 = 1
inv : p5886 + p5888 = 1
inv : p7781 + p7784 + p7785 + p7789 = 1
inv : p5434 + p5437 + p5438 = 1
inv : p5332 + p5337 = 1
inv : p4605 + p4610 = 1
inv : p7388 + p7392 = 1
inv : p6695 + p6699 = 1
inv : p6222 + p6227 = 1
inv : p3681 + p3686 = 1
inv : p5501 + p5503 = 1
inv : p61 + p2229 + p2233 = 1
inv : p61 + p1129 + p1134 + p1135 = 1
inv : p5749 + p5751 + p5754 + p5755 = 1
inv : p3747 + p3752 + p3753 = 1
inv : p61 + p2483 + p2488 = 1
inv : p3271 + p3276 + p3277 = 1
inv : p4748 + p4751 + p4752 = 1
inv : p4195 + p4198 + p4199 = 1
inv : p5504 + p5507 + p5508 = 1
inv : p61 + p2438 + p2440 + p2441 + p2442 = 1
inv : p6783 + p6788 = 1
inv : p5133 + p5138 + p5139 = 1
inv : p61 + p1910 + p1915 = 1
inv : p61 + p2200 + p2205 + p2206 = 1
inv : p6127 + p6130 + p6131 = 1
inv : p61 + p1969 + p1974 + p1975 = 1
inv : p61 + p2823 + p2828 + p2829 = 1
inv : p7696 + p7700 = 1
inv : p61 + p94 + p95 + p469 + p474 = 1
inv : p61 + p2834 + p2839 = 1
inv : p3330 + p3335 = 1
inv : p61 + p2886 + p2889 + p2890 = 1
inv : p61 + p94 + p95 + p198 + p201 + p202 = 1
inv : p4023 + p4028 = 1
inv : p4297 + p4302 = 1
inv : p5628 + p5633 = 1
inv : p61 + p601 + p606 = 1
inv : p61 + p1294 + p1299 = 1
inv : p3439 + p3444 + p3445 = 1
inv : p3817 + p3822 + p3823 = 1
inv : p4657 + p4662 + p4663 = 1
inv : p61 + p3029 + p3065 + p3070 = 1
inv : p61 + p2053 + p2056 + p2057 = 1
inv : p61 + p94 + p95 + p419 + p421 = 1
inv : p7334 + p7339 = 1
inv : p4363 + p4366 + p4367 = 1
inv : p3810 + p3813 + p3814 = 1
inv : p4385 + p4389 = 1
inv : p5936 + p5941 = 1
inv : p5794 + p5799 = 1
inv : p5056 + p5059 + p5060 = 1
inv : p5540 + p5544 = 1
inv : p61 + p2190 + p2192 = 1
inv : p61 + p2963 + p2968 + p2969 = 1
inv : p61 + p94 + p558 + p563 = 1
inv : p61 + p2942 + p2945 + p2950 = 1
inv : p61 + p2193 + p2196 + p2197 = 1
inv : p7476 + p7481 = 1
inv : p61 + p2361 + p2364 + p2365 = 1
inv : p61 + p961 + p966 + p967 = 1
inv : p7128 + p7131 + p7132 = 1
inv : p61 + p1507 + p1510 + p1511 = 1
inv : p7506 + p7509 + p7510 = 1
inv : p7754 + p7755 = 1
inv : p4888 + p4891 + p4892 = 1
inv : p61 + p943 + p948 = 1
inv : p6743 + p6746 + p6747 = 1
inv : p6068 + p6073 = 1
inv : p61 + p1514 + p1519 + p1520 = 1
inv : p61 + p2999 + p3003 = 1
inv : p61 + p2317 + p2322 = 1
inv : p61 + p1636 + p1641 = 1
inv : p61 + p1346 + p1351 + p1352 = 1
inv : p7135 + p7140 + p7141 = 1
inv : p61 + p2515 + p2520 + p2521 = 1
inv : p61 + p583 + p588 + p589 = 1
inv : p61 + p744 + p747 + p748 = 1
inv : p61 + p1885 + p1888 + p1889 = 1
inv : p7513 + p7518 + p7519 = 1
inv : p5280 + p5285 + p5286 = 1
inv : p5511 + p5516 + p5517 = 1
inv : p61 + p2746 + p2749 + p2750 = 1
inv : p3241 + p3246 = 1
inv : p3894 + p3899 + p3900 = 1
inv : p3432 + p3435 + p3436 = 1
inv : p61 + p2625 + p2630 = 1
inv : p7583 + p7588 + p7589 = 1
inv : p6512 + p6517 + p6518 = 1
inv : p5518 + p5523 + p5524 = 1
inv : p61 + p1430 + p1433 + p1434 = 1
inv : p6579 + p6581 = 1
inv : p61 + p2702 + p2707 = 1
inv : p61 + p1269 + p1274 + p1275 = 1
inv : p4547 + p4555 = 1
inv : p61 + p2711 + p2714 + p2717 + p2719 = 1
inv : p61 + p2277 + p2282 + p2283 = 1
inv : p3978 + p3981 + p3982 = 1
inv : p3538 + p3542 = 1
inv : p7744 + p7747 + p7748 = 1
inv : p61 + p94 + p95 + p250 + p255 = 1
inv : p6025 + p6030 = 1
inv : p5683 + p5688 = 1
inv : p61 + p1459 + p1463 = 1
inv : p7121 + p7124 + p7125 = 1
inv : p6904 + p6906 + p6907 + p6908 = 1
inv : p6915 + p6920 = 1
inv : p6872 + p6877 = 1
inv : p6348 + p6350 = 1
inv : p61 + p1998 + p2002 = 1
inv : p3857 + p3862 = 1
inv : p7245 + p7250 = 1
inv : p61 + p1206 + p1211 + p1212 = 1
inv : p6582 + p6585 + p6586 = 1
inv : p61 + p2267 + p2269 = 1
inv : p61 + p667 + p670 + p671 = 1
inv : p61 + p2130 + p2133 + p2134 = 1
inv : p6813 + p6816 + p6817 = 1
inv : p5819 + p5822 + p5823 = 1
inv : p5203 + p5208 + p5209 = 1
inv : p6820 + p6825 + p6826 = 1
inv : p61 + p689 + p693 = 1
inv : p7553 + p7558 = 1
inv : p61 + p1962 + p1967 + p1968 = 1
inv : p61 + p2075 + p2079 = 1
inv : p61 + p2537 + p2541 = 1
inv : p61 + p1547 + p1552 = 1
inv : p6589 + p6594 + p6595 = 1
inv : p3194 + p3199 + p3200 = 1
inv : p3124 + p3127 + p3128 = 1
inv : p61 + p576 + p581 + p582 = 1
inv : p3626 + p3631 = 1
inv : p7051 + p7054 + p7055 = 1
inv : p3769 + p3773 = 1
inv : p7058 + p7063 + p7064 = 1
inv : p61 + p94 + p95 + p128 + p131 + p132 = 1
inv : p7198 + p7201 + p7202 = 1
inv : p5453 + p5457 = 1
inv : p3131 + p3136 + p3137 = 1
inv : p61 + p1690 + p1694 = 1
inv : p4440 + p4445 + p4446 = 1
inv : p6733 + p6735 = 1
inv : p6949 + p6954 = 1
inv : p3337 + p3373 + p3378 = 1
inv : p5166 + p5171 = 1
inv : p3461 + p3465 = 1
inv : p61 + p2207 + p2212 + p2213 = 1
inv : p5364 + p5367 + p5368 = 1
inv : p4118 + p4121 + p4122 = 1
inv : p4055 + p4058 + p4059 = 1
inv : p4639 + p4644 = 1
inv : p5581 + p5584 + p5585 = 1
inv : p61 + p2922 + p2926 = 1
inv : p61 + p1855 + p1860 = 1
inv : p5588 + p5593 + p5594 = 1
inv : p5441 + p5446 + p5447 = 1
inv : p61 + p635 + p640 = 1
inv : p61 + p2578 + p2583 + p2584 = 1
inv : p6897 + p6902 + p6903 = 1
inv : p61 + p1822 + p1825 + p1826 = 1
inv : p7157 + p7161 = 1
inv : p4349 + p4354 + p4355 = 1
inv : p61 + p3029 + p3040 + p3043 + p3044 = 1
inv : p5375 + p5380 = 1
inv : p61 + p1371 + p1376 = 1
inv : p6117 + p6119 = 1
inv : p61 + p94 + p95 + p111 + p113 = 1
inv : p5042 + p5047 + p5048 = 1
inv : p61 + p1602 + p1607 = 1
inv : p61 + p653 + p658 + p659 = 1
inv : p3887 + p3890 + p3891 = 1
inv : p61 + p866 + p871 = 1
inv : p6505 + p6508 + p6509 = 1
inv : p4433 + p4436 + p4437 = 1
inv : p3153 + p3157 = 1
inv : p61 + p1577 + p1580 + p1581 = 1
inv : p5273 + p5276 + p5277 = 1
inv : p3946 + p3951 = 1
inv : p4990 + p4995 = 1
inv : p61 + p1944 + p1949 = 1
inv : p7734 + p7736 = 1
inv : p3502 + p3507 + p3508 = 1
inv : p5255 + p5260 = 1
inv : p61 + p2779 + p2784 = 1
inv : p6156 + p6160 = 1
inv : p4965 + p4970 + p4971 = 1
inv : p4462 + p4466 = 1
inv : p6175 + p6179 + p6184 = 1
inv : p3663 + p3666 + p3667 = 1
inv : p5078 + p5082 = 1
inv : p7443 + p7446 + p7447 = 1
inv : p61 + p94 + p95 + p161 + p166 = 1
inv : p7041 + p7043 = 1
inv : p7642 + p7647 = 1
inv : p6256 + p6261 = 1
inv : p4510 + p4513 + p4514 = 1
inv : p3296 + p3301 = 1
inv : p61 + p2864 + p2868 = 1
inv : p4693 + p4697 = 1
inv : p61 + p94 + p513 + p516 + p517 = 1
inv : p7069 + p7074 = 1
inv : p6487 + p6492 = 1
inv : p6194 + p6196 = 1
inv : p4517 + p4522 + p4523 = 1
inv : p61 + p777 + p782 = 1
inv : p7282 + p7287 + p7288 = 1
inv : p61 + p2449 + p2454 = 1
inv : p61 + p2163 + p2168 = 1
inv : p5116 + p5118 = 1
inv : p61 + p898 + p903 + p904 = 1
inv : p6890 + p6893 + p6894 = 1
inv : p61 + p1661 + p1666 + p1667 = 1
inv : p7660 + p7665 + p7666 = 1
inv : p3715 + p3720 = 1
inv : p61 + p94 + p95 + p359 + p362 + p363 = 1
inv : p6358 + p6361 + p6362 = 1
inv : p5119 + p5122 + p5123 = 1
inv : p4038 + p4040 = 1
inv : p5903 + p5908 + p5909 = 1
inv : p3884 + p3886 = 1
inv : p4286 + p4289 + p4290 = 1
inv : p6652 + p6680 + p6684 + p6689 = 1
inv : p61 + p1668 + p1671 + p1672 = 1
inv : p61 + p94 + p95 + p268 + p273 + p274 = 1
inv : p61 + p2006 + p2009 + p2012 + p2014 = 1
inv : p7377 + p7382 = 1
inv : p5991 + p5996 = 1
inv : p3733 + p3736 + p3737 = 1
inv : p3422 + p3424 = 1
inv : p7429 + p7432 + p7433 = 1
inv : p61 + p94 + p95 + p282 + p287 + p288 = 1
inv : p5980 + p5983 + p5984 = 1
inv : p61 + p804 + p806 = 1
inv : p61 + p1497 + p1499 = 1
inv : p4500 + p4502 = 1
inv : p4346 + p4348 = 1
inv : p61 + p958 + p960 = 1
inv : p5889 + p5894 + p5895 = 1
inv : p6050 + p6053 + p6054 = 1
inv : p61 + p2883 + p2885 = 1
inv : p3670 + p3675 + p3676 = 1
inv : p61 + p2394 + p2399 = 1
inv : p4818 + p4823 + p4824 = 1
inv : p4979 + p4982 + p4983 = 1
inv : p6838 + p6843 = 1
inv : p7531 + p7536 = 1
inv : p4902 + p4907 + p4908 = 1
inv : p3576 + p3578 = 1
inv : p6204 + p6207 + p6208 = 1
inv : p6475 + p6480 = 1
inv : p7352 + p7357 + p7358 = 1
inv : p61 + p961 + p964 + p965 = 1
inv : p61 + p94 + p95 + p429 + p432 + p433 = 1
inv : p4125 + p4130 + p4131 = 1
inv : p61 + p2526 + p2531 = 1
inv : p61 + p1507 + p1512 + p1513 = 1
inv : p5973 + p5978 + p5979 = 1
inv : p7195 + p7197 = 1
inv : p61 + p94 + p95 + p198 + p203 + p204 = 1
inv : p5819 + p5824 + p5825 = 1
inv : p61 + p2791 + p2796 = 1
inv : p4972 + p4977 + p4978 = 1
inv : p6288 + p6291 + p6292 = 1
inv : p61 + p2886 + p2891 + p2892 = 1
inv : p3278 + p3283 + p3284 = 1
inv : p4734 + p4739 + p4740 = 1
inv : p4209 + p4214 + p4215 = 1
inv : p5486 + p5491 = 1
inv : p7737 + p7739 + p7740 + p7741 = 1
inv : p61 + p2200 + p2203 + p2204 = 1
inv : p5001 + p5005 = 1
inv : p61 + p1959 + p1961 = 1
inv : p5735 + p5740 + p5741 = 1
inv : p61 + p1251 + p1256 = 1
inv : p61 + p94 + p95 + p188 + p190 = 1
inv : p4741 + p4744 + p4745 = 1
inv : p61 + p712 + p717 = 1
inv : p61 + p2669 + p2672 + p2673 = 1
inv : p61 + p737 + p740 + p741 = 1
inv : p6736 + p6739 + p6740 = 1
inv : p61 + p1731 + p1736 + p1737 = 1
inv : p61 + p2284 + p2287 + p2288 = 1
inv : p61 + p94 + p95 + p205 + p208 + p209 = 1
inv : p3337 + p3348 + p3351 + p3352 = 1
inv : p5221 + p5226 = 1
inv : p61 + p94 + p95 + p342 + p344 = 1
inv : p7128 + p7133 + p7134 = 1
inv : p4255 + p4259 = 1
inv : p61 + p1423 + p1428 + p1429 = 1
inv : p4716 + p4721 = 1
inv : p61 + p2306 + p2310 = 1
inv : p5809 + p5811 = 1
inv : p61 + p1514 + p1517 + p1518 = 1
inv : p7513 + p7516 + p7517 = 1
inv : p7619 + p7623 = 1
inv : p4363 + p4368 + p4369 = 1
inv : p61 + p1867 + p1872 = 1
inv : p5511 + p5514 + p5515 = 1
inv : p61 + p1808 + p1811 + p1812 = 1
inv : p6564 + p6569 = 1
inv : p7205 + p7208 + p7209 = 1
inv : p61 + p1162 + p1167 = 1
inv : p61 + p2592 + p2597 + p2598 = 1
inv : p3792 + p3797 = 1
inv : p4913 + p4918 = 1
inv : p6079 + p6083 = 1
inv : p7583 + p7586 + p7587 = 1
inv : p61 + p1584 + p1587 + p1588 = 1
inv : p61 + p2960 + p2962 = 1
inv : p7756 + p7757 = 1
inv : p61 + p2193 + p2198 + p2199 = 1
inv : p61 + p3010 + p3015 = 1
inv : p7289 + p7292 + p7293 = 1
inv : p7465 + p7469 = 1
inv : p61 + p2970 + p2975 + p2976 = 1
inv : p61 + p1679 + p1684 = 1
inv : p4279 + p4284 + p4285 = 1
inv : p4440 + p4443 + p4444 = 1
inv : p3824 + p3829 + p3830 = 1
inv : p5434 + p5439 + p5440 = 1
inv : p61 + p2354 + p2357 + p2358 = 1
inv : p61 + p1405 + p1410 = 1
inv : p61 + p2732 + p2737 + p2738 = 1
inv : p61 + p1778 + p1783 = 1
inv : p61 + p1035 + p1037 = 1
inv : p61 + p1052 + p1057 + p1058 = 1
inv : p5397 + p5402 = 1
inv : p4580 + p4585 + p4586 = 1
inv : p5320 + p5325 = 1
inv : p3219 + p3224 = 1
inv : p5672 + p5675 + p5676 = 1
inv : p6134 + p6136 + p6139 + p6140 = 1
inv : p6652 + p6673 + p6678 + p6679 = 1
inv : p61 + p1767 + p1771 = 1
inv : p61 + p2809 + p2812 + p2813 = 1
inv : p5383 + p5386 + p5390 + p5392 = 1
inv : p61 + p94 + p95 + p128 + p133 + p134 = 1
inv : p5826 + p5829 + p5830 = 1
inv : p61 + p1129 + p1132 + p1133 = 1
inv : p4664 + p4669 + p4670 = 1
inv : p6281 + p6286 + p6287 = 1
inv : p6442 + p6445 + p6446 = 1
inv : p6425 + p6427 = 1
inv : p7103 + p7108 = 1
inv : p6043 + p6048 + p6049 = 1
inv : p61 + p94 + p95 + p422 + p427 + p428 = 1
inv : p6967 + p6972 + p6973 = 1
inv : p61 + p2893 + p2896 + p2897 = 1
inv : p61 + p2614 + p2618 = 1
inv : p7003 + p7007 = 1
inv : p61 + p2218 + p2223 = 1
inv : p7707 + p7712 = 1
inv : p6127 + p6132 + p6133 = 1
inv : p61 + p576 + p579 + p580 = 1
inv : p61 + p1074 + p1078 = 1
inv : p3337 + p3384 + p3388 = 1
inv : p6750 + p6755 + p6756 = 1
inv : p61 + p2431 + p2434 + p2435 = 1
inv : p3208 + p3211 + p3212 = 1
inv : p4594 + p4597 + p4598 = 1
inv : p61 + p1276 + p1281 + p1282 = 1
inv : p5287 + p5292 + p5293 = 1
inv : p4627 + p4632 = 1
inv : p61 + p583 + p586 + p587 = 1
inv : p7660 + p7663 + p7664 = 1
inv : p61 + p1305 + p1309 = 1
inv : p5595 + p5598 + p5599 = 1
inv : p61 + p94 + p95 + p327 + p332 = 1
inv : p61 + p854 + p859 = 1
inv : p61 + p2053 + p2058 + p2059 = 1
inv : p61 + p2347 + p2352 + p2353 = 1
inv : p4808 + p4810 = 1
inv : p6974 + p6979 + p6980 = 1
inv : p61 + p94 + p95 + p100 + p102 = 1
inv : p5588 + p5591 + p5592 = 1
inv : p61 + p1437 + p1440 + p1441 = 1
inv : p7058 + p7061 + p7062 = 1
inv : p61 + p653 + p656 + p657 = 1
inv : p61 + p1962 + p1965 + p1966 = 1
inv : p4396 + p4401 = 1
inv : p7044 + p7049 + p7050 = 1
inv : p61 + p2739 + p2742 + p2743 = 1
inv : p5210 + p5215 + p5216 = 1
inv : p4077 + p4081 = 1
inv : p3901 + p3906 + p3907 = 1
inv : p7565 + p7570 = 1
inv : p3164 + p3169 = 1
inv : p4510 + p4515 + p4516 = 1
inv : p6582 + p6587 + p6588 = 1
inv : p61 + p94 + p513 + p518 + p519 = 1
inv : p6933 + p6937 + p6942 = 1
inv : p4517 + p4520 + p4521 = 1
inv : p3703 + p3708 = 1
inv : p4308 + p4312 = 1
inv : p6120 + p6125 + p6126 = 1
inv : p3978 + p3983 + p3984 = 1
inv : p61 + p1892 + p1895 + p1896 = 1
inv : p61 + p2344 + p2346 = 1
inv : p6827 + p6832 + p6833 = 1
inv : p61 + p2508 + p2513 + p2514 = 1
inv : p61 + p1353 + p1358 + p1359 = 1
inv : p7135 + p7138 + p7139 = 1
inv : p6333 + p6338 = 1
inv : p61 + p2816 + p2819 + p2820 = 1
inv : p61 + p997 + p1001 = 1
inv : p4587 + p4592 + p4593 = 1
inv : p6505 + p6510 + p6511 = 1
inv : p6926 + p6930 = 1
inv : p61 + p623 + p628 = 1
inv : p4165 + p4170 = 1
inv : p4539 + p4543 = 1
inv : p61 + p2270 + p2275 + p2276 = 1
inv : p3425 + p3428 + p3429 = 1
inv : p3934 + p3939 = 1
inv : p61 + p94 + p95 + p238 + p243 = 1
inv : p61 + p1217 + p1222 = 1
inv : p5665 + p5668 + p5669 = 1
inv : p5504 + p5509 + p5510 = 1
inv : p5039 + p5041 = 1
inv : p5518 + p5521 + p5522 = 1
inv : p3307 + p3311 = 1
inv : p5658 + p5663 + p5664 = 1
inv : p61 + p94 + p524 + p529 = 1
inv : p6299 + p6304 = 1
inv : p61 + p2585 + p2590 + p2591 = 1
inv : p61 + p1815 + p1818 + p1819 = 1
inv : p61 + p730 + p733 + p734 = 1
inv : p5578 + p5580 = 1
inv : p5742 + p5745 + p5746 = 1
inv : p4356 + p4361 + p4362 = 1
inv : p7657 + p7659 = 1
inv : p4055 + p4060 + p4061 = 1
inv : p5441 + p5444 + p5445 = 1
inv : p3989 + p3994 = 1
inv : p61 + p2036 + p2038 = 1
inv : p61 + p1122 + p1127 + p1128 = 1
inv : p7121 + p7126 + p7127 = 1
inv : p61 + p1283 + p1286 + p1287 = 1
inv : p3527 + p3532 = 1
inv : p4947 + p4952 = 1
inv : p61 + p2424 + p2429 + p2430 = 1
inv : p61 + p766 + p770 = 1
inv : p61 + p94 + p95 + p352 + p357 + p358 = 1
inv : p3472 + p3477 = 1
inv : p6530 + p6535 = 1
inv : p6244 + p6249 = 1
inv : p3579 + p3582 + p3583 = 1
inv : p3201 + p3206 + p3207 = 1
inv : p6512 + p6515 + p6516 = 1
inv : p6351 + p6356 + p6357 = 1
inv : p4671 + p4674 + p4675 = 1
inv : p3754 + p3758 = 1
inv : p5049 + p5054 + p5055 = 1
inv : p4682 + p4687 = 1
inv : p5581 + p5586 + p5587 = 1
inv : p61 + p94 + p95 + p436 + p439 + p440 = 1
inv : p7198 + p7203 + p7204 = 1
inv : p61 + p2207 + p2210 + p2211 = 1
inv : p61 + p909 + p914 = 1
inv : p3285 + p3288 + p3289 = 1
inv : p61 + p678 + p683 = 1
inv : p6589 + p6592 + p6593 = 1
inv : p61 + p94 + p95 + p150 + p154 = 1
inv : p6618 + p6622 = 1
inv : p5364 + p5369 + p5370 = 1
inv : p3846 + p3850 = 1
inv : p4451 + p4456 = 1
inv : p5089 + p5094 = 1
inv : p3502 + p3505 + p3506 = 1
inv : p61 + p2977 + p2980 + p2981 = 1
inv : p3615 + p3619 = 1
inv : p6387 + p6391 = 1
inv : p3253 + p3258 = 1
inv : p6981 + p6984 + p6985 = 1
inv : p61 + p94 + p95 + p293 + p298 = 1
inv : p61 + p1360 + p1363 + p1364 = 1
inv : p4433 + p4438 + p4439 = 1
inv : p3124 + p3129 + p3130 = 1
inv : p6428 + p6433 + p6434 = 1
inv : p61 + p2130 + p2135 + p2136 = 1
inv : p61 + p807 + p810 + p811 = 1
inv : p61 + p94 + p95 + p275 + p280 + p281 = 1
inv : p61 + p1738 + p1741 + p1742 = 1
inv : p7359 + p7362 + p7363 = 1
inv : p61 + p2662 + p2667 + p2668 = 1
inv : p61 + p1199 + p1204 + p1205 = 1
inv : p6057 + p6060 + p6061 = 1
inv : p5896 + p5901 + p5902 = 1
inv : p4220 + p4225 = 1
inv : p61 + p2252 + p2257 = 1
inv : p61 + p1577 + p1582 + p1583 = 1
inv : p3961 + p3963 = 1
inv : p61 + p1882 + p1884 = 1
inv : p7454 + p7459 = 1
inv : p61 + p898 + p901 + p902 = 1
inv : p4269 + p4271 = 1
inv : p6351 + p6354 + p6355 = 1
inv : p6043 + p6046 + p6047 = 1
inv : p6163 + p6167 = 1
inv : p61 + p573 + p575 = 1
inv : p4279 + p4282 + p4283 = 1
inv : p61 + p807 + p812 + p813 = 1
inv : p7289 + p7294 + p7295 = 1
inv : p61 + p1661 + p1664 + p1665 = 1
inv : p5914 + p5919 = 1
inv : p3593 + p3598 + p3599 = 1
inv : p7758 + p7767 = 1
inv : p61 + p3029 + p3040 + p3045 + p3046 = 1
inv : p61 + p737 + p742 + p743 = 1
inv : p61 + p2669 + p2674 + p2675 = 1
inv : p7352 + p7355 + p7356 = 1
inv : p5042 + p5045 + p5046 = 1
inv : p6464 + p6468 = 1
inv : p61 + p94 + p95 + p447 + p452 = 1
inv : p61 + p1045 + p1050 + p1051 = 1
inv : p61 + p2172 + p2175 + p2177 + p2180 = 1
inv : p61 + p1731 + p1734 + p1735 = 1
inv : p6288 + p6293 + p6294 = 1
inv : p6211 + p6213 + p6214 + p6215 = 1
inv : p7146 + p7151 = 1
inv : p4741 + p4746 + p4747 = 1
inv : p5563 + p5568 = 1
inv : p6281 + p6284 + p6285 = 1
inv : p61 + p968 + p971 + p972 = 1
inv : p61 + p2977 + p2982 + p2983 = 1
inv : p6652 + p6666 + p6671 + p6672 = 1
inv : p3656 + p3659 + p3660 = 1
inv : p6761 + p6766 = 1
inv : p61 + p94 + p95 + p282 + p285 + p286 = 1
inv : p6652 + p6659 + p6662 + p6663 = 1
inv : p4902 + p4905 + p4906 = 1
inv : p3337 + p3345 + p3347 = 1
inv : p4671 + p4676 + p4677 = 1
inv : p3561 + p3566 = 1
inv : p61 + p1482 + p1487 = 1
inv : p61 + p1500 + p1505 + p1506 = 1
inv : p61 + p94 + p95 + p422 + p425 + p426 = 1
inv : p61 + p755 + p760 = 1
inv : p7282 + p7285 + p7286 = 1
inv : p61 + p2603 + p2608 = 1
inv : p4577 + p4579 = 1
inv : p3869 + p3874 = 1
inv : p4349 + p4352 + p4353 = 1
inv : p5270 + p5272 = 1
inv : p5119 + p5124 + p5125 = 1
inv : p61 + p94 + p535 + p539 = 1
inv : p3824 + p3827 + p3828 = 1
inv : p3663 + p3668 + p3669 = 1
inv : p61 + p1790 + p1795 = 1
inv : p3142 + p3147 = 1
inv : p3835 + p3840 = 1
inv : p5098 + p5101 + p5106 = 1
inv : p61 + p1756 + p1761 = 1
inv : p61 + p94 + p95 + p139 + p144 = 1
inv : p5672 + p5677 + p5678 = 1
inv : p6050 + p6055 + p6056 = 1
inv : p61 + p2900 + p2903 + p2904 = 1
inv : p61 + p1430 + p1435 + p1436 = 1
inv : p61 + p1448 + p1453 = 1
inv : p7234 + p7238 = 1
inv : p61 + p2809 + p2814 + p2815 = 1
inv : p61 + p94 + p95 + p121 + p126 + p127 = 1
inv : p4485 + p4490 = 1
inv : p7674 + p7679 + p7680 = 1
inv : p5655 + p5657 = 1
inv : p3337 + p3355 + p3358 + p3359 = 1
inv : p6519 + p6522 + p6523 = 1
inv : p6358 + p6363 + p6364 = 1
inv : p6967 + p6970 + p6971 = 1
inv : p7580 + p7582 = 1
inv : p61 + p2277 + p2280 + p2281 = 1
inv : p5210 + p5213 + p5214 = 1
inv : p4793 + p4798 = 1
inv : p5903 + p5906 + p5907 = 1
inv : p4143 + p4148 = 1
inv : p61 + p2933 + p2938 = 1
inv : p61 + p94 + p95 + p429 + p434 + p435 = 1
inv : p3733 + p3738 + p3739 = 1
inv : p61 + p1206 + p1209 + p1210 = 1
inv : p3230 + p3234 = 1
inv : p61 + p94 + p95 + p315 + p320 = 1
inv : p61 + p1038 + p1041 + p1042 = 1
inv : p3894 + p3897 + p3898 = 1
inv : p61 + p2086 + p2091 = 1
inv : p61 + p1393 + p1398 = 1
inv : p4734 + p4737 + p4738 = 1
inv : p3131 + p3134 + p3135 = 1
inv : p7051 + p7056 + p7057 = 1
inv : p3780 + p3785 = 1
inv : p6964 + p6966 = 1
inv : p6552 + p6557 = 1
inv : p61 + p2806 + p2808 = 1
inv : p61 + p1174 + p1179 = 1
inv : p4118 + p4123 + p4124 = 1
inv : p3516 + p3519 + p3520 = 1
inv : p4811 + p4816 + p4817 = 1
inv : p5178 + p5183 = 1
inv : p4924 + p4928 = 1
inv : p61 + p3029 + p3037 + p3039 = 1
inv : p5012 + p5017 = 1
inv : p5427 + p5432 + p5433 = 1
inv : p61 + p1266 + p1268 = 1
inv : p61 + p94 + p95 + p227 + p231 = 1
inv : p6887 + p6889 = 1
inv : p7744 + p7749 + p7750 = 1
inv : p6827 + p6830 + p6831 = 1
inv : p4979 + p4984 + p4985 = 1
inv : p4286 + p4291 + p4292 = 1
inv : p61 + p3029 + p3076 + p3080 = 1
inv : p61 + p94 + p499 + p504 + p505 = 1
inv : p4972 + p4975 + p4976 = 1
inv : p61 + p1591 + p1594 + p1595 = 1
inv : p7212 + p7215 + p7216 = 1
inv : p3653 + p3655 = 1
inv : p61 + p1423 + p1426 + p1427 = 1
inv : p6040 + p6042 = 1
inv : p61 + p1969 + p1972 + p1973 = 1
inv : p7590 + p7593 + p7594 = 1
inv : p7429 + p7434 + p7435 = 1
inv : p61 + p1808 + p1813 + p1814 = 1
inv : p61 + p1536 + p1540 = 1
inv : p61 + p667 + p672 + p673 = 1
inv : p61 + p2592 + p2595 + p2596 = 1
inv : p61 + p843 + p847 = 1
inv : p61 + p660 + p663 + p664 = 1
inv : p61 + p2845 + p2849 = 1
inv : p61 + p590 + p593 + p594 = 1
inv : p61 + p1283 + p1288 + p1289 = 1
inv : p4962 + p4964 = 1
inv : p61 + p1976 + p1979 + p1980 = 1
inv : p61 + p94 + p506 + p511 + p512 = 1
inv : p6981 + p6986 + p6987 = 1
inv : p7667 + p7670 + p7671 = 1
inv : p61 + p94 + p95 + p481 + p486 = 1
inv : p61 + p1228 + p1232 = 1
inv : p61 + p2515 + p2518 + p2519 = 1
inv : p3201 + p3204 + p3205 = 1
inv : p61 + p1885 + p1890 + p1891 = 1
inv : p6743 + p6748 + p6749 = 1
inv : p3318 + p3323 = 1
inv : p4503 + p4508 + p4509 = 1
inv : p7091 + p7096 = 1
inv : p61 + p3022 + p3027 = 1
inv : p3337 + p3362 + p3367 + p3368 = 1
inv : p7014 + p7019 = 1
inv : p3439 + p3442 + p3443 = 1
inv : p61 + p2284 + p2289 + p2290 = 1
inv : p61 + p2424 + p2427 + p2428 = 1
inv : p61 + p2295 + p2300 = 1
inv : p61 + p2123 + p2128 + p2129 = 1
inv : p5529 + p5534 = 1
inv : p5309 + p5313 = 1
inv : p61 + p1353 + p1356 + p1357 = 1
inv : p5658 + p5661 + p5662 = 1
inv : p3692 + p3696 = 1
inv : p61 + p2438 + p2440 + p2443 + p2444 = 1
inv : p3923 + p3927 = 1
inv : p5350 + p5353 + p5354 = 1
inv : p4041 + p4044 + p4045 = 1
inv : p61 + p2471 + p2476 = 1
inv : p3278 + p3281 + p3282 = 1
inv : p3117 + p3122 + p3123 = 1
inv : p6596 + p6599 + p6600 = 1
inv : p4426 + p4431 + p4432 = 1
inv : p4587 + p4590 + p4591 = 1
inv : p5859 + p5864 = 1
inv : p61 + p1899 + p1902 + p1903 = 1
inv : p4231 + p4235 = 1
inv : p61 + p2823 + p2826 + p2827 = 1
inv : p3509 + p3512 + p3513 = 1
inv : p5617 + p5621 = 1
inv : p4664 + p4667 + p4668 = 1
inv : p61 + p2141 + p2146 = 1
inv : p61 + p1360 + p1365 + p1366 = 1
inv : p7180 + p7185 = 1
inv : p7506 + p7511 + p7512 = 1
inv : p61 + p2501 + p2506 + p2507 = 1
inv : p61 + p2739 + p2744 + p2745 = 1
inv : p61 + p1815 + p1820 + p1821 = 1
inv : p61 + p1624 + p1629 = 1
inv : p61 + p2585 + p2588 + p2589 = 1
inv : p5948 + p5953 = 1
inv : p7597 + p7600 + p7601 = 1
inv : p61 + p975 + p980 + p981 = 1
inv : p61 + p2732 + p2735 + p2736 = 1
inv : p6090 + p6095 = 1
inv : p61 + p2757 + p2762 = 1
inv : p4870 + p4875 = 1
inv : p7322 + p7327 = 1
inv : p5056 + p5061 + p5062 = 1
inv : p3176 + p3181 = 1
inv : p61 + p1316 + p1321 = 1
inv : p61 + p2354 + p2359 + p2360 = 1
inv : p61 + p2970 + p2973 + p2974 = 1
inv : p61 + p1085 + p1090 = 1
inv : p61 + p2347 + p2350 + p2351 = 1
inv : p61 + p1921 + p1925 = 1
inv : p4000 + p4004 = 1
inv : p5232 + p5236 = 1
inv : p6607 + p6612 = 1
inv : p6795 + p6800 = 1
inv : p7520 + p7523 + p7524 = 1
inv : p61 + p94 + p95 + p114 + p119 + p120 = 1
inv : p4048 + p4053 + p4054 = 1
inv : p4408 + p4413 = 1
inv : p3604 + p3609 = 1
inv : p61 + p2383 + p2387 = 1
inv : p4825 + p4828 + p4829 = 1
inv : p61 + p1738 + p1743 + p1744 = 1
inv : p6057 + p6062 + p6063 = 1
inv : p61 + p1833 + p1838 = 1
inv : p5896 + p5899 + p5900 = 1
inv : p4132 + p4135 + p4136 = 1
inv : p5144 + p5149 = 1
inv : p5665 + p5670 + p5671 = 1
inv : p6376 + p6381 = 1
inv : p5771 + p5775 = 1
inv : p61 + p2431 + p2436 + p2437 = 1
inv : p61 + p2560 + p2565 = 1
inv : p3586 + p3589 + p3590 = 1
inv : p7503 + p7505 = 1
inv : p5735 + p5738 + p5739 = 1
inv : p61 + p920 + p924 = 1
inv : p6706 + p6711 = 1
inv : p61 + p1136 + p1140 = 1
inv : p61 + p1192 + p1197 + p1198 = 1
inv : p61 + p94 + p95 + p436 + p441 + p442 = 1
inv : p61 + p2662 + p2665 + p2666 = 1
inv : p4177 + p4182 = 1
inv : p7359 + p7364 + p7365 = 1
inv : p4594 + p4599 + p4600 = 1
inv : p4209 + p4212 + p4213 = 1
inv : p3285 + p3290 + p3291 = 1
inv : p6974 + p6977 + p6978 = 1
inv : p6435 + p6440 + p6441 = 1
inv : p61 + p1713 + p1718 = 1
inv : p61 + p2116 + p2119 + p2120 = 1
inv : p4756 + p4759 + p4764 = 1
inv : p61 + p2680 + p2685 = 1
inv : p5357 + p5362 + p5363 = 1
inv : p3268 + p3270 = 1
inv : p3971 + p3976 + p3977 = 1
inv : p61 + p94 + p95 + p191 + p196 + p197 = 1
inv : p6629 + p6634 = 1
inv : p6197 + p6202 + p6203 = 1
inv : p7411 + p7416 = 1
inv : p3425 + p3430 + p3431 = 1
inv : p4847 + p4851 = 1
inv : p5742 + p5747 + p5748 = 1
inv : p5474 + p5479 = 1
inv : p6849 + p6853 = 1
inv : p61 + p1343 + p1345 = 1
inv : p3964 + p3967 + p3968 = 1
inv : p3484 + p3489 = 1
inv : p4088 + p4093 = 1
inv : p61 + p1115 + p1120 + p1121 = 1
inv : p4319 + p4324 = 1
inv : p5705 + p5710 = 1
inv : p5812 + p5817 + p5818 = 1
inv : p61 + p2039 + p2042 + p2043 = 1
inv : p7275 + p7278 + p7279 = 1
inv : p61 + p1004 + p1008 + p1013 + p1015 = 1
inv : p61 + p2046 + p2051 + p2052 = 1
inv : p61 + p94 + p95 + p392 + p397 = 1
inv : p7272 + p7274 = 1
inv : p3208 + p3213 + p3214 = 1
inv : p61 + p1276 + p1279 + p1280 = 1
inv : p61 + p730 + p735 + p736 = 1
inv : p5973 + p5976 + p5977 = 1
inv : p61 + p94 + p95 + p352 + p355 + p356 = 1
inv : p61 + p1574 + p1576 = 1
inv : p61 + p1654 + p1657 + p1658 = 1
inv : p61 + p94 + p95 + p359 + p364 + p365 = 1
inv : p5980 + p5985 + p5986 = 1
inv : p6002 + p6006 = 1
inv : p61 + p2652 + p2654 = 1
inv : p61 + p891 + p894 + p895 = 1
inv : p4888 + p4893 + p4894 = 1
inv : p5640 + p5645 = 1
inv : p61 + p2098 + p2103 = 1
inv : p61 + p3029 + p3047 + p3052 + p3053 = 1
inv : p7685 + p7690 = 1
inv : p4748 + p4753 + p4754 = 1
inv : p5837 + p5842 = 1
inv : p3730 + p3732 = 1
inv : p61 + p2240 + p2245 = 1
inv : p61 + p744 + p749 + p750 = 1
inv : p61 + p1805 + p1807 = 1
inv : p61 + p650 + p652 = 1
inv : p4192 + p4194 = 1
inv : p5347 + p5349 = 1
inv : p6233 + p6237 = 1
inv : p61 + p1038 + p1043 + p1044 = 1
inv : p61 + p1115 + p1118 + p1119 = 1
inv : p5193 + p5195 = 1
inv : p61 + p94 + p95 + p216 + p221 = 1
inv : p3586 + p3591 + p3592 = 1
inv : p7212 + p7217 + p7218 = 1
inv : p61 + p1651 + p1653 = 1
inv : p61 + p94 + p95 + p345 + p348 + p349 = 1
inv : p61 + p1591 + p1596 + p1597 = 1
inv : p6772 + p6776 = 1
inv : p3747 + p3750 + p3751 = 1
inv : p6652 + p6659 + p6664 + p6665 = 1
inv : p61 + p986 + p991 = 1
inv : p6428 + p6431 + p6432 = 1
inv : p4272 + p4275 + p4276 = 1
inv : p4195 + p4200 + p4201 = 1
inv : p4356 + p4359 + p4360 = 1
inv : p61 + p832 + p837 = 1
inv : p5966 + p5969 + p5970 = 1
inv : p61 + p94 + p95 + p304 + p308 = 1
inv : p4374 + p4379 = 1
inv : p5049 + p5052 + p5053 = 1
inv : p61 + p1559 + p1564 = 1
inv : p61 + p821 + p824 + p825 = 1
inv : p5551 + p5556 = 1
inv : p61 + p2988 + p2993 = 1
inv : p61 + p2729 + p2731 = 1
inv : p6211 + p6213 + p6216 + p6217 = 1
inv : p61 + p94 + p95 + p275 + p278 + p279 = 1
inv : p61 + p94 + p95 + p370 + p375 = 1
inv : p61 + p1199 + p1202 + p1203 = 1
inv : p5133 + p5136 + p5137 = 1
inv : p61 + p2498 + p2500 = 1
inv : p4965 + p4968 + p4969 = 1
inv : p61 + p1987 + p1992 = 1
inv : p4202 + p4205 + p4206 = 1
inv : p6541 + p6545 = 1
inv : p4066 + p4071 = 1
inv : p7223 + p7228 = 1
inv : p3516 + p3521 + p3522 = 1
inv : p61 + p1189 + p1191 = 1
inv : p3593 + p3596 + p3597 = 1
inv : p4100 + p4105 = 1
inv : p4935 + p4940 = 1
inv : p6652 + p6656 + p6658 = 1
inv : p5424 + p5426 = 1
inv : p61 + p1525 + p1530 = 1
inv : p3450 + p3455 = 1
inv : p61 + p94 + p499 + p502 + p503 = 1
inv : p6365 + p6370 + p6371 = 1
inv : p6453 + p6458 = 1
inv : p4041 + p4046 + p4047 = 1
inv : p61 + p3029 + p3087 + p3092 = 1
inv : p3740 + p3745 + p3746 = 1
inv : p61 + p1437 + p1442 + p1443 = 1
inv : p5024 + p5029 = 1
inv : p7436 + p7441 + p7442 = 1
inv : p3912 + p3917 = 1
inv : p61 + p1063 + p1068 = 1
inv : p5925 + p5929 = 1
inv : p6750 + p6753 + p6754 = 1
inv : p3337 + p3395 + p3400 = 1
inv : p61 + p660 + p665 + p666 = 1
inv : p5595 + p5600 + p5601 = 1
inv : p5287 + p5290 + p5291 = 1
inv : p6410 + p6415 = 1
inv : p61 + p590 + p595 + p596 = 1
inv : p61 + p968 + p973 + p974 = 1
inv : p5732 + p5734 = 1
inv : p61 + p2329 + p2334 = 1
inv : p61 + p884 + p889 + p890 = 1
inv : p61 + p1500 + p1503 + p1504 = 1
inv : p61 + p94 + p546 + p551 = 1
inv : p3638 + p3643 = 1
inv : p61 + p2270 + p2273 + p2274 = 1
inv : p5203 + p5206 + p5207 = 1
inv : p4811 + p4814 + p4815 = 1
inv : p5126 + p5131 + p5132 = 1
inv : p4895 + p4898 + p4899 = 1
inv : p7349 + p7351 = 1
inv : p61 + p2963 + p2966 + p2967 = 1
inv : p3337 + p3403 + p3407 + p3412 = 1
inv : p61 + p94 + p95 + p458 + p462 = 1
inv : p3191 + p3193 = 1
inv : p4528 + p4533 = 1
inv : p7044 + p7047 + p7048 = 1
inv : p61 + p1045 + p1048 + p1049 = 1
inv : p4154 + p4158 = 1
inv : p5427 + p5430 + p5431 = 1
inv : p61 + p2421 + p2423 = 1
inv : p4781 + p4786 = 1
inv : p3549 + p3554 = 1
inv : p4657 + p4660 + p4661 = 1
inv : p3817 + p3820 + p3821 = 1
inv : p4011 + p4016 = 1
inv : p4616 + p4620 = 1
inv : p61 + p612 + p616 = 1
inv : p61 + p3029 + p3054 + p3057 + p3058 = 1
inv : p3901 + p3904 + p3905 = 1
inv : p6652 + p6666 + p6669 + p6670 = 1
inv : p3656 + p3661 + p3662 = 1
inv : p61 + p94 + p95 + p121 + p124 + p125 = 1
inv : p61 + p2900 + p2905 + p2906 = 1
inv : p6120 + p6123 + p6124 = 1
inv : p6274 + p6277 + p6278 = 1
inv : p5749 + p5751 + p5752 + p5753 = 1
inv : p61 + p2816 + p2821 + p2822 = 1
inv : p6321 + p6326 = 1
inv : p7674 + p7677 + p7678 = 1
inv : p7597 + p7602 + p7603 = 1
inv : p61 + p2508 + p2511 + p2512 = 1
inv : p61 + p1892 + p1897 + p1898 = 1
inv : p7796 + p7801 = 1
inv : p61 + p1976 + p1981 + p1982 = 1
inv : p4885 + p4887 = 1
inv : p61 + p1151 + p1155 = 1
inv : p61 + p2768 + p2772 = 1
inv : p6502 + p6504 = 1
inv : p3337 + p3355 + p3360 + p3361 = 1
inv : p6718 + p6723 = 1
inv : p61 + p2116 + p2121 + p2122 = 1
inv : p4580 + p4583 + p4584 = 1
inv : p3887 + p3892 + p3893 = 1
inv : p61 + p1382 + p1386 = 1
inv : p61 + p94 + p95 + p404 + p409 = 1
inv : p61 + p931 + p936 = 1
inv : p7520 + p7525 + p7526 = 1
inv : p61 + p1822 + p1827 + p1828 = 1
inv : p61 + p94 + p496 + p498 = 1
inv : p4242 + p4247 = 1
inv : p61 + p1613 + p1617 = 1
inv : p7399 + p7404 = 1
inv : p61 + p94 + p95 + p114 + p117 + p118 = 1
inv : p6736 + p6741 + p6742 = 1
inv : p61 + p1899 + p1904 + p1905 = 1
inv : p6897 + p6900 + p6901 = 1
inv : p61 + p2578 + p2581 + p2582 = 1
inv : p7590 + p7595 + p7596 = 1
inv : p61 + p2152 + p2156 = 1
inv : p5155 + p5159 = 1
inv : p61 + p2039 + p2044 + p2045 = 1
inv : p3964 + p3969 + p3970 = 1
inv : p3337 + p3348 + p3353 + p3354 = 1
inv : p5273 + p5278 + p5279 = 1
inv : p61 + p2361 + p2366 + p2367 = 1
inv : p7630 + p7635 = 1
inv : p6519 + p6524 + p6525 = 1
inv : p3194 + p3197 + p3198 = 1
inv : p61 + p700 + p705 = 1
inv : p6134 + p6136 + p6137 + p6138 = 1
inv : p6013 + p6018 = 1
inv : p5812 + p5815 + p5816 = 1
inv : p6442 + p6447 + p6448 = 1
inv : p7257 + p7262 = 1
inv : p5350 + p5355 + p5356 = 1
inv : p61 + p2460 + p2464 = 1
inv : p7719 + p7724 = 1
inv : p3271 + p3274 + p3275 = 1
inv : p61 + p2501 + p2504 + p2505 = 1
inv : p6820 + p6823 + p6824 = 1
inv : p61 + p1346 + p1349 + p1350 = 1
inv : p5694 + p5698 = 1
inv : p61 + p94 + p95 + p191 + p194 + p195 = 1
inv : p6145 + p6150 = 1
inv : p6641 + p6646 = 1
inv : p4818 + p4821 + p4822 = 1
inv : p3432 + p3437 + p3438 = 1
inv : p61 + p94 + p95 + p173 + p178 = 1
inv : p4473 + p4478 = 1
inv : p61 + p2856 + p2861 = 1
inv : p4836 + p4841 = 1
inv : p6271 + p6273 = 1
inv : p5280 + p5283 + p5284 = 1
inv : p5067 + p5072 = 1
inv : p61 + p2372 + p2377 = 1
inv : p3971 + p3974 + p3975 = 1
inv : p3810 + p3815 + p3816 = 1
inv : p5782 + p5787 = 1
inv : p4704 + p4709 = 1
inv : p7488 + p7493 = 1
inv : p5298 + p5303 = 1
inv : p61 + p1269 + p1272 + p1273 = 1
inv : p5889 + p5892 + p5893 = 1
inv : p61 + p94 + p95 + p265 + p267 = 1
inv : p7311 + p7315 = 1
inv : p7080 + p7084 = 1
inv : p6860 + p6865 = 1
inv : p6890 + p6895 + p6896 = 1
inv : p6904 + p6906 + p6909 + p6910 = 1
inv : p61 + p2046 + p2049 + p2050 = 1
inv : p61 + p2637 + p2642 = 1
inv : p61 + p891 + p896 + p897 = 1
inv : p61 + p2911 + p2916 = 1
inv : p4331 + p4336 = 1
inv : p61 + p789 + p794 = 1
inv : p4125 + p4128 + p4129 = 1
inv : p61 + p2746 + p2751 + p2752 = 1
inv : p3337 + p3362 + p3365 + p3366 = 1
inv : p6810 + p6812 = 1
inv : p61 + p1668 + p1673 + p1674 = 1
inv : p7667 + p7672 + p7673 = 1
inv : p61 + p1239 + p1244 = 1
inv : p7443 + p7448 + p7449 = 1
inv : p5963 + p5965 = 1
inv : p7026 + p7031 = 1
inv : p4503 + p4506 + p4507 = 1
inv : p4562 + p4567 = 1
inv : p5463 + p5467 = 1
inv : p61 + p2691 + p2695 = 1
inv : p61 + p94 + p506 + p509 + p510 = 1
inv : p61 + p1192 + p1195 + p1196 = 1
inv : p61 + p1328 + p1333 = 1
inv : p6596 + p6601 + p6602 = 1
inv : p61 + p1701 + p1706 = 1
inv : p61 + p2064 + p2069 = 1
inv : p61 + p2123 + p2126 + p2127 = 1
inv : p61 + p1932 + p1937 = 1
inv : p5196 + p5201 + p5202 = 1
inv : p61 + p1097 + p1102 = 1
inv : p61 + p1844 + p1848 = 1
inv : p5872 + p5876 = 1
inv : p7737 + p7739 + p7742 + p7743 = 1
inv : p4654 + p4656 = 1
inv : p3670 + p3673 + p3674 = 1
inv : p5243 + p5248 = 1
inv : p3509 + p3514 + p3515 = 1
inv : p5357 + p5360 + p5361 = 1
inv : p61 + p94 + p95 + p268 + p271 + p272 = 1
inv : p61 + p1745 + p1750 + p1751 = 1
inv : p7366 + p7371 + p7372 = 1
inv : p61 + p2655 + p2658 + p2659 = 1
inv : p3117 + p3120 + p3121 = 1
inv : p61 + p814 + p819 + p820 = 1
inv : p4426 + p4429 + p4430 = 1
inv : p7773 + p7777 = 1
inv : p4048 + p4051 + p4052 = 1
inv : p6102 + p6107 = 1
inv : p61 + p881 + p883 = 1
inv : p7542 + p7546 = 1
inv : p7168 + p7173 = 1
inv : p61 + p1470 + p1475 = 1
inv : p61 + p2548 + p2553 = 1
inv : p6813 + p6818 + p6819 = 1
inv : p5606 + p5611 = 1
inv : p4423 + p4425 = 1
inv : p61 + p975 + p978 + p979 = 1
Total of 1101 invariants.
[2020-05-27 23:04:50] [INFO ] Computed 1101 place invariants in 38 ms
[2020-05-27 23:04:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 592 labels/synchronizations in 157 ms.
[2020-05-27 23:04:51] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 61 ms
[2020-05-27 23:04:51] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldPPPt-PT-100B-ReachabilityFireability-00 with value :(i12.u370.p2942==1)
Read [invariant] property : ShieldPPPt-PT-100B-ReachabilityFireability-04 with value :((i10.u306.p2440!=1)||((i25.u785.p6137==1)&&(i25.u789.p6184==1)))
Read [reachable] property : ShieldPPPt-PT-100B-ReachabilityFireability-05 with value :((((((i22.i1.i0.i2.u687.p5392!=1)&&((i4.u119.p1015==1)||((i10.u282.p2274==1)&&(i10.u283.p2276==1))))&&((i26.u795.p6213==1)||(i8.u249.p2012==1)))&&(((i14.i0.i1.i1.u430.p3403==1)||(i13.u381.p3029==1))||(i21.u648.p5098!=1)))&&((((i29.i1.i0.i1.u887.p6909==1)&&(i29.i1.i0.i1.u889.p6942==1))&&(i24.u735.p5751==1))||((i20.u606.p4756==1)&&(i28.u858.p6680==1))))&&((i1.u51.p95==1)||(i33.u999.p7785==1)))
Read [invariant] property : ShieldPPPt-PT-100B-ReachabilityFireability-14 with value :(((i9.u270.p2177==1)||(i11.u340.p2717!=1))||((i33.u992.p7740==1)&&(i33.u997.p7767==1)))
built 34 ordering constraints for composite.
built 59 ordering constraints for composite.
built 78 ordering constraints for composite.
built 38 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 3 ordering constraints for composite.
built 42 ordering constraints for composite.
built 31 ordering constraints for composite.
built 56 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 40 ordering constraints for composite.
built 48 ordering constraints for composite.
built 32 ordering constraints for composite.
built 55 ordering constraints for composite.
built 25 ordering constraints for composite.
built 63 ordering constraints for composite.
built 59 ordering constraints for composite.
built 56 ordering constraints for composite.
built 42 ordering constraints for composite.
built 59 ordering constraints for composite.
built 59 ordering constraints for composite.
built 59 ordering constraints for composite.
built 59 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 37 ordering constraints for composite.
built 37 ordering constraints for composite.
built 38 ordering constraints for composite.
built 27 ordering constraints for composite.
built 37 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 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 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 38 ordering constraints for composite.
built 38 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 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 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 38 ordering constraints for composite.
built 28 ordering constraints for composite.
built 38 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
[2020-05-27 23:04:54] [INFO ] Proved 2532 variables to be positive in 3274 ms
[2020-05-27 23:04:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-00
[2020-05-27 23:04:54] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-00(SAT) depth K=0 took 306 ms
[2020-05-27 23:04:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-04
[2020-05-27 23:04:54] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-04(SAT) depth K=0 took 226 ms
[2020-05-27 23:04:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-05
[2020-05-27 23:04:54] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-05(SAT) depth K=0 took 223 ms
[2020-05-27 23:04:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-14
[2020-05-27 23:04:55] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-14(SAT) depth K=0 took 239 ms
[2020-05-27 23:04:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-00
[2020-05-27 23:04:56] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-00(SAT) depth K=1 took 912 ms
[2020-05-27 23:04:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-04
[2020-05-27 23:04:56] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-04(SAT) depth K=1 took 722 ms
SDD proceeding with computation, new max is 32768
[2020-05-27 23:04:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-05
[2020-05-27 23:04:57] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-05(SAT) depth K=1 took 766 ms
[2020-05-27 23:04:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityFireability-14
[2020-05-27 23:04:58] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityFireability-14(SAT) depth K=1 took 664 ms
SDD proceeding with computation, new max is 65536
Compilation finished in 24200 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 69 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPtPT100BReachabilityFireability00==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPtPT100BReachabilityFireability00==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPtPT100BReachabilityFireability00==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 23:05:16] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-00(UNSAT) depth K=2 took 26336 ms
SDD proceeding with computation, new max is 131072
[2020-05-27 23:05:54] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-04(UNSAT) depth K=2 took 37422 ms
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-05 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 262144
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-14 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-04 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-00 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-00 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 262145 fixpoint passes
[2020-05-27 23:07:39] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityFireability-05(UNSAT) depth K=2 took 105566 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,4.79432e+300,171.355,3589992,27444,116,6.08183e+06,872,1906,1.7621e+07,99,3939,0
Total reachable state count : 4.794321746552144385047484322903371825981e+300
Verifying 4 reachability properties.
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-00 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
ShieldPPPt-PT-100B-ReachabilityFireability-00,5.19471e+296,172.653,3589992,21691,108,6.08183e+06,872,1691,1.7621e+07,88,3939,0
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-04 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-100B-ReachabilityFireability-04,8.25343e+299,172.745,3589992,21107,108,6.08183e+06,872,1706,1.7621e+07,94,3939,314
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-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
ShieldPPPt-PT-100B-ReachabilityFireability-05,7.63343e+273,172.794,3589992,11044,79,6.08183e+06,872,1784,1.7621e+07,97,3939,4844
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-14 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-100B-ReachabilityFireability-14,7.48534e+299,172.882,3589992,22061,110,6.08183e+06,872,1800,1.7621e+07,99,3939,5833
[2020-05-27 23:07:44] [WARNING] Interrupting SMT solver.
[2020-05-27 23:07:44] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
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-27 23:07:44] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldPPPt-PT-100B-ReachabilityFireability-00 K-induction depth 2
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an error :unknown
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 error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
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-27 23:07:44] [INFO ] SMT solved 0/ 4 properties. Interrupting SMT analysis.
BK_STOP 1590620864926
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033476200743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;