Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025900863.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025900863
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 6.5K Apr 30 06:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 06:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 30 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 30 06:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 06:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 625K May 10 09:34 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 ShieldRVs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654281119724

Running Version 202205111006
[2022-06-03 18:32:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 18:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:32:01] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2022-06-03 18:32:01] [INFO ] Transformed 2003 places.
[2022-06-03 18:32:01] [INFO ] Transformed 2253 transitions.
[2022-06-03 18:32:01] [INFO ] Found NUPN structural information;
[2022-06-03 18:32:01] [INFO ] Parsed PT model containing 2003 places and 2253 transitions in 340 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2022-06-03 18:32:02] [INFO ] Computed 201 place invariants in 40 ms
[2022-06-03 18:32:03] [INFO ] [Real]Absence check using 201 positive place invariants in 91 ms returned sat
[2022-06-03 18:32:03] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 18:32:04] [INFO ] [Nat]Absence check using 201 positive place invariants in 78 ms returned sat
[2022-06-03 18:32:08] [INFO ] After 3611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 18:32:09] [INFO ] Deduced a trap composed of 32 places in 622 ms of which 6 ms to minimize.
[2022-06-03 18:32:10] [INFO ] Deduced a trap composed of 44 places in 642 ms of which 3 ms to minimize.
[2022-06-03 18:32:11] [INFO ] Deduced a trap composed of 33 places in 610 ms of which 3 ms to minimize.
[2022-06-03 18:32:12] [INFO ] Deduced a trap composed of 17 places in 699 ms of which 2 ms to minimize.
[2022-06-03 18:32:13] [INFO ] Deduced a trap composed of 24 places in 629 ms of which 2 ms to minimize.
[2022-06-03 18:32:14] [INFO ] Deduced a trap composed of 22 places in 700 ms of which 2 ms to minimize.
[2022-06-03 18:32:14] [INFO ] Deduced a trap composed of 33 places in 682 ms of which 2 ms to minimize.
[2022-06-03 18:32:15] [INFO ] Deduced a trap composed of 36 places in 695 ms of which 1 ms to minimize.
[2022-06-03 18:32:16] [INFO ] Deduced a trap composed of 19 places in 666 ms of which 1 ms to minimize.
[2022-06-03 18:32:17] [INFO ] Deduced a trap composed of 17 places in 631 ms of which 2 ms to minimize.
[2022-06-03 18:32:17] [INFO ] Deduced a trap composed of 30 places in 654 ms of which 2 ms to minimize.
[2022-06-03 18:32:18] [INFO ] Deduced a trap composed of 23 places in 637 ms of which 2 ms to minimize.
[2022-06-03 18:32:19] [INFO ] Deduced a trap composed of 22 places in 657 ms of which 2 ms to minimize.
[2022-06-03 18:32:20] [INFO ] Deduced a trap composed of 39 places in 608 ms of which 1 ms to minimize.
[2022-06-03 18:32:20] [INFO ] Deduced a trap composed of 60 places in 611 ms of which 2 ms to minimize.
[2022-06-03 18:32:21] [INFO ] Deduced a trap composed of 29 places in 602 ms of which 1 ms to minimize.
[2022-06-03 18:32:22] [INFO ] Deduced a trap composed of 49 places in 610 ms of which 4 ms to minimize.
[2022-06-03 18:32:22] [INFO ] Deduced a trap composed of 48 places in 599 ms of which 1 ms to minimize.
[2022-06-03 18:32:23] [INFO ] Deduced a trap composed of 41 places in 590 ms of which 1 ms to minimize.
[2022-06-03 18:32:24] [INFO ] Deduced a trap composed of 30 places in 555 ms of which 2 ms to minimize.
[2022-06-03 18:32:25] [INFO ] Deduced a trap composed of 23 places in 715 ms of which 2 ms to minimize.
[2022-06-03 18:32:25] [INFO ] Deduced a trap composed of 21 places in 683 ms of which 2 ms to minimize.
[2022-06-03 18:32:26] [INFO ] Deduced a trap composed of 46 places in 688 ms of which 1 ms to minimize.
[2022-06-03 18:32:27] [INFO ] Deduced a trap composed of 24 places in 723 ms of which 1 ms to minimize.
[2022-06-03 18:32:28] [INFO ] Deduced a trap composed of 34 places in 635 ms of which 1 ms to minimize.
[2022-06-03 18:32:29] [INFO ] Deduced a trap composed of 24 places in 1000 ms of which 2 ms to minimize.
[2022-06-03 18:32:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 18:32:29] [INFO ] After 26022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 28941 ms.
Support contains 206 out of 2003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2003 transition count 2084
Reduce places removed 169 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 176 rules applied. Total rules applied 345 place count 1834 transition count 2077
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 352 place count 1827 transition count 2077
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 352 place count 1827 transition count 1840
Deduced a syphon composed of 237 places in 8 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 826 place count 1590 transition count 1840
Discarding 303 places :
Symmetric choice reduction at 3 with 303 rule applications. Total rules 1129 place count 1287 transition count 1537
Iterating global reduction 3 with 303 rules applied. Total rules applied 1432 place count 1287 transition count 1537
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 1432 place count 1287 transition count 1444
Deduced a syphon composed of 93 places in 3 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 1618 place count 1194 transition count 1444
Performed 309 Post agglomeration using F-continuation condition.Transition count delta: 309
Deduced a syphon composed of 309 places in 6 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 3 with 618 rules applied. Total rules applied 2236 place count 885 transition count 1135
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 3 with 82 rules applied. Total rules applied 2318 place count 885 transition count 1135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2319 place count 884 transition count 1134
Applied a total of 2319 rules in 624 ms. Remains 884 /2003 variables (removed 1119) and now considering 1134/2253 (removed 1119) transitions.
Finished structural reductions, in 1 iterations. Remains : 884/2003 places, 1134/2253 transitions.
Incomplete random walk after 1000000 steps, including 1174 resets, run finished after 17315 ms. (steps per millisecond=57 ) properties (out of 7) seen :4
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 93 resets, run finished after 4117 ms. (steps per millisecond=242 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 91 resets, run finished after 4066 ms. (steps per millisecond=245 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 982055 steps, including 84 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 1134 rows 884 cols
[2022-06-03 18:33:29] [INFO ] Computed 201 place invariants in 5 ms
[2022-06-03 18:33:29] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:33:29] [INFO ] [Nat]Absence check using 201 positive place invariants in 45 ms returned sat
[2022-06-03 18:33:30] [INFO ] After 792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:33:31] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2022-06-03 18:33:31] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2022-06-03 18:33:31] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-06-03 18:33:31] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2022-06-03 18:33:31] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2022-06-03 18:33:31] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-06-03 18:33:32] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2022-06-03 18:33:32] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 3 ms to minimize.
[2022-06-03 18:33:32] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2022-06-03 18:33:32] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2022-06-03 18:33:32] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2022-06-03 18:33:32] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2022-06-03 18:33:32] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:33:33] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2022-06-03 18:33:33] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2022-06-03 18:33:33] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:33:33] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:33:33] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2022-06-03 18:33:33] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:33:33] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-06-03 18:33:34] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:33:34] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3215 ms
[2022-06-03 18:33:34] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:33:34] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2022-06-03 18:33:34] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:33:35] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:33:35] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2022-06-03 18:33:35] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:33:35] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2022-06-03 18:33:35] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-06-03 18:33:35] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2022-06-03 18:33:35] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:33:36] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-06-03 18:33:36] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:33:36] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-06-03 18:33:36] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-06-03 18:33:36] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:33:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2022-06-03 18:33:36] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:33:37] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-06-03 18:33:37] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-06-03 18:33:37] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2022-06-03 18:33:37] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2851 ms
[2022-06-03 18:33:37] [INFO ] After 7367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 410 ms.
[2022-06-03 18:33:37] [INFO ] After 7985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1222 ms.
Support contains 96 out of 884 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 884/884 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 884 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 878 transition count 1128
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 12 place count 878 transition count 1103
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 62 place count 853 transition count 1103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 850 transition count 1100
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 850 transition count 1100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 68 place count 850 transition count 1099
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 849 transition count 1099
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 188 place count 790 transition count 1040
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 205 place count 790 transition count 1040
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 789 transition count 1039
Applied a total of 206 rules in 197 ms. Remains 789 /884 variables (removed 95) and now considering 1039/1134 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 789/884 places, 1039/1134 transitions.
Incomplete random walk after 1000000 steps, including 1401 resets, run finished after 12807 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 136 resets, run finished after 4361 ms. (steps per millisecond=229 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 937833 steps, including 113 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen 0
Interrupted probabilistic random walk after 4033021 steps, run timeout after 66001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 4033021 steps, saw 718599 distinct states, run finished after 66004 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:35:07] [INFO ] Computed 201 place invariants in 14 ms
[2022-06-03 18:35:07] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:35:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2022-06-03 18:35:08] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:35:08] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2022-06-03 18:35:08] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2022-06-03 18:35:08] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2022-06-03 18:35:09] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2022-06-03 18:35:09] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2022-06-03 18:35:09] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2022-06-03 18:35:09] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2022-06-03 18:35:09] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-06-03 18:35:09] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2022-06-03 18:35:10] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2022-06-03 18:35:10] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:35:10] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-06-03 18:35:10] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2022-06-03 18:35:10] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:35:10] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2022-06-03 18:35:10] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2022-06-03 18:35:11] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-06-03 18:35:11] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-06-03 18:35:11] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2022-06-03 18:35:11] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:35:11] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2022-06-03 18:35:11] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:35:11] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:35:12] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:35:12] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:35:12] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:35:12] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2022-06-03 18:35:12] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-06-03 18:35:12] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4113 ms
[2022-06-03 18:35:12] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2022-06-03 18:35:13] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2022-06-03 18:35:13] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2022-06-03 18:35:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:35:13] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-06-03 18:35:13] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2022-06-03 18:35:13] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2022-06-03 18:35:14] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-06-03 18:35:14] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2022-06-03 18:35:14] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2022-06-03 18:35:14] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2022-06-03 18:35:14] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-06-03 18:35:14] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2022-06-03 18:35:14] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2022-06-03 18:35:15] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-06-03 18:35:16] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3994 ms
[2022-06-03 18:35:16] [INFO ] After 9105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 323 ms.
[2022-06-03 18:35:17] [INFO ] After 9600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1535 ms.
Support contains 96 out of 789 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Applied a total of 0 rules in 28 ms. Remains 789 /789 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 789/789 places, 1039/1039 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Applied a total of 0 rules in 27 ms. Remains 789 /789 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:35:18] [INFO ] Computed 201 place invariants in 3 ms
[2022-06-03 18:35:19] [INFO ] Implicit Places using invariants in 454 ms returned []
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:35:19] [INFO ] Computed 201 place invariants in 9 ms
[2022-06-03 18:35:20] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2022-06-03 18:35:20] [INFO ] Redundant transitions in 185 ms returned []
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:35:20] [INFO ] Computed 201 place invariants in 4 ms
[2022-06-03 18:35:20] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 789/789 places, 1039/1039 transitions.
Incomplete random walk after 1000000 steps, including 1402 resets, run finished after 10141 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 136 resets, run finished after 4119 ms. (steps per millisecond=242 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 962965 steps, including 118 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
Interrupted probabilistic random walk after 3444778 steps, run timeout after 57001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 3444778 steps, saw 619172 distinct states, run finished after 57001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:36:36] [INFO ] Computed 201 place invariants in 4 ms
[2022-06-03 18:36:37] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:36:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2022-06-03 18:36:37] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:36:38] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2022-06-03 18:36:38] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-06-03 18:36:38] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-06-03 18:36:38] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2022-06-03 18:36:38] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2022-06-03 18:36:38] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2022-06-03 18:36:39] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:36:39] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-06-03 18:36:39] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2022-06-03 18:36:39] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-06-03 18:36:39] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-06-03 18:36:39] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-06-03 18:36:40] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2022-06-03 18:36:40] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-06-03 18:36:40] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-06-03 18:36:40] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2022-06-03 18:36:40] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 5 ms to minimize.
[2022-06-03 18:36:40] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2022-06-03 18:36:40] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:36:41] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2022-06-03 18:36:42] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2022-06-03 18:36:42] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4126 ms
[2022-06-03 18:36:42] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2022-06-03 18:36:42] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:36:42] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2022-06-03 18:36:42] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-06-03 18:36:43] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2022-06-03 18:36:43] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:36:43] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:36:43] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2022-06-03 18:36:43] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2022-06-03 18:36:43] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:36:44] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:36:44] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2022-06-03 18:36:44] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2022-06-03 18:36:44] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2022-06-03 18:36:44] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:36:44] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:36:44] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2022-06-03 18:36:45] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:36:46] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-06-03 18:36:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2022-06-03 18:36:46] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3829 ms
[2022-06-03 18:36:46] [INFO ] After 8939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 309 ms.
[2022-06-03 18:36:46] [INFO ] After 9414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1803 ms.
Support contains 96 out of 789 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Applied a total of 0 rules in 28 ms. Remains 789 /789 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 789/789 places, 1039/1039 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Applied a total of 0 rules in 27 ms. Remains 789 /789 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:36:48] [INFO ] Computed 201 place invariants in 3 ms
[2022-06-03 18:36:48] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:36:48] [INFO ] Computed 201 place invariants in 3 ms
[2022-06-03 18:36:49] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2022-06-03 18:36:49] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:36:49] [INFO ] Computed 201 place invariants in 11 ms
[2022-06-03 18:36:50] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 789/789 places, 1039/1039 transitions.
Applied a total of 0 rules in 25 ms. Remains 789 /789 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:36:50] [INFO ] Computed 201 place invariants in 4 ms
[2022-06-03 18:36:50] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:36:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-06-03 18:36:51] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:36:51] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2022-06-03 18:36:51] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2022-06-03 18:36:51] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2022-06-03 18:36:51] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2022-06-03 18:36:52] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2022-06-03 18:36:52] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2022-06-03 18:36:52] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2022-06-03 18:36:52] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-06-03 18:36:52] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-06-03 18:36:52] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-06-03 18:36:53] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2022-06-03 18:36:53] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-06-03 18:36:53] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2022-06-03 18:36:53] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-06-03 18:36:53] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2022-06-03 18:36:53] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:36:53] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:36:54] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:36:54] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2022-06-03 18:36:54] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-06-03 18:36:54] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2022-06-03 18:36:54] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:36:54] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2022-06-03 18:36:54] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:36:55] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2022-06-03 18:36:55] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:36:55] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2022-06-03 18:36:55] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2022-06-03 18:36:55] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4207 ms
[2022-06-03 18:36:55] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:36:55] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2022-06-03 18:36:56] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:36:56] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:36:56] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2022-06-03 18:36:56] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2022-06-03 18:36:56] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2022-06-03 18:36:56] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-06-03 18:36:57] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:36:58] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2022-06-03 18:36:59] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:36:59] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:36:59] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2022-06-03 18:36:59] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-06-03 18:36:59] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3776 ms
[2022-06-03 18:36:59] [INFO ] After 8949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 302 ms.
[2022-06-03 18:36:59] [INFO ] After 9412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 18:37:00] [INFO ] Flatten gal took : 150 ms
[2022-06-03 18:37:00] [INFO ] Flatten gal took : 85 ms
[2022-06-03 18:37:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6149082491298963649.gal : 34 ms
[2022-06-03 18:37:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11253377564727566283.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6149082491298963649.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11253377564727566283.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11253377564727566283.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 51
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51 after 195
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :195 after 3459
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3459 after 2.09962e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.74151e+14 after 8.32958e+14
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.32958e+14 after 8.32958e+14
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.32958e+14 after 8.32958e+14
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.32958e+14 after 8.32958e+14
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.32958e+14 after 8.3296e+14
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8.3296e+14 after 8.33064e+14
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :8.33064e+14 after 8.43621e+14
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :8.43621e+14 after 3.09796e+15
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :3.09796e+15 after 8.44397e+18
Detected timeout of ITS tools.
[2022-06-03 18:37:15] [INFO ] Flatten gal took : 74 ms
[2022-06-03 18:37:15] [INFO ] Applying decomposition
[2022-06-03 18:37:15] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10546879339286099838.txt' '-o' '/tmp/graph10546879339286099838.bin' '-w' '/tmp/graph10546879339286099838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10546879339286099838.bin' '-l' '-1' '-v' '-w' '/tmp/graph10546879339286099838.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:37:15] [INFO ] Decomposing Gal with order
[2022-06-03 18:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:37:15] [INFO ] Removed a total of 1259 redundant transitions.
[2022-06-03 18:37:16] [INFO ] Flatten gal took : 176 ms
[2022-06-03 18:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 713 labels/synchronizations in 92 ms.
[2022-06-03 18:37:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4129758167078218817.gal : 14 ms
[2022-06-03 18:37:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12934397566312380974.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4129758167078218817.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12934397566312380974.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality12934397566312380974.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 65
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :65 after 1473
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1473 after 1473
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1473 after 7.776e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2413462783830667044
[2022-06-03 18:37:31] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2413462783830667044
Running compilation step : cd /tmp/ltsmin2413462783830667044;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2011 ms.
Running link step : cd /tmp/ltsmin2413462783830667044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2413462783830667044;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldRVsPT050BReachabilityFireability06==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 18:37:46] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11251662549268054833
[2022-06-03 18:37:46] [INFO ] Computing symmetric may disable matrix : 1039 transitions.
[2022-06-03 18:37:46] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:37:46] [INFO ] Computing symmetric may enable matrix : 1039 transitions.
[2022-06-03 18:37:46] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:37:46] [INFO ] Applying decomposition
[2022-06-03 18:37:46] [INFO ] Flatten gal took : 89 ms
[2022-06-03 18:37:46] [INFO ] Flatten gal took : 200 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11141203704615396438.txt' '-o' '/tmp/graph11141203704615396438.bin' '-w' '/tmp/graph11141203704615396438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11141203704615396438.bin' '-l' '-1' '-v' '-w' '/tmp/graph11141203704615396438.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:37:46] [INFO ] Decomposing Gal with order
[2022-06-03 18:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:37:46] [INFO ] Input system was already deterministic with 1039 transitions.
[2022-06-03 18:37:46] [INFO ] Computing Do-Not-Accords matrix : 1039 transitions.
[2022-06-03 18:37:46] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:37:46] [INFO ] Built C files in 442ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11251662549268054833
Running compilation step : cd /tmp/ltsmin11251662549268054833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 18:37:46] [INFO ] Removed a total of 1268 redundant transitions.
[2022-06-03 18:37:46] [INFO ] Flatten gal took : 136 ms
[2022-06-03 18:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 699 labels/synchronizations in 143 ms.
[2022-06-03 18:37:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5156189480030559353.gal : 10 ms
[2022-06-03 18:37:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12484708085821517249.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5156189480030559353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12484708085821517249.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
[2022-06-03 18:37:47] [INFO ] Ran tautology test, simplified 0 / 2 in 671 ms.
Loading property file /tmp/ReachabilityFireability12484708085821517249.prop.
[2022-06-03 18:37:47] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(UNSAT) depth K=0 took 12 ms
[2022-06-03 18:37:47] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-09(UNSAT) depth K=0 took 1 ms
[2022-06-03 18:37:47] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(UNSAT) depth K=1 took 2 ms
[2022-06-03 18:37:47] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-09(UNSAT) depth K=1 took 6 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 97
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :97 after 1505
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1505 after 1505
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1505 after 1505
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1039 rows 789 cols
[2022-06-03 18:37:47] [INFO ] Computed 201 place invariants in 3 ms
[2022-06-03 18:37:47] [INFO ] Computed 201 place invariants in 4 ms
[2022-06-03 18:37:48] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(UNSAT) depth K=2 took 820 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1505 after 3.89906e+07
[2022-06-03 18:37:48] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-09(UNSAT) depth K=2 took 470 ms
[2022-06-03 18:37:49] [INFO ] Proved 789 variables to be positive in 1527 ms
[2022-06-03 18:37:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-050B-ReachabilityFireability-06
[2022-06-03 18:37:49] [INFO ] KInduction solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(SAT) depth K=0 took 152 ms
[2022-06-03 18:37:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-050B-ReachabilityFireability-09
[2022-06-03 18:37:49] [INFO ] KInduction solution for property ShieldRVs-PT-050B-ReachabilityFireability-09(SAT) depth K=0 took 136 ms
[2022-06-03 18:37:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-050B-ReachabilityFireability-06
[2022-06-03 18:37:50] [INFO ] KInduction solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(SAT) depth K=1 took 992 ms
Compilation finished in 3790 ms.
Running link step : cd /tmp/ltsmin11251662549268054833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11251662549268054833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050BReachabilityFireability06==true'
[2022-06-03 18:37:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-050B-ReachabilityFireability-09
[2022-06-03 18:37:53] [INFO ] KInduction solution for property ShieldRVs-PT-050B-ReachabilityFireability-09(SAT) depth K=1 took 2899 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.72828e+18 after 1.5448e+32
[2022-06-03 18:39:33] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(UNSAT) depth K=3 took 104840 ms
[2022-06-03 18:39:52] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-09(UNSAT) depth K=3 took 19196 ms
[2022-06-03 18:50:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-050B-ReachabilityFireability-06
[2022-06-03 18:50:25] [INFO ] KInduction solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(SAT) depth K=2 took 751894 ms
[2022-06-03 18:54:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-050B-ReachabilityFireability-09
[2022-06-03 18:54:41] [INFO ] KInduction solution for property ShieldRVs-PT-050B-ReachabilityFireability-09(SAT) depth K=2 took 255608 ms
Detected timeout of ITS tools.
[2022-06-03 18:59:43] [INFO ] Applying decomposition
[2022-06-03 18:59:43] [INFO ] Flatten gal took : 187 ms
[2022-06-03 18:59:43] [INFO ] Decomposing Gal with order
[2022-06-03 18:59:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:59:43] [INFO ] Removed a total of 1259 redundant transitions.
[2022-06-03 18:59:43] [INFO ] Flatten gal took : 245 ms
[2022-06-03 18:59:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 713 labels/synchronizations in 239 ms.
[2022-06-03 18:59:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1706970758335468814.gal : 24 ms
[2022-06-03 18:59:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8378160068817968921.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability1706970758335468814.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8378160068817968921.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability8378160068817968921.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 65
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :65 after 1473
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1473 after 1473
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1473 after 7.776e+07
Invariant property ShieldRVs-PT-050B-ReachabilityFireability-09 does not hold.
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.72828e+18 after 4.00662e+61
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin11251662549268054833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050BReachabilityFireability06==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin11251662549268054833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050BReachabilityFireability06==true'
[2022-06-03 19:08:17] [INFO ] BMC solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(UNSAT) depth K=4 took 1704373 ms
[2022-06-03 19:21:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-050B-ReachabilityFireability-06
[2022-06-03 19:21:19] [INFO ] KInduction solution for property ShieldRVs-PT-050B-ReachabilityFireability-06(SAT) depth K=3 took 1598506 ms
Detected timeout of ITS tools.
[2022-06-03 19:21:41] [INFO ] Flatten gal took : 417 ms
[2022-06-03 19:21:43] [INFO ] Input system was already deterministic with 1039 transitions.
[2022-06-03 19:21:43] [INFO ] Transformed 789 places.
[2022-06-03 19:21:43] [INFO ] Transformed 1039 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 19:21:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4752743645613568672.gal : 4 ms
[2022-06-03 19:21:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14497647455000549040.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4752743645613568672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14497647455000549040.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...365
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability14497647455000549040.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 165
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :165 after 1005
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1005 after 1453
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1453 after 15770
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15770 after 799860
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :799860 after 4.22541e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.22541e+06 after 1.20319e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.20319e+09 after 1.15789e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.15789e+12 after 3.79176e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.79176e+15 after 2.62046e+17
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.62046e+17 after 1.20927e+21
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.20927e+21 after 4.67281e+26
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.67281e+26 after 1.96302e+35
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.96302e+35 after 1.52423e+39
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.52423e+39 after 1.96191e+40

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ sed s/.jar//
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldRVs-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-050B, 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 r222-tall-165286025900863"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B 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 ;