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.r211-tajo-159033477900743.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 itslola
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 r211-tajo-159033477900743
=====================================================================

--------------------
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 1591325249127

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:47:30] [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, -timeout, 3600, -rebuildPNML]
[2020-06-05 02:47:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:47:30] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2020-06-05 02:47:31] [INFO ] Transformed 7803 places.
[2020-06-05 02:47:31] [INFO ] Transformed 7103 transitions.
[2020-06-05 02:47:31] [INFO ] Found NUPN structural information;
[2020-06-05 02:47:31] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 583 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 279 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 177 ms. (steps per millisecond=56 ) 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 24 ms. (steps per millisecond=416 ) 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 35 ms. (steps per millisecond=285 ) 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 34 ms. (steps per millisecond=294 ) 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 40 ms. (steps per millisecond=250 ) 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 36 ms. (steps per millisecond=277 ) 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]
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 18 ms. (steps per millisecond=555 ) 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 25 ms. (steps per millisecond=400 ) 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 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7103 rows 7803 cols
[2020-06-05 02:47:32] [INFO ] Computed 1101 place invariants in 176 ms
[2020-06-05 02:47:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 4075 ms returned sat
[2020-06-05 02:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:37] [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: Stream closed (>= t63 0)") while checking expression at index 0
[2020-06-05 02:47:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:47:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 4065 ms returned (error "Failed to check-sat")
[2020-06-05 02:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:42] [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-06-05 02:47:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 3862 ms returned sat
[2020-06-05 02:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:47] [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-06-05 02:47:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:47:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 3975 ms returned (error "Failed to check-sat")
[2020-06-05 02:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:52] [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-06-05 02:47:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:47:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 3995 ms returned (error "Failed to check-sat")
[2020-06-05 02:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:57] [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-06-05 02:48:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:48:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 3904 ms returned (error "Failed to check-sat")
[2020-06-05 02:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:02] [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-06-05 02:48:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:48:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 3938 ms returned (error "Failed to check-sat")
[2020-06-05 02:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:07] [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-06-05 02:48:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 3922 ms returned sat
[2020-06-05 02:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:12] [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 (>= t555 0)") while checking expression at index 7
[2020-06-05 02:48:17] [INFO ] [Real]Absence check using 1101 positive place invariants in 3779 ms returned sat
[2020-06-05 02:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:17] [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: Broken pipe") while checking expression at index 8
[2020-06-05 02:48:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 3971 ms returned sat
[2020-06-05 02:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:22] [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: Broken pipe") while checking expression at index 9
[2020-06-05 02:48:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 3960 ms returned sat
[2020-06-05 02:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:27] [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 (>= t155 0)") 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 28 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 58 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 26 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 13 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 12 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 10 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 7 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 3964 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 13711 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 516506 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 486803 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 525309 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 464097 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 640831 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 528212 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 521148 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 514722 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 497933 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2173 rows 2588 cols
[2020-06-05 02:49:30] [INFO ] Computed 1101 place invariants in 10 ms
[2020-06-05 02:49:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 1311 ms returned sat
[2020-06-05 02:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:49:42] [INFO ] [Real]Absence check using state equation in 10742 ms returned sat
[2020-06-05 02:49:42] [INFO ] State equation strengthened by 271 read => feed constraints.
[2020-06-05 02:49:42] [INFO ] [Real]Added 271 Read/Feed constraints in 63 ms returned sat
[2020-06-05 02:49:44] [INFO ] Deduced a trap composed of 3 places in 1165 ms
[2020-06-05 02:49:45] [INFO ] Deduced a trap composed of 6 places in 1099 ms
[2020-06-05 02:49:46] [INFO ] Deduced a trap composed of 5 places in 890 ms
[2020-06-05 02:49:47] [INFO ] Deduced a trap composed of 3 places in 895 ms
[2020-06-05 02:49:48] [INFO ] Deduced a trap composed of 6 places in 1032 ms
[2020-06-05 02:49:49] [INFO ] Deduced a trap composed of 6 places in 884 ms
[2020-06-05 02:49:50] [INFO ] Deduced a trap composed of 7 places in 929 ms
[2020-06-05 02:49:51] [INFO ] Deduced a trap composed of 5 places in 892 ms
[2020-06-05 02:49:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8577 ms
[2020-06-05 02:49:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:49:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1159 ms returned sat
[2020-06-05 02:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:50:03] [INFO ] [Nat]Absence check using state equation in 10829 ms returned sat
[2020-06-05 02:50:04] [INFO ] [Nat]Added 271 Read/Feed constraints in 130 ms returned sat
[2020-06-05 02:50:04] [INFO ] Deduced a trap composed of 6 places in 323 ms
[2020-06-05 02:50:04] [INFO ] Deduced a trap composed of 5 places in 326 ms
[2020-06-05 02:50:05] [INFO ] Deduced a trap composed of 8 places in 357 ms
[2020-06-05 02:50:05] [INFO ] Deduced a trap composed of 5 places in 436 ms
[2020-06-05 02:50:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1926 ms
[2020-06-05 02:50:06] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 183 ms.
[2020-06-05 02:50:26] [INFO ] Added : 475 causal constraints over 95 iterations in 20179 ms.(timeout) Result :sat
[2020-06-05 02:50:26] [INFO ] Deduced a trap composed of 6 places in 340 ms
[2020-06-05 02:50:27] [INFO ] Deduced a trap composed of 6 places in 329 ms
[2020-06-05 02:50:27] [INFO ] Deduced a trap composed of 5 places in 326 ms
[2020-06-05 02:50:28] [INFO ] Deduced a trap composed of 6 places in 317 ms
[2020-06-05 02:50:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2080 ms
Attempting to minimize the solution found.
Minimization took 84 ms.
[2020-06-05 02:50:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 1267 ms returned sat
[2020-06-05 02:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:50:41] [INFO ] [Real]Absence check using state equation in 11036 ms returned sat
[2020-06-05 02:50:41] [INFO ] [Real]Added 271 Read/Feed constraints in 57 ms returned sat
[2020-06-05 02:50:42] [INFO ] Deduced a trap composed of 4 places in 1094 ms
[2020-06-05 02:50:43] [INFO ] Deduced a trap composed of 4 places in 996 ms
[2020-06-05 02:50:44] [INFO ] Deduced a trap composed of 5 places in 994 ms
[2020-06-05 02:50:45] [INFO ] Deduced a trap composed of 6 places in 977 ms
[2020-06-05 02:50:47] [INFO ] Deduced a trap composed of 6 places in 955 ms
[2020-06-05 02:50:48] [INFO ] Deduced a trap composed of 6 places in 928 ms
[2020-06-05 02:50:49] [INFO ] Deduced a trap composed of 6 places in 953 ms
[2020-06-05 02:50:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7770 ms
[2020-06-05 02:50:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:50:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1222 ms returned sat
[2020-06-05 02:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:51:02] [INFO ] [Nat]Absence check using state equation in 11623 ms returned sat
[2020-06-05 02:51:02] [INFO ] [Nat]Added 271 Read/Feed constraints in 112 ms returned sat
[2020-06-05 02:51:03] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-06-05 02:51:03] [INFO ] Deduced a trap composed of 3 places in 288 ms
[2020-06-05 02:51:03] [INFO ] Deduced a trap composed of 5 places in 273 ms
[2020-06-05 02:51:04] [INFO ] Deduced a trap composed of 5 places in 266 ms
[2020-06-05 02:51:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1691 ms
[2020-06-05 02:51:04] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 163 ms.
[2020-06-05 02:51:24] [INFO ] Added : 485 causal constraints over 97 iterations in 20367 ms.(timeout) Result :sat
[2020-06-05 02:51:25] [INFO ] Deduced a trap composed of 5 places in 323 ms
[2020-06-05 02:51:25] [INFO ] Deduced a trap composed of 7 places in 286 ms
[2020-06-05 02:51:26] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2020-06-05 02:51:26] [INFO ] Deduced a trap composed of 5 places in 285 ms
[2020-06-05 02:51:26] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-06-05 02:51:27] [INFO ] Deduced a trap composed of 5 places in 296 ms
[2020-06-05 02:51:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2840 ms
Attempting to minimize the solution found.
Minimization took 85 ms.
[2020-06-05 02:51:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 1239 ms returned sat
[2020-06-05 02:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:51:41] [INFO ] [Real]Absence check using state equation in 12135 ms returned sat
[2020-06-05 02:51:41] [INFO ] [Real]Added 271 Read/Feed constraints in 56 ms returned sat
[2020-06-05 02:51:42] [INFO ] Deduced a trap composed of 5 places in 501 ms
[2020-06-05 02:51:42] [INFO ] Deduced a trap composed of 6 places in 554 ms
[2020-06-05 02:51:43] [INFO ] Deduced a trap composed of 8 places in 508 ms
[2020-06-05 02:51:44] [INFO ] Deduced a trap composed of 5 places in 509 ms
[2020-06-05 02:51:44] [INFO ] Deduced a trap composed of 10 places in 547 ms
[2020-06-05 02:51:45] [INFO ] Deduced a trap composed of 8 places in 505 ms
[2020-06-05 02:51:45] [INFO ] Deduced a trap composed of 10 places in 493 ms
[2020-06-05 02:51:46] [INFO ] Deduced a trap composed of 11 places in 469 ms
[2020-06-05 02:51:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4977 ms
[2020-06-05 02:51:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:51:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1205 ms returned sat
[2020-06-05 02:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:52:03] [INFO ] [Nat]Absence check using state equation in 14960 ms returned sat
[2020-06-05 02:52:03] [INFO ] [Nat]Added 271 Read/Feed constraints in 184 ms returned sat
[2020-06-05 02:52:03] [INFO ] Deduced a trap composed of 6 places in 262 ms
[2020-06-05 02:52:04] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-06-05 02:52:04] [INFO ] Deduced a trap composed of 8 places in 248 ms
[2020-06-05 02:52:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1216 ms
[2020-06-05 02:52:04] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 157 ms.
[2020-06-05 02:52:24] [INFO ] Added : 500 causal constraints over 100 iterations in 20192 ms.(timeout) Result :sat
[2020-06-05 02:52:25] [INFO ] Deduced a trap composed of 7 places in 277 ms
[2020-06-05 02:52:25] [INFO ] Deduced a trap composed of 5 places in 273 ms
[2020-06-05 02:52:26] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2020-06-05 02:52:26] [INFO ] Deduced a trap composed of 7 places in 258 ms
[2020-06-05 02:52:27] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-06-05 02:52:27] [INFO ] Deduced a trap composed of 5 places in 260 ms
[2020-06-05 02:52:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3030 ms
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-06-05 02:52:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 1332 ms returned sat
[2020-06-05 02:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:52:42] [INFO ] [Real]Absence check using state equation in 12647 ms returned sat
[2020-06-05 02:52:42] [INFO ] [Real]Added 271 Read/Feed constraints in 81 ms returned sat
[2020-06-05 02:52:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:52:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1382 ms returned sat
[2020-06-05 02:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:52:56] [INFO ] [Nat]Absence check using state equation in 12422 ms returned sat
[2020-06-05 02:52:57] [INFO ] [Nat]Added 271 Read/Feed constraints in 94 ms returned sat
[2020-06-05 02:52:57] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-06-05 02:52:57] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-06-05 02:52:58] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-05 02:52:58] [INFO ] Deduced a trap composed of 7 places in 309 ms
[2020-06-05 02:52:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1696 ms
[2020-06-05 02:52:58] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 150 ms.
[2020-06-05 02:53:18] [INFO ] Added : 455 causal constraints over 91 iterations in 20076 ms.(timeout) Result :sat
[2020-06-05 02:53:19] [INFO ] Deduced a trap composed of 7 places in 471 ms
[2020-06-05 02:53:20] [INFO ] Deduced a trap composed of 7 places in 429 ms
[2020-06-05 02:53:20] [INFO ] Deduced a trap composed of 5 places in 456 ms
[2020-06-05 02:53:21] [INFO ] Deduced a trap composed of 6 places in 456 ms
[2020-06-05 02:53:21] [INFO ] Deduced a trap composed of 9 places in 445 ms
[2020-06-05 02:53:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3302 ms
Attempting to minimize the solution found.
Minimization took 93 ms.
[2020-06-05 02:53:24] [INFO ] [Real]Absence check using 1101 positive place invariants in 1334 ms returned sat
[2020-06-05 02:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:53:37] [INFO ] [Real]Absence check using state equation in 13589 ms returned sat
[2020-06-05 02:53:37] [INFO ] [Real]Added 271 Read/Feed constraints in 71 ms returned sat
[2020-06-05 02:53:39] [INFO ] Deduced a trap composed of 7 places in 1065 ms
[2020-06-05 02:53:40] [INFO ] Deduced a trap composed of 7 places in 877 ms
[2020-06-05 02:53:41] [INFO ] Deduced a trap composed of 4 places in 908 ms
[2020-06-05 02:53:42] [INFO ] Deduced a trap composed of 7 places in 1019 ms
[2020-06-05 02:53:43] [INFO ] Deduced a trap composed of 6 places in 1004 ms
[2020-06-05 02:53:44] [INFO ] Deduced a trap composed of 8 places in 963 ms
[2020-06-05 02:53:45] [INFO ] Deduced a trap composed of 3 places in 1124 ms
[2020-06-05 02:53:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7862 ms
[2020-06-05 02:53:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:53:47] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1332 ms returned sat
[2020-06-05 02:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:54:01] [INFO ] [Nat]Absence check using state equation in 14123 ms returned sat
[2020-06-05 02:54:01] [INFO ] [Nat]Added 271 Read/Feed constraints in 115 ms returned sat
[2020-06-05 02:54:02] [INFO ] Deduced a trap composed of 8 places in 278 ms
[2020-06-05 02:54:02] [INFO ] Deduced a trap composed of 7 places in 301 ms
[2020-06-05 02:54:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 885 ms
[2020-06-05 02:54:02] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 152 ms.
[2020-06-05 02:54:14] [INFO ] Added : 280 causal constraints over 56 iterations in 12143 ms. Result :unsat
[2020-06-05 02:54:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 1479 ms returned sat
[2020-06-05 02:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:54:28] [INFO ] [Real]Absence check using state equation in 12059 ms returned sat
[2020-06-05 02:54:29] [INFO ] [Real]Added 271 Read/Feed constraints in 65 ms returned sat
[2020-06-05 02:54:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:54:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1194 ms returned sat
[2020-06-05 02:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:54:42] [INFO ] [Nat]Absence check using state equation in 11991 ms returned sat
[2020-06-05 02:54:42] [INFO ] [Nat]Added 271 Read/Feed constraints in 139 ms returned sat
[2020-06-05 02:54:43] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 130 ms.
[2020-06-05 02:55:03] [INFO ] Added : 480 causal constraints over 96 iterations in 20240 ms.(timeout) Result :sat
[2020-06-05 02:55:03] [INFO ] Deduced a trap composed of 6 places in 294 ms
[2020-06-05 02:55:03] [INFO ] Deduced a trap composed of 5 places in 293 ms
[2020-06-05 02:55:04] [INFO ] Deduced a trap composed of 5 places in 280 ms
[2020-06-05 02:55:04] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-06-05 02:55:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1870 ms
Attempting to minimize the solution found.
Minimization took 84 ms.
[2020-06-05 02:55:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 1304 ms returned sat
[2020-06-05 02:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:55:19] [INFO ] [Real]Absence check using state equation in 13032 ms returned sat
[2020-06-05 02:55:20] [INFO ] [Real]Added 271 Read/Feed constraints in 80 ms returned sat
[2020-06-05 02:55:21] [INFO ] Deduced a trap composed of 6 places in 1080 ms
[2020-06-05 02:55:22] [INFO ] Deduced a trap composed of 6 places in 898 ms
[2020-06-05 02:55:23] [INFO ] Deduced a trap composed of 4 places in 1053 ms
[2020-06-05 02:55:24] [INFO ] Deduced a trap composed of 10 places in 845 ms
[2020-06-05 02:55:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4449 ms
[2020-06-05 02:55:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:55:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1272 ms returned sat
[2020-06-05 02:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:55:37] [INFO ] [Nat]Absence check using state equation in 11157 ms returned sat
[2020-06-05 02:55:37] [INFO ] [Nat]Added 271 Read/Feed constraints in 183 ms returned sat
[2020-06-05 02:55:37] [INFO ] Deduced a trap composed of 5 places in 318 ms
[2020-06-05 02:55:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2020-06-05 02:55:38] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 106 ms.
[2020-06-05 02:55:58] [INFO ] Added : 475 causal constraints over 95 iterations in 20098 ms.(timeout) Result :sat
[2020-06-05 02:55:58] [INFO ] Deduced a trap composed of 6 places in 284 ms
[2020-06-05 02:55:59] [INFO ] Deduced a trap composed of 6 places in 281 ms
[2020-06-05 02:55:59] [INFO ] Deduced a trap composed of 5 places in 280 ms
[2020-06-05 02:55:59] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-06-05 02:56:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2006 ms
Attempting to minimize the solution found.
Minimization took 86 ms.
[2020-06-05 02:56:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 1297 ms returned sat
[2020-06-05 02:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:56:15] [INFO ] [Real]Absence check using state equation in 13165 ms returned sat
[2020-06-05 02:56:15] [INFO ] [Real]Added 271 Read/Feed constraints in 87 ms returned sat
[2020-06-05 02:56:16] [INFO ] Deduced a trap composed of 6 places in 982 ms
[2020-06-05 02:56:17] [INFO ] Deduced a trap composed of 5 places in 1048 ms
[2020-06-05 02:56:18] [INFO ] Deduced a trap composed of 6 places in 920 ms
[2020-06-05 02:56:19] [INFO ] Deduced a trap composed of 5 places in 1060 ms
[2020-06-05 02:56:21] [INFO ] Deduced a trap composed of 4 places in 958 ms
[2020-06-05 02:56:22] [INFO ] Deduced a trap composed of 6 places in 1039 ms
[2020-06-05 02:56:23] [INFO ] Deduced a trap composed of 7 places in 1025 ms
[2020-06-05 02:56:24] [INFO ] Deduced a trap composed of 6 places in 993 ms
[2020-06-05 02:56:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 9051 ms
[2020-06-05 02:56:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:56:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1185 ms returned sat
[2020-06-05 02:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:56:38] [INFO ] [Nat]Absence check using state equation in 12784 ms returned sat
[2020-06-05 02:56:39] [INFO ] [Nat]Added 271 Read/Feed constraints in 96 ms returned sat
[2020-06-05 02:56:39] [INFO ] Deduced a trap composed of 7 places in 295 ms
[2020-06-05 02:56:39] [INFO ] Deduced a trap composed of 7 places in 288 ms
[2020-06-05 02:56:40] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-06-05 02:56:40] [INFO ] Deduced a trap composed of 7 places in 288 ms
[2020-06-05 02:56:40] [INFO ] Deduced a trap composed of 5 places in 278 ms
[2020-06-05 02:56:41] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-06-05 02:56:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2473 ms
[2020-06-05 02:56:41] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 177 ms.
[2020-06-05 02:57:01] [INFO ] Added : 445 causal constraints over 89 iterations in 20195 ms.(timeout) Result :sat
[2020-06-05 02:57:02] [INFO ] Deduced a trap composed of 6 places in 393 ms
[2020-06-05 02:57:02] [INFO ] Deduced a trap composed of 5 places in 384 ms
[2020-06-05 02:57:03] [INFO ] Deduced a trap composed of 5 places in 382 ms
[2020-06-05 02:57:03] [INFO ] Deduced a trap composed of 5 places in 386 ms
[2020-06-05 02:57:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2359 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-06-05 02:57:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 1242 ms returned sat
[2020-06-05 02:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:57:17] [INFO ] [Real]Absence check using state equation in 11830 ms returned sat
[2020-06-05 02:57:17] [INFO ] [Real]Added 271 Read/Feed constraints in 84 ms returned sat
[2020-06-05 02:57:19] [INFO ] Deduced a trap composed of 6 places in 1033 ms
[2020-06-05 02:57:20] [INFO ] Deduced a trap composed of 6 places in 1060 ms
[2020-06-05 02:57:21] [INFO ] Deduced a trap composed of 6 places in 949 ms
[2020-06-05 02:57:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3543 ms
[2020-06-05 02:57:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:57:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1312 ms returned sat
[2020-06-05 02:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:57:37] [INFO ] [Nat]Absence check using state equation in 13806 ms returned sat
[2020-06-05 02:57:37] [INFO ] [Nat]Added 271 Read/Feed constraints in 160 ms returned sat
[2020-06-05 02:57:37] [INFO ] Deduced a trap composed of 5 places in 327 ms
[2020-06-05 02:57:38] [INFO ] Deduced a trap composed of 7 places in 366 ms
[2020-06-05 02:57:38] [INFO ] Deduced a trap composed of 7 places in 343 ms
[2020-06-05 02:57:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1509 ms
[2020-06-05 02:57:38] [INFO ] Computed and/alt/rep : 2155/6748/2155 causal constraints in 140 ms.
[2020-06-05 02:57:58] [INFO ] Added : 540 causal constraints over 108 iterations in 20083 ms.(timeout) Result :sat
[2020-06-05 02:57:59] [INFO ] Deduced a trap composed of 5 places in 352 ms
[2020-06-05 02:57:59] [INFO ] Deduced a trap composed of 5 places in 324 ms
[2020-06-05 02:58:00] [INFO ] Deduced a trap composed of 7 places in 325 ms
[2020-06-05 02:58:00] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2020-06-05 02:58:01] [INFO ] Deduced a trap composed of 7 places in 313 ms
[2020-06-05 02:58:01] [INFO ] Deduced a trap composed of 7 places in 286 ms
[2020-06-05 02:58:02] [INFO ] Deduced a trap composed of 6 places in 291 ms
[2020-06-05 02:58:02] [INFO ] Deduced a trap composed of 8 places in 301 ms
[2020-06-05 02:58:03] [INFO ] Deduced a trap composed of 5 places in 301 ms
[2020-06-05 02:58:03] [INFO ] Deduced a trap composed of 6 places in 294 ms
[2020-06-05 02:58:04] [INFO ] Deduced a trap composed of 7 places in 290 ms
[2020-06-05 02:58:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5499 ms
Attempting to minimize the solution found.
Minimization took 93 ms.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 255400 steps, including 1002 resets, run finished after 3953 ms. (steps per millisecond=64 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 248500 steps, including 1002 resets, run finished after 3562 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 248300 steps, including 1002 resets, run finished after 3723 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 231200 steps, including 1002 resets, run finished after 3712 ms. (steps per millisecond=62 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 233900 steps, including 1002 resets, run finished after 3549 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 281300 steps, including 1002 resets, run finished after 4132 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 232300 steps, including 1002 resets, run finished after 3126 ms. (steps per millisecond=74 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 305600 steps, including 1002 resets, run finished after 4051 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 38 out of 2588 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2588/2588 places, 2173/2173 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2588 transition count 2169
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2584 transition count 2169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 2584 transition count 2160
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 2575 transition count 2160
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 2559 transition count 2144
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 2553 transition count 2144
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 2553 transition count 2144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 2552 transition count 2143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 2551 transition count 2142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 2550 transition count 2141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 2549 transition count 2140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 2548 transition count 2139
Applied a total of 77 rules in 678 ms. Remains 2548 /2588 variables (removed 40) and now considering 2139/2173 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 2548/2588 places, 2139/2173 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13904 ms. (steps per millisecond=71 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 506714 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 504755 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 510448 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 507826 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 511298 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 493947 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 479616 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 905839 steps, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 905839 steps, saw 141285 distinct states, run finished after 30001 ms. (steps per millisecond=30 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2139 rows 2548 cols
[2020-06-05 02:59:53] [INFO ] Computed 1101 place invariants in 8 ms
[2020-06-05 02:59:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 1107 ms returned sat
[2020-06-05 02:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:00:06] [INFO ] [Real]Absence check using state equation in 10882 ms returned sat
[2020-06-05 03:00:06] [INFO ] State equation strengthened by 273 read => feed constraints.
[2020-06-05 03:00:06] [INFO ] [Real]Added 273 Read/Feed constraints in 89 ms returned sat
[2020-06-05 03:00:06] [INFO ] Deduced a trap composed of 6 places in 445 ms
[2020-06-05 03:00:07] [INFO ] Deduced a trap composed of 4 places in 443 ms
[2020-06-05 03:00:07] [INFO ] Deduced a trap composed of 6 places in 449 ms
[2020-06-05 03:00:08] [INFO ] Deduced a trap composed of 5 places in 473 ms
[2020-06-05 03:00:09] [INFO ] Deduced a trap composed of 4 places in 453 ms
[2020-06-05 03:00:09] [INFO ] Deduced a trap composed of 3 places in 446 ms
[2020-06-05 03:00:10] [INFO ] Deduced a trap composed of 5 places in 433 ms
[2020-06-05 03:00:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4019 ms
[2020-06-05 03:00:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:00:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1380 ms returned sat
[2020-06-05 03:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:00:23] [INFO ] [Nat]Absence check using state equation in 11626 ms returned sat
[2020-06-05 03:00:23] [INFO ] [Nat]Added 273 Read/Feed constraints in 83 ms returned sat
[2020-06-05 03:00:24] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-06-05 03:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2020-06-05 03:00:24] [INFO ] Computed and/alt/rep : 2127/6716/2127 causal constraints in 176 ms.
[2020-06-05 03:00:44] [INFO ] Added : 470 causal constraints over 94 iterations in 20127 ms.(timeout) Result :sat
[2020-06-05 03:00:44] [INFO ] Deduced a trap composed of 5 places in 324 ms
[2020-06-05 03:00:45] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-06-05 03:00:45] [INFO ] Deduced a trap composed of 6 places in 301 ms
[2020-06-05 03:00:46] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2020-06-05 03:00:46] [INFO ] Deduced a trap composed of 5 places in 282 ms
[2020-06-05 03:00:47] [INFO ] Deduced a trap composed of 6 places in 373 ms
[2020-06-05 03:00:47] [INFO ] Deduced a trap composed of 7 places in 301 ms
[2020-06-05 03:00:48] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-06-05 03:00:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4001 ms
Attempting to minimize the solution found.
Minimization took 86 ms.
[2020-06-05 03:00:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 1246 ms returned sat
[2020-06-05 03:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:00] [INFO ] [Real]Absence check using state equation in 10645 ms returned sat
[2020-06-05 03:01:01] [INFO ] [Real]Added 273 Read/Feed constraints in 77 ms returned sat
[2020-06-05 03:01:01] [INFO ] Deduced a trap composed of 7 places in 472 ms
[2020-06-05 03:01:02] [INFO ] Deduced a trap composed of 5 places in 472 ms
[2020-06-05 03:01:02] [INFO ] Deduced a trap composed of 8 places in 468 ms
[2020-06-05 03:01:03] [INFO ] Deduced a trap composed of 5 places in 467 ms
[2020-06-05 03:01:04] [INFO ] Deduced a trap composed of 5 places in 462 ms
[2020-06-05 03:01:04] [INFO ] Deduced a trap composed of 4 places in 449 ms
[2020-06-05 03:01:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3578 ms
[2020-06-05 03:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:01:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1286 ms returned sat
[2020-06-05 03:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:17] [INFO ] [Nat]Absence check using state equation in 11236 ms returned sat
[2020-06-05 03:01:17] [INFO ] [Nat]Added 273 Read/Feed constraints in 132 ms returned sat
[2020-06-05 03:01:18] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2020-06-05 03:01:18] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-06-05 03:01:18] [INFO ] Deduced a trap composed of 5 places in 272 ms
[2020-06-05 03:01:19] [INFO ] Deduced a trap composed of 7 places in 250 ms
[2020-06-05 03:01:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1524 ms
[2020-06-05 03:01:19] [INFO ] Computed and/alt/rep : 2127/6716/2127 causal constraints in 128 ms.
[2020-06-05 03:01:39] [INFO ] Added : 595 causal constraints over 119 iterations in 20105 ms.(timeout) Result :sat
[2020-06-05 03:01:39] [INFO ] Deduced a trap composed of 7 places in 312 ms
[2020-06-05 03:01:40] [INFO ] Deduced a trap composed of 7 places in 323 ms
[2020-06-05 03:01:40] [INFO ] Deduced a trap composed of 6 places in 303 ms
[2020-06-05 03:01:41] [INFO ] Deduced a trap composed of 5 places in 441 ms
[2020-06-05 03:01:42] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2020-06-05 03:01:42] [INFO ] Deduced a trap composed of 5 places in 300 ms
[2020-06-05 03:01:42] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-06-05 03:01:43] [INFO ] Deduced a trap composed of 6 places in 303 ms
[2020-06-05 03:01:43] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-06-05 03:01:44] [INFO ] Deduced a trap composed of 5 places in 300 ms
[2020-06-05 03:01:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5071 ms
Attempting to minimize the solution found.
Minimization took 98 ms.
[2020-06-05 03:01:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 1259 ms returned sat
[2020-06-05 03:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:57] [INFO ] [Real]Absence check using state equation in 11381 ms returned sat
[2020-06-05 03:01:57] [INFO ] [Real]Added 273 Read/Feed constraints in 81 ms returned sat
[2020-06-05 03:01:58] [INFO ] Deduced a trap composed of 6 places in 831 ms
[2020-06-05 03:01:59] [INFO ] Deduced a trap composed of 3 places in 490 ms
[2020-06-05 03:02:00] [INFO ] Deduced a trap composed of 6 places in 472 ms
[2020-06-05 03:02:00] [INFO ] Deduced a trap composed of 5 places in 508 ms
[2020-06-05 03:02:01] [INFO ] Deduced a trap composed of 3 places in 561 ms
[2020-06-05 03:02:02] [INFO ] Deduced a trap composed of 7 places in 547 ms
[2020-06-05 03:02:02] [INFO ] Deduced a trap composed of 4 places in 544 ms
[2020-06-05 03:02:03] [INFO ] Deduced a trap composed of 3 places in 543 ms
[2020-06-05 03:02:04] [INFO ] Deduced a trap composed of 6 places in 547 ms
[2020-06-05 03:02:04] [INFO ] Deduced a trap composed of 8 places in 543 ms
[2020-06-05 03:02:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6818 ms
[2020-06-05 03:02:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:02:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1246 ms returned sat
[2020-06-05 03:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:02:17] [INFO ] [Nat]Absence check using state equation in 11446 ms returned sat
[2020-06-05 03:02:18] [INFO ] [Nat]Added 273 Read/Feed constraints in 70 ms returned sat
[2020-06-05 03:02:18] [INFO ] Deduced a trap composed of 5 places in 332 ms
[2020-06-05 03:02:18] [INFO ] Deduced a trap composed of 7 places in 314 ms
[2020-06-05 03:02:19] [INFO ] Deduced a trap composed of 7 places in 328 ms
[2020-06-05 03:02:19] [INFO ] Deduced a trap composed of 6 places in 331 ms
[2020-06-05 03:02:20] [INFO ] Deduced a trap composed of 6 places in 323 ms
[2020-06-05 03:02:20] [INFO ] Deduced a trap composed of 5 places in 303 ms
[2020-06-05 03:02:21] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-06-05 03:02:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3165 ms
[2020-06-05 03:02:21] [INFO ] Computed and/alt/rep : 2127/6716/2127 causal constraints in 138 ms.
[2020-06-05 03:02:41] [INFO ] Added : 525 causal constraints over 105 iterations in 20055 ms.(timeout) Result :sat
[2020-06-05 03:02:41] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-06-05 03:02:42] [INFO ] Deduced a trap composed of 6 places in 345 ms
[2020-06-05 03:02:42] [INFO ] Deduced a trap composed of 5 places in 346 ms
[2020-06-05 03:02:43] [INFO ] Deduced a trap composed of 7 places in 356 ms
[2020-06-05 03:02:43] [INFO ] Deduced a trap composed of 7 places in 336 ms
[2020-06-05 03:02:44] [INFO ] Deduced a trap composed of 6 places in 328 ms
[2020-06-05 03:02:44] [INFO ] Deduced a trap composed of 8 places in 327 ms
[2020-06-05 03:02:45] [INFO ] Deduced a trap composed of 6 places in 328 ms
[2020-06-05 03:02:45] [INFO ] Deduced a trap composed of 5 places in 332 ms
[2020-06-05 03:02:46] [INFO ] Deduced a trap composed of 7 places in 321 ms
[2020-06-05 03:02:46] [INFO ] Deduced a trap composed of 6 places in 312 ms
[2020-06-05 03:02:47] [INFO ] Deduced a trap composed of 7 places in 305 ms
[2020-06-05 03:02:47] [INFO ] Deduced a trap composed of 5 places in 287 ms
[2020-06-05 03:02:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6420 ms
Attempting to minimize the solution found.
Minimization took 82 ms.
[2020-06-05 03:02:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 1295 ms returned sat
[2020-06-05 03:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:03:00] [INFO ] [Real]Absence check using state equation in 10896 ms returned sat
[2020-06-05 03:03:00] [INFO ] [Real]Added 273 Read/Feed constraints in 76 ms returned sat
[2020-06-05 03:03:01] [INFO ] Deduced a trap composed of 5 places in 438 ms
[2020-06-05 03:03:01] [INFO ] Deduced a trap composed of 3 places in 403 ms
[2020-06-05 03:03:02] [INFO ] Deduced a trap composed of 4 places in 417 ms
[2020-06-05 03:03:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1553 ms
[2020-06-05 03:03:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:03:04] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1474 ms returned sat
[2020-06-05 03:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:03:15] [INFO ] [Nat]Absence check using state equation in 11132 ms returned sat
[2020-06-05 03:03:15] [INFO ] [Nat]Added 273 Read/Feed constraints in 96 ms returned sat
[2020-06-05 03:03:15] [INFO ] Computed and/alt/rep : 2127/6716/2127 causal constraints in 139 ms.
[2020-06-05 03:03:35] [INFO ] Added : 605 causal constraints over 121 iterations in 20078 ms.(timeout) Result :sat
[2020-06-05 03:03:35] [INFO ] Deduced a trap composed of 7 places in 273 ms
[2020-06-05 03:03:36] [INFO ] Deduced a trap composed of 6 places in 298 ms
[2020-06-05 03:03:36] [INFO ] Deduced a trap composed of 5 places in 279 ms
[2020-06-05 03:03:37] [INFO ] Deduced a trap composed of 5 places in 285 ms
[2020-06-05 03:03:37] [INFO ] Deduced a trap composed of 5 places in 285 ms
[2020-06-05 03:03:38] [INFO ] Deduced a trap composed of 6 places in 280 ms
[2020-06-05 03:03:38] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-06-05 03:03:38] [INFO ] Deduced a trap composed of 5 places in 261 ms
[2020-06-05 03:03:39] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-06-05 03:03:39] [INFO ] Deduced a trap composed of 7 places in 258 ms
[2020-06-05 03:03:40] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-06-05 03:03:40] [INFO ] Deduced a trap composed of 6 places in 269 ms
[2020-06-05 03:03:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5435 ms
Attempting to minimize the solution found.
Minimization took 85 ms.
[2020-06-05 03:03:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 1233 ms returned sat
[2020-06-05 03:03:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:03:53] [INFO ] [Real]Absence check using state equation in 10807 ms returned sat
[2020-06-05 03:03:53] [INFO ] [Real]Added 273 Read/Feed constraints in 84 ms returned sat
[2020-06-05 03:03:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:03:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1420 ms returned sat
[2020-06-05 03:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:04:06] [INFO ] [Nat]Absence check using state equation in 10955 ms returned sat
[2020-06-05 03:04:06] [INFO ] [Nat]Added 273 Read/Feed constraints in 110 ms returned sat
[2020-06-05 03:04:06] [INFO ] Deduced a trap composed of 8 places in 314 ms
[2020-06-05 03:04:07] [INFO ] Deduced a trap composed of 7 places in 292 ms
[2020-06-05 03:04:07] [INFO ] Deduced a trap composed of 6 places in 317 ms
[2020-06-05 03:04:08] [INFO ] Deduced a trap composed of 7 places in 305 ms
[2020-06-05 03:04:08] [INFO ] Deduced a trap composed of 5 places in 322 ms
[2020-06-05 03:04:09] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-06-05 03:04:09] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-06-05 03:04:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2938 ms
[2020-06-05 03:04:09] [INFO ] Computed and/alt/rep : 2127/6716/2127 causal constraints in 145 ms.
[2020-06-05 03:04:29] [INFO ] Added : 525 causal constraints over 105 iterations in 20053 ms.(timeout) Result :sat
[2020-06-05 03:04:30] [INFO ] Deduced a trap composed of 6 places in 379 ms
[2020-06-05 03:04:30] [INFO ] Deduced a trap composed of 6 places in 392 ms
[2020-06-05 03:04:31] [INFO ] Deduced a trap composed of 6 places in 354 ms
[2020-06-05 03:04:31] [INFO ] Deduced a trap composed of 5 places in 415 ms
[2020-06-05 03:04:32] [INFO ] Deduced a trap composed of 6 places in 409 ms
[2020-06-05 03:04:32] [INFO ] Deduced a trap composed of 7 places in 450 ms
[2020-06-05 03:04:33] [INFO ] Deduced a trap composed of 6 places in 423 ms
[2020-06-05 03:04:33] [INFO ] Deduced a trap composed of 5 places in 399 ms
[2020-06-05 03:04:34] [INFO ] Deduced a trap composed of 5 places in 405 ms
[2020-06-05 03:04:35] [INFO ] Deduced a trap composed of 6 places in 383 ms
[2020-06-05 03:04:35] [INFO ] Deduced a trap composed of 6 places in 391 ms
[2020-06-05 03:04:36] [INFO ] Deduced a trap composed of 5 places in 385 ms
[2020-06-05 03:04:36] [INFO ] Deduced a trap composed of 5 places in 376 ms
[2020-06-05 03:04:37] [INFO ] Deduced a trap composed of 7 places in 370 ms
[2020-06-05 03:04:37] [INFO ] Deduced a trap composed of 7 places in 383 ms
[2020-06-05 03:04:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 8342 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
[2020-06-05 03:04:39] [INFO ] [Real]Absence check using 1101 positive place invariants in 1367 ms returned sat
[2020-06-05 03:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:04:51] [INFO ] [Real]Absence check using state equation in 11521 ms returned sat
[2020-06-05 03:04:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:04:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1214 ms returned sat
[2020-06-05 03:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:05:03] [INFO ] [Nat]Absence check using state equation in 10451 ms returned sat
[2020-06-05 03:05:03] [INFO ] [Nat]Added 273 Read/Feed constraints in 89 ms returned sat
[2020-06-05 03:05:03] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2020-06-05 03:05:04] [INFO ] Deduced a trap composed of 5 places in 274 ms
[2020-06-05 03:05:04] [INFO ] Deduced a trap composed of 8 places in 242 ms
[2020-06-05 03:05:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1122 ms
[2020-06-05 03:05:04] [INFO ] Computed and/alt/rep : 2127/6716/2127 causal constraints in 124 ms.
[2020-06-05 03:05:24] [INFO ] Added : 485 causal constraints over 97 iterations in 20061 ms.(timeout) Result :sat
[2020-06-05 03:05:25] [INFO ] Deduced a trap composed of 7 places in 292 ms
[2020-06-05 03:05:25] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-06-05 03:05:25] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2020-06-05 03:05:26] [INFO ] Deduced a trap composed of 5 places in 239 ms
[2020-06-05 03:05:26] [INFO ] Deduced a trap composed of 7 places in 302 ms
[2020-06-05 03:05:27] [INFO ] Deduced a trap composed of 8 places in 301 ms
[2020-06-05 03:05:27] [INFO ] Deduced a trap composed of 9 places in 307 ms
[2020-06-05 03:05:28] [INFO ] Deduced a trap composed of 6 places in 304 ms
[2020-06-05 03:05:28] [INFO ] Deduced a trap composed of 5 places in 309 ms
[2020-06-05 03:05:29] [INFO ] Deduced a trap composed of 8 places in 286 ms
[2020-06-05 03:05:29] [INFO ] Deduced a trap composed of 5 places in 290 ms
[2020-06-05 03:05:29] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-06-05 03:05:30] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-06-05 03:05:30] [INFO ] Deduced a trap composed of 7 places in 285 ms
[2020-06-05 03:05:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6286 ms
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-05 03:05:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 1231 ms returned sat
[2020-06-05 03:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:05:43] [INFO ] [Real]Absence check using state equation in 11017 ms returned sat
[2020-06-05 03:05:43] [INFO ] [Real]Added 273 Read/Feed constraints in 76 ms returned sat
[2020-06-05 03:05:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:05:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1183 ms returned sat
[2020-06-05 03:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:05:56] [INFO ] [Nat]Absence check using state equation in 11201 ms returned sat
[2020-06-05 03:05:56] [INFO ] [Nat]Added 273 Read/Feed constraints in 88 ms returned sat
[2020-06-05 03:05:57] [INFO ] Deduced a trap composed of 6 places in 271 ms
[2020-06-05 03:05:57] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2020-06-05 03:05:57] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-06-05 03:05:58] [INFO ] Deduced a trap composed of 5 places in 262 ms
[2020-06-05 03:05:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1492 ms
[2020-06-05 03:05:58] [INFO ] Computed and/alt/rep : 2127/6716/2127 causal constraints in 137 ms.
[2020-06-05 03:06:18] [INFO ] Added : 500 causal constraints over 100 iterations in 20075 ms.(timeout) Result :sat
[2020-06-05 03:06:18] [INFO ] Deduced a trap composed of 5 places in 384 ms
[2020-06-05 03:06:19] [INFO ] Deduced a trap composed of 5 places in 392 ms
[2020-06-05 03:06:20] [INFO ] Deduced a trap composed of 6 places in 377 ms
[2020-06-05 03:06:20] [INFO ] Deduced a trap composed of 6 places in 392 ms
[2020-06-05 03:06:21] [INFO ] Deduced a trap composed of 5 places in 375 ms
[2020-06-05 03:06:21] [INFO ] Deduced a trap composed of 6 places in 385 ms
[2020-06-05 03:06:22] [INFO ] Deduced a trap composed of 5 places in 393 ms
[2020-06-05 03:06:22] [INFO ] Deduced a trap composed of 5 places in 374 ms
[2020-06-05 03:06:23] [INFO ] Deduced a trap composed of 6 places in 353 ms
[2020-06-05 03:06:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4875 ms
Attempting to minimize the solution found.
Minimization took 81 ms.
Incomplete Parikh walk after 241400 steps, including 1002 resets, run finished after 3897 ms. (steps per millisecond=61 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 236400 steps, including 1002 resets, run finished after 3772 ms. (steps per millisecond=62 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 214000 steps, including 1002 resets, run finished after 3212 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 257900 steps, including 1002 resets, run finished after 3437 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 227100 steps, including 1002 resets, run finished after 3028 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 241900 steps, including 1002 resets, run finished after 3168 ms. (steps per millisecond=76 ) properties seen :[0, 0, 0, 0, 1, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 251600 steps, including 1002 resets, run finished after 3662 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 26 out of 2548 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2548/2548 places, 2139/2139 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 2548 transition count 2134
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 2543 transition count 2134
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 2543 transition count 2130
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 2539 transition count 2130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 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 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 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 31 place count 2532 transition count 2125
Applied a total of 31 rules in 427 ms. Remains 2532 /2548 variables (removed 16) and now considering 2125/2139 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2548 places, 2125/2139 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13138 ms. (steps per millisecond=76 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 460135 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 447253 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 491196 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 444111 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 502180 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 880031 steps, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 880031 steps, saw 135443 distinct states, run finished after 30001 ms. (steps per millisecond=29 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2125 rows 2532 cols
[2020-06-05 03:07:56] [INFO ] Computed 1101 place invariants in 7 ms
[2020-06-05 03:07:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 1205 ms returned sat
[2020-06-05 03:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:08:08] [INFO ] [Real]Absence check using state equation in 10371 ms returned sat
[2020-06-05 03:08:08] [INFO ] State equation strengthened by 276 read => feed constraints.
[2020-06-05 03:08:08] [INFO ] [Real]Added 276 Read/Feed constraints in 76 ms returned sat
[2020-06-05 03:08:08] [INFO ] Deduced a trap composed of 7 places in 403 ms
[2020-06-05 03:08:09] [INFO ] Deduced a trap composed of 6 places in 394 ms
[2020-06-05 03:08:09] [INFO ] Deduced a trap composed of 6 places in 345 ms
[2020-06-05 03:08:10] [INFO ] Deduced a trap composed of 5 places in 389 ms
[2020-06-05 03:08:10] [INFO ] Deduced a trap composed of 6 places in 382 ms
[2020-06-05 03:08:11] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-06-05 03:08:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2980 ms
[2020-06-05 03:08:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:08:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1487 ms returned sat
[2020-06-05 03:08:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:08:23] [INFO ] [Nat]Absence check using state equation in 10394 ms returned sat
[2020-06-05 03:08:23] [INFO ] [Nat]Added 276 Read/Feed constraints in 79 ms returned sat
[2020-06-05 03:08:23] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 117 ms.
[2020-06-05 03:08:43] [INFO ] Added : 655 causal constraints over 131 iterations in 20119 ms.(timeout) Result :sat
[2020-06-05 03:08:44] [INFO ] Deduced a trap composed of 5 places in 452 ms
[2020-06-05 03:08:44] [INFO ] Deduced a trap composed of 7 places in 400 ms
[2020-06-05 03:08:45] [INFO ] Deduced a trap composed of 6 places in 412 ms
[2020-06-05 03:08:46] [INFO ] Deduced a trap composed of 6 places in 380 ms
[2020-06-05 03:08:46] [INFO ] Deduced a trap composed of 6 places in 390 ms
[2020-06-05 03:08:47] [INFO ] Deduced a trap composed of 6 places in 393 ms
[2020-06-05 03:08:47] [INFO ] Deduced a trap composed of 6 places in 374 ms
[2020-06-05 03:08:48] [INFO ] Deduced a trap composed of 5 places in 386 ms
[2020-06-05 03:08:48] [INFO ] Deduced a trap composed of 5 places in 368 ms
[2020-06-05 03:08:49] [INFO ] Deduced a trap composed of 6 places in 371 ms
[2020-06-05 03:08:49] [INFO ] Deduced a trap composed of 5 places in 387 ms
[2020-06-05 03:08:50] [INFO ] Deduced a trap composed of 6 places in 363 ms
[2020-06-05 03:08:50] [INFO ] Deduced a trap composed of 6 places in 356 ms
[2020-06-05 03:08:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 7210 ms
Attempting to minimize the solution found.
Minimization took 93 ms.
[2020-06-05 03:08:53] [INFO ] [Real]Absence check using 1101 positive place invariants in 1325 ms returned sat
[2020-06-05 03:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:09:03] [INFO ] [Real]Absence check using state equation in 10531 ms returned sat
[2020-06-05 03:09:03] [INFO ] [Real]Added 276 Read/Feed constraints in 80 ms returned sat
[2020-06-05 03:09:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:09:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1382 ms returned sat
[2020-06-05 03:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:09:16] [INFO ] [Nat]Absence check using state equation in 10789 ms returned sat
[2020-06-05 03:09:16] [INFO ] [Nat]Added 276 Read/Feed constraints in 62 ms returned sat
[2020-06-05 03:09:16] [INFO ] Deduced a trap composed of 6 places in 185 ms
[2020-06-05 03:09:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2020-06-05 03:09:16] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 123 ms.
[2020-06-05 03:09:36] [INFO ] Added : 525 causal constraints over 105 iterations in 20164 ms.(timeout) Result :sat
[2020-06-05 03:09:37] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-06-05 03:09:37] [INFO ] Deduced a trap composed of 5 places in 278 ms
[2020-06-05 03:09:38] [INFO ] Deduced a trap composed of 7 places in 296 ms
[2020-06-05 03:09:38] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-06-05 03:09:39] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-06-05 03:09:39] [INFO ] Deduced a trap composed of 7 places in 276 ms
[2020-06-05 03:09:39] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-06-05 03:09:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3150 ms
Attempting to minimize the solution found.
Minimization took 76 ms.
[2020-06-05 03:09:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 1288 ms returned sat
[2020-06-05 03:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:09:52] [INFO ] [Real]Absence check using state equation in 10788 ms returned sat
[2020-06-05 03:09:52] [INFO ] [Real]Added 276 Read/Feed constraints in 80 ms returned sat
[2020-06-05 03:09:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:09:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1288 ms returned sat
[2020-06-05 03:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:10:05] [INFO ] [Nat]Absence check using state equation in 11230 ms returned sat
[2020-06-05 03:10:05] [INFO ] [Nat]Added 276 Read/Feed constraints in 154 ms returned sat
[2020-06-05 03:10:06] [INFO ] Deduced a trap composed of 5 places in 256 ms
[2020-06-05 03:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2020-06-05 03:10:06] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 107 ms.
[2020-06-05 03:10:26] [INFO ] Added : 505 causal constraints over 101 iterations in 20128 ms.(timeout) Result :sat
[2020-06-05 03:10:26] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-06-05 03:10:27] [INFO ] Deduced a trap composed of 7 places in 283 ms
[2020-06-05 03:10:27] [INFO ] Deduced a trap composed of 5 places in 287 ms
[2020-06-05 03:10:28] [INFO ] Deduced a trap composed of 6 places in 295 ms
[2020-06-05 03:10:28] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-06-05 03:10:28] [INFO ] Deduced a trap composed of 6 places in 281 ms
[2020-06-05 03:10:29] [INFO ] Deduced a trap composed of 5 places in 254 ms
[2020-06-05 03:10:29] [INFO ] Deduced a trap composed of 7 places in 268 ms
[2020-06-05 03:10:30] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-06-05 03:10:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3987 ms
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-05 03:10:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 1370 ms returned sat
[2020-06-05 03:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:10:42] [INFO ] [Real]Absence check using state equation in 10350 ms returned sat
[2020-06-05 03:10:42] [INFO ] [Real]Added 276 Read/Feed constraints in 77 ms returned sat
[2020-06-05 03:10:43] [INFO ] Deduced a trap composed of 7 places in 422 ms
[2020-06-05 03:10:43] [INFO ] Deduced a trap composed of 5 places in 436 ms
[2020-06-05 03:10:44] [INFO ] Deduced a trap composed of 3 places in 444 ms
[2020-06-05 03:10:44] [INFO ] Deduced a trap composed of 5 places in 433 ms
[2020-06-05 03:10:45] [INFO ] Deduced a trap composed of 4 places in 423 ms
[2020-06-05 03:10:45] [INFO ] Deduced a trap composed of 7 places in 439 ms
[2020-06-05 03:10:46] [INFO ] Deduced a trap composed of 6 places in 420 ms
[2020-06-05 03:10:47] [INFO ] Deduced a trap composed of 6 places in 437 ms
[2020-06-05 03:10:47] [INFO ] Deduced a trap composed of 5 places in 422 ms
[2020-06-05 03:10:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4818 ms
[2020-06-05 03:10:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:10:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1110 ms returned sat
[2020-06-05 03:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:10:59] [INFO ] [Nat]Absence check using state equation in 10497 ms returned sat
[2020-06-05 03:10:59] [INFO ] [Nat]Added 276 Read/Feed constraints in 130 ms returned sat
[2020-06-05 03:11:00] [INFO ] Deduced a trap composed of 6 places in 305 ms
[2020-06-05 03:11:00] [INFO ] Deduced a trap composed of 7 places in 289 ms
[2020-06-05 03:11:01] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-06-05 03:11:01] [INFO ] Deduced a trap composed of 6 places in 294 ms
[2020-06-05 03:11:01] [INFO ] Deduced a trap composed of 5 places in 289 ms
[2020-06-05 03:11:02] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-06-05 03:11:02] [INFO ] Deduced a trap composed of 6 places in 291 ms
[2020-06-05 03:11:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2944 ms
[2020-06-05 03:11:03] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 185 ms.
[2020-06-05 03:11:22] [INFO ] Added : 605 causal constraints over 121 iterations in 20162 ms.(timeout) Result :sat
[2020-06-05 03:11:23] [INFO ] Deduced a trap composed of 6 places in 407 ms
[2020-06-05 03:11:23] [INFO ] Deduced a trap composed of 5 places in 383 ms
[2020-06-05 03:11:24] [INFO ] Deduced a trap composed of 6 places in 418 ms
[2020-06-05 03:11:25] [INFO ] Deduced a trap composed of 6 places in 402 ms
[2020-06-05 03:11:25] [INFO ] Deduced a trap composed of 7 places in 384 ms
[2020-06-05 03:11:26] [INFO ] Deduced a trap composed of 6 places in 389 ms
[2020-06-05 03:11:26] [INFO ] Deduced a trap composed of 5 places in 379 ms
[2020-06-05 03:11:27] [INFO ] Deduced a trap composed of 8 places in 384 ms
[2020-06-05 03:11:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4493 ms
Attempting to minimize the solution found.
Minimization took 65 ms.
[2020-06-05 03:11:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 1318 ms returned sat
[2020-06-05 03:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:11:40] [INFO ] [Real]Absence check using state equation in 10829 ms returned sat
[2020-06-05 03:11:40] [INFO ] [Real]Added 276 Read/Feed constraints in 48 ms returned sat
[2020-06-05 03:11:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:11:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1186 ms returned sat
[2020-06-05 03:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:11:53] [INFO ] [Nat]Absence check using state equation in 11322 ms returned sat
[2020-06-05 03:11:53] [INFO ] [Nat]Added 276 Read/Feed constraints in 148 ms returned sat
[2020-06-05 03:11:53] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-06-05 03:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2020-06-05 03:11:53] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 147 ms.
[2020-06-05 03:12:14] [INFO ] Added : 650 causal constraints over 130 iterations in 20311 ms.(timeout) Result :sat
[2020-06-05 03:12:14] [INFO ] Deduced a trap composed of 7 places in 241 ms
[2020-06-05 03:12:14] [INFO ] Deduced a trap composed of 7 places in 257 ms
[2020-06-05 03:12:15] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2020-06-05 03:12:15] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-06-05 03:12:16] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2020-06-05 03:12:16] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2020-06-05 03:12:16] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-06-05 03:12:17] [INFO ] Deduced a trap composed of 7 places in 234 ms
[2020-06-05 03:12:17] [INFO ] Deduced a trap composed of 5 places in 236 ms
[2020-06-05 03:12:18] [INFO ] Deduced a trap composed of 5 places in 222 ms
[2020-06-05 03:12:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4214 ms
Attempting to minimize the solution found.
Minimization took 91 ms.
Incomplete Parikh walk after 226300 steps, including 1002 resets, run finished after 3289 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 220900 steps, including 1002 resets, run finished after 2865 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 232000 steps, including 1002 resets, run finished after 3034 ms. (steps per millisecond=76 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 285200 steps, including 1002 resets, run finished after 3720 ms. (steps per millisecond=76 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 208600 steps, including 1002 resets, run finished after 2735 ms. (steps per millisecond=76 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 26 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 65 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 74 ms. Remains 2532 /2532 variables (removed 0) and now considering 2125/2125 (removed 0) transitions.
// Phase 1: matrix 2125 rows 2532 cols
[2020-06-05 03:12:34] [INFO ] Computed 1101 place invariants in 7 ms
[2020-06-05 03:12:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:12:43] [INFO ] Implicit Places using invariants in 9222 ms returned []
// Phase 1: matrix 2125 rows 2532 cols
[2020-06-05 03:12:43] [INFO ] Computed 1101 place invariants in 8 ms
[2020-06-05 03:12:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:12:52] [INFO ] Implicit Places using invariants and state equation in 9042 ms returned []
Implicit Place search using SMT with State Equation took 18267 ms to find 0 implicit places.
[2020-06-05 03:12:52] [INFO ] Redundant transitions in 259 ms returned []
// Phase 1: matrix 2125 rows 2532 cols
[2020-06-05 03:12:52] [INFO ] Computed 1101 place invariants in 9 ms
[2020-06-05 03:12:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:13:00] [INFO ] Dead Transitions using invariants and state equation in 7284 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 1482 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2125 rows 2532 cols
[2020-06-05 03:13:01] [INFO ] Computed 1101 place invariants in 7 ms
[2020-06-05 03:13:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 1216 ms returned sat
[2020-06-05 03:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:13:13] [INFO ] [Real]Absence check using state equation in 10471 ms returned sat
[2020-06-05 03:13:13] [INFO ] State equation strengthened by 276 read => feed constraints.
[2020-06-05 03:13:13] [INFO ] [Real]Added 276 Read/Feed constraints in 74 ms returned sat
[2020-06-05 03:13:14] [INFO ] Deduced a trap composed of 7 places in 443 ms
[2020-06-05 03:13:14] [INFO ] Deduced a trap composed of 6 places in 421 ms
[2020-06-05 03:13:15] [INFO ] Deduced a trap composed of 6 places in 418 ms
[2020-06-05 03:13:15] [INFO ] Deduced a trap composed of 5 places in 392 ms
[2020-06-05 03:13:16] [INFO ] Deduced a trap composed of 6 places in 405 ms
[2020-06-05 03:13:16] [INFO ] Deduced a trap composed of 4 places in 384 ms
[2020-06-05 03:13:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3102 ms
[2020-06-05 03:13:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:13:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1198 ms returned sat
[2020-06-05 03:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:13:29] [INFO ] [Nat]Absence check using state equation in 10679 ms returned sat
[2020-06-05 03:13:29] [INFO ] [Nat]Added 276 Read/Feed constraints in 94 ms returned sat
[2020-06-05 03:13:29] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 155 ms.
[2020-06-05 03:13:36] [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: Stream closed (=> (> t278 0) (and (> t281 0) (< o281 o278)))") while checking expression at index 0
[2020-06-05 03:13:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 1439 ms returned sat
[2020-06-05 03:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:13:49] [INFO ] [Real]Absence check using state equation in 10405 ms returned sat
[2020-06-05 03:13:49] [INFO ] [Real]Added 276 Read/Feed constraints in 76 ms returned sat
[2020-06-05 03:13:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:13:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1092 ms returned sat
[2020-06-05 03:13:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:14:01] [INFO ] [Nat]Absence check using state equation in 11206 ms returned sat
[2020-06-05 03:14:02] [INFO ] [Nat]Added 276 Read/Feed constraints in 55 ms returned sat
[2020-06-05 03:14:02] [INFO ] Deduced a trap composed of 6 places in 263 ms
[2020-06-05 03:14:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2020-06-05 03:14:02] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 143 ms.
[2020-06-05 03:14:09] [INFO ] Added : 215 causal constraints over 43 iterations in 6885 ms. Result :unknown
[2020-06-05 03:14:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 1186 ms returned sat
[2020-06-05 03:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:14:22] [INFO ] [Real]Absence check using state equation in 11303 ms returned sat
[2020-06-05 03:14:22] [INFO ] [Real]Added 276 Read/Feed constraints in 83 ms returned sat
[2020-06-05 03:14:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:14:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1237 ms returned sat
[2020-06-05 03:14:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:14:34] [INFO ] [Nat]Absence check using state equation in 11019 ms returned sat
[2020-06-05 03:14:35] [INFO ] [Nat]Added 276 Read/Feed constraints in 79 ms returned sat
[2020-06-05 03:14:35] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-06-05 03:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2020-06-05 03:14:35] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 117 ms.
[2020-06-05 03:14:42] [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: Stream closed (=> (> t215 0) (and (or (and (> t945 0) (< o945 o215)) (and (> t947 0) (< o947 o215))) (and (> t2058 0) (< o2058 o215))))") while checking expression at index 2
[2020-06-05 03:14:44] [INFO ] [Real]Absence check using 1101 positive place invariants in 1441 ms returned sat
[2020-06-05 03:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:14:55] [INFO ] [Real]Absence check using state equation in 11173 ms returned sat
[2020-06-05 03:14:55] [INFO ] [Real]Added 276 Read/Feed constraints in 61 ms returned sat
[2020-06-05 03:14:55] [INFO ] Deduced a trap composed of 7 places in 413 ms
[2020-06-05 03:14:56] [INFO ] Deduced a trap composed of 5 places in 360 ms
[2020-06-05 03:14:56] [INFO ] Deduced a trap composed of 3 places in 444 ms
[2020-06-05 03:14:57] [INFO ] Deduced a trap composed of 5 places in 448 ms
[2020-06-05 03:14:58] [INFO ] Deduced a trap composed of 4 places in 442 ms
[2020-06-05 03:14:58] [INFO ] Deduced a trap composed of 7 places in 450 ms
[2020-06-05 03:14:59] [INFO ] Deduced a trap composed of 6 places in 445 ms
[2020-06-05 03:14:59] [INFO ] Deduced a trap composed of 6 places in 415 ms
[2020-06-05 03:15:00] [INFO ] Deduced a trap composed of 5 places in 416 ms
[2020-06-05 03:15:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4789 ms
[2020-06-05 03:15:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:15:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1179 ms returned sat
[2020-06-05 03:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:12] [INFO ] [Nat]Absence check using state equation in 10232 ms returned sat
[2020-06-05 03:15:12] [INFO ] [Nat]Added 276 Read/Feed constraints in 135 ms returned sat
[2020-06-05 03:15:12] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-06-05 03:15:12] [INFO ] Deduced a trap composed of 7 places in 293 ms
[2020-06-05 03:15:13] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-06-05 03:15:13] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-06-05 03:15:14] [INFO ] Deduced a trap composed of 5 places in 266 ms
[2020-06-05 03:15:14] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-06-05 03:15:14] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-06-05 03:15:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2794 ms
[2020-06-05 03:15:15] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 147 ms.
[2020-06-05 03:15:20] [INFO ] Added : 135 causal constraints over 27 iterations in 5271 ms. Result :unknown
[2020-06-05 03:15:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 1234 ms returned sat
[2020-06-05 03:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:32] [INFO ] [Real]Absence check using state equation in 10376 ms returned sat
[2020-06-05 03:15:32] [INFO ] [Real]Added 276 Read/Feed constraints in 70 ms returned sat
[2020-06-05 03:15:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:15:34] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1247 ms returned sat
[2020-06-05 03:15:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:44] [INFO ] [Nat]Absence check using state equation in 10211 ms returned sat
[2020-06-05 03:15:44] [INFO ] [Nat]Added 276 Read/Feed constraints in 103 ms returned sat
[2020-06-05 03:15:44] [INFO ] Deduced a trap composed of 5 places in 199 ms
[2020-06-05 03:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2020-06-05 03:15:44] [INFO ] Computed and/alt/rep : 2115/6720/2115 causal constraints in 106 ms.
[2020-06-05 03:15:52] [INFO ] Added : 245 causal constraints over 49 iterations in 7803 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 618 times.
Drop transitions removed 618 transitions
Iterating global reduction 0 with 618 rules applied. Total rules applied 618 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 677 place count 2532 transition count 2125
Applied a total of 677 rules in 334 ms. Remains 2532 /2532 variables (removed 0) and now considering 2125/2125 (removed 0) transitions.
// Phase 1: matrix 2125 rows 2532 cols
[2020-06-05 03:15:52] [INFO ] Computed 1101 place invariants in 9 ms
[2020-06-05 03:15:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 1120 ms returned sat
[2020-06-05 03:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:16:04] [INFO ] [Real]Absence check using state equation in 10187 ms returned sat
[2020-06-05 03:16:04] [INFO ] State equation strengthened by 605 read => feed constraints.
[2020-06-05 03:16:04] [INFO ] [Real]Added 605 Read/Feed constraints in 150 ms returned sat
[2020-06-05 03:16:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:16:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1039 ms returned sat
[2020-06-05 03:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:16:16] [INFO ] [Nat]Absence check using state equation in 10136 ms returned sat
[2020-06-05 03:16:16] [INFO ] [Nat]Added 605 Read/Feed constraints in 87 ms returned sat
[2020-06-05 03:16:16] [INFO ] Deduced a trap composed of 3 places in 29 ms
[2020-06-05 03:16:16] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-05 03:16:16] [INFO ] Deduced a trap composed of 11 places in 29 ms
[2020-06-05 03:16:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 529 ms
[2020-06-05 03:16:17] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 147 ms.
[2020-06-05 03:16:37] [INFO ] Added : 630 causal constraints over 126 iterations in 20155 ms.(timeout) Result :sat
[2020-06-05 03:16:37] [INFO ] Deduced a trap composed of 8 places in 111 ms
[2020-06-05 03:16:37] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2020-06-05 03:16:37] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-06-05 03:16:38] [INFO ] Deduced a trap composed of 8 places in 97 ms
[2020-06-05 03:16:38] [INFO ] Deduced a trap composed of 8 places in 101 ms
[2020-06-05 03:16:38] [INFO ] Deduced a trap composed of 14 places in 90 ms
[2020-06-05 03:16:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1764 ms
Attempting to minimize the solution found.
Minimization took 98 ms.
[2020-06-05 03:16:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 1280 ms returned sat
[2020-06-05 03:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:16:50] [INFO ] [Real]Absence check using state equation in 10004 ms returned sat
[2020-06-05 03:16:50] [INFO ] [Real]Added 605 Read/Feed constraints in 185 ms returned sat
[2020-06-05 03:16:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:16:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1247 ms returned sat
[2020-06-05 03:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:17:03] [INFO ] [Nat]Absence check using state equation in 10572 ms returned sat
[2020-06-05 03:17:03] [INFO ] [Nat]Added 605 Read/Feed constraints in 98 ms returned sat
[2020-06-05 03:17:03] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-06-05 03:17:03] [INFO ] Deduced a trap composed of 3 places in 27 ms
[2020-06-05 03:17:03] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2020-06-05 03:17:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 535 ms
[2020-06-05 03:17:03] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 155 ms.
[2020-06-05 03:17:23] [INFO ] Added : 550 causal constraints over 110 iterations in 20165 ms.(timeout) Result :sat
[2020-06-05 03:17:24] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-06-05 03:17:24] [INFO ] Deduced a trap composed of 11 places in 88 ms
[2020-06-05 03:17:24] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-06-05 03:17:24] [INFO ] Deduced a trap composed of 8 places in 71 ms
[2020-06-05 03:17:25] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2020-06-05 03:17:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1306 ms
Attempting to minimize the solution found.
Minimization took 76 ms.
[2020-06-05 03:17:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 1293 ms returned sat
[2020-06-05 03:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:17:38] [INFO ] [Real]Absence check using state equation in 11098 ms returned sat
[2020-06-05 03:17:38] [INFO ] [Real]Added 605 Read/Feed constraints in 174 ms returned sat
[2020-06-05 03:17:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:17:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1097 ms returned sat
[2020-06-05 03:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:17:51] [INFO ] [Nat]Absence check using state equation in 11169 ms returned sat
[2020-06-05 03:17:51] [INFO ] [Nat]Added 605 Read/Feed constraints in 145 ms returned sat
[2020-06-05 03:17:51] [INFO ] Deduced a trap composed of 5 places in 45 ms
[2020-06-05 03:17:51] [INFO ] Deduced a trap composed of 3 places in 43 ms
[2020-06-05 03:17:51] [INFO ] Deduced a trap composed of 5 places in 38 ms
[2020-06-05 03:17:51] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-05 03:17:52] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-06-05 03:17:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 965 ms
[2020-06-05 03:17:52] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 200 ms.
[2020-06-05 03:18:12] [INFO ] Added : 560 causal constraints over 112 iterations in 20132 ms.(timeout) Result :sat
[2020-06-05 03:18:12] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-06-05 03:18:12] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2020-06-05 03:18:12] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-06-05 03:18:13] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-06-05 03:18:13] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-05 03:18:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1300 ms
Attempting to minimize the solution found.
Minimization took 92 ms.
[2020-06-05 03:18:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 1275 ms returned sat
[2020-06-05 03:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:18:25] [INFO ] [Real]Absence check using state equation in 10410 ms returned sat
[2020-06-05 03:18:26] [INFO ] [Real]Added 605 Read/Feed constraints in 160 ms returned sat
[2020-06-05 03:18:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:18:27] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1245 ms returned sat
[2020-06-05 03:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:18:38] [INFO ] [Nat]Absence check using state equation in 10653 ms returned sat
[2020-06-05 03:18:38] [INFO ] [Nat]Added 605 Read/Feed constraints in 81 ms returned sat
[2020-06-05 03:18:38] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-05 03:18:38] [INFO ] Deduced a trap composed of 3 places in 30 ms
[2020-06-05 03:18:39] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-06-05 03:18:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 538 ms
[2020-06-05 03:18:39] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 144 ms.
[2020-06-05 03:18:59] [INFO ] Added : 670 causal constraints over 134 iterations in 20061 ms.(timeout) Result :sat
[2020-06-05 03:18:59] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2020-06-05 03:18:59] [INFO ] Deduced a trap composed of 8 places in 101 ms
[2020-06-05 03:19:00] [INFO ] Deduced a trap composed of 6 places in 112 ms
[2020-06-05 03:19:00] [INFO ] Deduced a trap composed of 8 places in 105 ms
[2020-06-05 03:19:00] [INFO ] Deduced a trap composed of 8 places in 110 ms
[2020-06-05 03:19:00] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2020-06-05 03:19:01] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-05 03:19:01] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2020-06-05 03:19:01] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2020-06-05 03:19:01] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-06-05 03:19:02] [INFO ] Deduced a trap composed of 6 places in 127 ms
[2020-06-05 03:19:02] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-06-05 03:19:02] [INFO ] Deduced a trap composed of 11 places in 81 ms
[2020-06-05 03:19:02] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3719 ms
Attempting to minimize the solution found.
Minimization took 101 ms.
[2020-06-05 03:19:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 1532 ms returned sat
[2020-06-05 03:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:19:16] [INFO ] [Real]Absence check using state equation in 11177 ms returned sat
[2020-06-05 03:19:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:19:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1203 ms returned sat
[2020-06-05 03:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:19:29] [INFO ] [Nat]Absence check using state equation in 11181 ms returned sat
[2020-06-05 03:19:29] [INFO ] [Nat]Added 605 Read/Feed constraints in 78 ms returned sat
[2020-06-05 03:19:29] [INFO ] Deduced a trap composed of 3 places in 24 ms
[2020-06-05 03:19:29] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-05 03:19:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2020-06-05 03:19:29] [INFO ] Computed and/alt/rep : 2116/8608/2116 causal constraints in 124 ms.
[2020-06-05 03:19:49] [INFO ] Added : 595 causal constraints over 119 iterations in 20132 ms.(timeout) Result :sat
[2020-06-05 03:19:49] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-06-05 03:19:50] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-06-05 03:19:50] [INFO ] Deduced a trap composed of 15 places in 98 ms
[2020-06-05 03:19:50] [INFO ] Deduced a trap composed of 14 places in 88 ms
[2020-06-05 03:19:50] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2020-06-05 03:19:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1442 ms
Attempting to minimize the solution found.
Minimization took 99 ms.
[2020-06-05 03:19:51] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2020-06-05 03:19:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 35 ms.
[2020-06-05 03:19:52] [INFO ] Flatten gal took : 331 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPt-PT-100B @ 3570 seconds

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3547
rslt: Output for ReachabilityFireability @ ShieldPPPt-PT-100B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 03:19:52 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p937))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 155,
"markings": 156,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p1227 <= 0) OR (p1229 <= 0))))",
"processed_size": 39,
"rewrites": 2
},
"result":
{
"edges": 132,
"markings": 133,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1182
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p774 <= 0) OR ((1 <= p1987) AND (1 <= p1999)))))",
"processed_size": 57,
"rewrites": 2
},
"result":
{
"edges": 159,
"markings": 160,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1773
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p862 <= 0) OR ((1 <= p684)) OR ((1 <= p2509) AND (1 <= p2523)))))",
"processed_size": 75,
"rewrites": 2
},
"result":
{
"edges": 154,
"markings": 155,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 6,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (F ((((p1742 <= 0)) AND (((1 <= p304)) OR ((1 <= p715) AND (1 <= p717))) AND (((1 <= p2013)) OR ((1 <= p630))) AND (((1 <= p1090)) OR ((1 <= p965)) OR (p1642 <= 0)) AND (((1 <= p2244) AND (1 <= p2252) AND (1 <= p1860)) OR ((1 <= p1535) AND (1 <= p2169))) AND (((1 <= p2)) OR ((1 <= p2528))))))",
"processed_size": 301,
"rewrites": 1
},
"result":
{
"edges": 494,
"markings": 491,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 384,
"problems": 48
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 48936,
"runtime": 23.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 9622,
"conflict_clusters": 837,
"places": 2532,
"places_significant": 1431,
"singleton_clusters": 0,
"transitions": 2125
},
"result":
{
"preliminary_value": "yes no yes no no ",
"value": "yes no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 4657/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 81024
lola: finding significant places
lola: 2532 places, 2125 transitions, 1431 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p937 <= 1)
lola: LP says that atomic proposition is always true: (p774 <= 1)
lola: LP says that atomic proposition is always true: (p1987 <= 1)
lola: LP says that atomic proposition is always true: (p1999 <= 1)
lola: LP says that atomic proposition is always true: (p1742 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p715 <= 1)
lola: LP says that atomic proposition is always true: (p717 <= 1)
lola: LP says that atomic proposition is always true: (p2013 <= 1)
lola: LP says that atomic proposition is always true: (p630 <= 1)
lola: LP says that atomic proposition is always true: (p1090 <= 1)
lola: LP says that atomic proposition is always true: (p965 <= 1)
lola: LP says that atomic proposition is always true: (p1642 <= 1)
lola: LP says that atomic proposition is always true: (p2244 <= 1)
lola: LP says that atomic proposition is always true: (p2252 <= 1)
lola: LP says that atomic proposition is always true: (p1860 <= 1)
lola: LP says that atomic proposition is always true: (p1535 <= 1)
lola: LP says that atomic proposition is always true: (p2169 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p2528 <= 1)
lola: LP says that atomic proposition is always true: (p1227 <= 1)
lola: LP says that atomic proposition is always true: (p1229 <= 1)
lola: LP says that atomic proposition is always true: (p684 <= 1)
lola: LP says that atomic proposition is always true: (p862 <= 1)
lola: LP says that atomic proposition is always true: (p2509 <= 1)
lola: LP says that atomic proposition is always true: (p2523 <= 1)
lola: E (F (((1 <= p937)))) : A (G (((p774 <= 0) OR ((1 <= p1987) AND (1 <= p1999))))) : E (F ((((p1742 <= 0)) AND (((1 <= p304)) OR ((1 <= p715) AND (1 <= p717))) AND (((1 <= p2013)) OR ((1 <= p630))) AND (((1 <= p1090)) OR ((1 <= p965)) OR (p1642 <= 0)) AND (((1 <= p2244) AND (1 <= p2252) AND (1 <= p1860)) OR ((1 <= p1535) AND (1 <= p2169))) AND (((1 <= p2)) OR ((1 <= p2528)))))) : A (G (((p1227 <= 0) OR (p1229 <= 0)))) : A (G (((p862 <= 0) OR ((1 <= p684)) OR ((1 <= p2509) AND (1 <= p2523)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p937))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p937))))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p937))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 156 markings, 155 edges
lola: ========================================
lola: subprocess 1 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1227 <= 0) OR (p1229 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p1227 <= 0) OR (p1229 <= 0))))
lola: processed formula length: 39
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1227) AND (1 <= p1229))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 133 markings, 132 edges
lola: ========================================
lola: subprocess 2 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p774 <= 0) OR ((1 <= p1987) AND (1 <= p1999)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p774 <= 0) OR ((1 <= p1987) AND (1 <= p1999)))))
lola: processed formula length: 57
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p774) AND ((p1987 <= 0) OR (p1999 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 160 markings, 159 edges
lola: ========================================
lola: subprocess 3 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p862 <= 0) OR ((1 <= p684)) OR ((1 <= p2509) AND (1 <= p2523)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p862 <= 0) OR ((1 <= p684)) OR ((1 <= p2509) AND (1 <= p2523)))))
lola: processed formula length: 75
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p862) AND ((p684 <= 0)) AND ((p2509 <= 0) OR (p2523 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 155 markings, 154 edges
lola: ========================================
lola: subprocess 4 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1742 <= 0)) AND (((1 <= p304)) OR ((1 <= p715) AND (1 <= p717))) AND (((1 <= p2013)) OR ((1 <= p630))) AND (((1 <= p1090)) OR ((1 <= p965)) OR (p1642 <= 0)) AND (((1 <= p2244) AND (1 <= p2252) AND (1 <= p1860)) OR ((1 <= p1535) AND (1 <= p2169))) AND (((1 <= p2)) OR ((1 <= p2528))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p1742 <= 0)) AND (((1 <= p304)) OR ((1 <= p715) AND (1 <= p717))) AND (((1 <= p2013)) OR ((1 <= p630))) AND (((1 <= p1090)) OR ((1 <= p965)) OR (p1642 <= 0)) AND (((1 <= p2244) AND (1 <= p2252) AND (1 <= p1860)) OR ((1 <= p1535) AND (1 <= p2169))) AND (((1 <= p2)) OR ((1 <= p2528))))))
lola: processed formula length: 301
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p1742 <= 0)) AND (((1 <= p304)) OR ((1 <= p715) AND (1 <= p717))) AND (((1 <= p2013)) OR ((1 <= p630))) AND (((1 <= p1090)) OR ((1 <= p965)) OR (p1642 <= 0)) AND (((1 <= p2244) AND (1 <= p2252) AND (1 <= p1860)) OR ((1 <= p1535) AND (1 <= p2169))) AND (((1 <= p2)) OR ((1 <= p2528))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 384 literals and 48 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 491 markings, 494 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no
lola:
preliminary result: yes no yes no no
lola: memory consumption: 48936 KB
lola: time consumption: 23 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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="itslola"
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 itslola"
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 r211-tajo-159033477900743"
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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;