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-165286025000303.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 ShieldIIPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.6K Apr 29 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 512K 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 ShieldIIPt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654269058825

Running Version 202205111006
[2022-06-03 15:11: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 15:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:11:00] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2022-06-03 15:11:00] [INFO ] Transformed 2103 places.
[2022-06-03 15:11:00] [INFO ] Transformed 1953 transitions.
[2022-06-03 15:11:00] [INFO ] Found NUPN structural information;
[2022-06-03 15:11:00] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 357 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 16) seen :4
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2022-06-03 15:11:01] [INFO ] Computed 271 place invariants in 37 ms
[2022-06-03 15:11:02] [INFO ] After 950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-03 15:11:03] [INFO ] [Nat]Absence check using 271 positive place invariants in 94 ms returned sat
[2022-06-03 15:11:11] [INFO ] After 7452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-06-03 15:11:12] [INFO ] Deduced a trap composed of 23 places in 511 ms of which 9 ms to minimize.
[2022-06-03 15:11:12] [INFO ] Deduced a trap composed of 19 places in 505 ms of which 3 ms to minimize.
[2022-06-03 15:11:13] [INFO ] Deduced a trap composed of 38 places in 430 ms of which 2 ms to minimize.
[2022-06-03 15:11:13] [INFO ] Deduced a trap composed of 30 places in 470 ms of which 3 ms to minimize.
[2022-06-03 15:11:14] [INFO ] Deduced a trap composed of 36 places in 413 ms of which 1 ms to minimize.
[2022-06-03 15:11:14] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 2 ms to minimize.
[2022-06-03 15:11:15] [INFO ] Deduced a trap composed of 31 places in 371 ms of which 2 ms to minimize.
[2022-06-03 15:11:15] [INFO ] Deduced a trap composed of 20 places in 385 ms of which 1 ms to minimize.
[2022-06-03 15:11:16] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 1 ms to minimize.
[2022-06-03 15:11:16] [INFO ] Deduced a trap composed of 24 places in 397 ms of which 1 ms to minimize.
[2022-06-03 15:11:17] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 1 ms to minimize.
[2022-06-03 15:11:17] [INFO ] Deduced a trap composed of 23 places in 575 ms of which 1 ms to minimize.
[2022-06-03 15:11:18] [INFO ] Deduced a trap composed of 20 places in 573 ms of which 1 ms to minimize.
[2022-06-03 15:11:19] [INFO ] Deduced a trap composed of 32 places in 555 ms of which 2 ms to minimize.
[2022-06-03 15:11:19] [INFO ] Deduced a trap composed of 27 places in 550 ms of which 2 ms to minimize.
[2022-06-03 15:11:20] [INFO ] Deduced a trap composed of 22 places in 492 ms of which 2 ms to minimize.
[2022-06-03 15:11:20] [INFO ] Deduced a trap composed of 16 places in 518 ms of which 2 ms to minimize.
[2022-06-03 15:11:21] [INFO ] Deduced a trap composed of 34 places in 529 ms of which 1 ms to minimize.
[2022-06-03 15:11:22] [INFO ] Deduced a trap composed of 26 places in 511 ms of which 2 ms to minimize.
[2022-06-03 15:11:22] [INFO ] Deduced a trap composed of 34 places in 522 ms of which 2 ms to minimize.
[2022-06-03 15:11:23] [INFO ] Deduced a trap composed of 29 places in 499 ms of which 2 ms to minimize.
[2022-06-03 15:11:23] [INFO ] Deduced a trap composed of 25 places in 477 ms of which 2 ms to minimize.
[2022-06-03 15:11:24] [INFO ] Deduced a trap composed of 20 places in 489 ms of which 1 ms to minimize.
[2022-06-03 15:11:24] [INFO ] Deduced a trap composed of 22 places in 470 ms of which 1 ms to minimize.
[2022-06-03 15:11:25] [INFO ] Deduced a trap composed of 40 places in 456 ms of which 2 ms to minimize.
[2022-06-03 15:11:26] [INFO ] Deduced a trap composed of 30 places in 491 ms of which 2 ms to minimize.
[2022-06-03 15:11:26] [INFO ] Deduced a trap composed of 33 places in 467 ms of which 1 ms to minimize.
[2022-06-03 15:11:27] [INFO ] Deduced a trap composed of 35 places in 458 ms of which 2 ms to minimize.
[2022-06-03 15:11:27] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 2 ms to minimize.
[2022-06-03 15:11:28] [INFO ] Deduced a trap composed of 40 places in 427 ms of which 1 ms to minimize.
[2022-06-03 15:11:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:11:28] [INFO ] After 25383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 52292 ms.
Support contains 160 out of 2103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 379 transitions
Trivial Post-agglo rules discarded 379 transitions
Performed 379 trivial Post agglomeration. Transition count delta: 379
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 2103 transition count 1574
Reduce places removed 379 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 420 rules applied. Total rules applied 799 place count 1724 transition count 1533
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 840 place count 1683 transition count 1533
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 840 place count 1683 transition count 1405
Deduced a syphon composed of 128 places in 5 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 1096 place count 1555 transition count 1405
Discarding 191 places :
Symmetric choice reduction at 3 with 191 rule applications. Total rules 1287 place count 1364 transition count 1214
Iterating global reduction 3 with 191 rules applied. Total rules applied 1478 place count 1364 transition count 1214
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 1478 place count 1364 transition count 1150
Deduced a syphon composed of 64 places in 6 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 1606 place count 1300 transition count 1150
Performed 443 Post agglomeration using F-continuation condition.Transition count delta: 443
Deduced a syphon composed of 443 places in 1 ms
Reduce places removed 443 places and 0 transitions.
Iterating global reduction 3 with 886 rules applied. Total rules applied 2492 place count 857 transition count 707
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 2612 place count 797 transition count 733
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2624 place count 797 transition count 721
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 2636 place count 785 transition count 721
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 2663 place count 785 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2664 place count 784 transition count 720
Applied a total of 2664 rules in 677 ms. Remains 784 /2103 variables (removed 1319) and now considering 720/1953 (removed 1233) transitions.
Finished structural reductions, in 1 iterations. Remains : 784/2103 places, 720/1953 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26811 ms. (steps per millisecond=37 ) properties (out of 11) seen :2
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 673135 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=134 ) properties seen 0
Interrupted Best-First random walk after 589133 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 0
Interrupted Best-First random walk after 856658 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 590938 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 0
Interrupted Best-First random walk after 510162 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 0
Interrupted Best-First random walk after 694620 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen 0
Interrupted Best-First random walk after 612613 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen 0
Interrupted Best-First random walk after 507744 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 798836 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 0
Running SMT prover for 9 properties.
// Phase 1: matrix 720 rows 784 cols
[2022-06-03 15:13:32] [INFO ] Computed 271 place invariants in 6 ms
[2022-06-03 15:13:33] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 15:13:33] [INFO ] [Nat]Absence check using 271 positive place invariants in 49 ms returned sat
[2022-06-03 15:13:34] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-03 15:13:34] [INFO ] State equation strengthened by 136 read => feed constraints.
[2022-06-03 15:13:35] [INFO ] After 1337ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-03 15:13:36] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:13:36] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-06-03 15:13:36] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-06-03 15:13:36] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2022-06-03 15:13:36] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2022-06-03 15:13:36] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2022-06-03 15:13:36] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2022-06-03 15:13:37] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-06-03 15:13:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1125 ms
[2022-06-03 15:13:37] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2022-06-03 15:13:37] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2022-06-03 15:13:37] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2022-06-03 15:13:37] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2022-06-03 15:13:37] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 2 ms to minimize.
[2022-06-03 15:13:38] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2022-06-03 15:13:38] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2022-06-03 15:13:38] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2022-06-03 15:13:38] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2022-06-03 15:13:38] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2022-06-03 15:13:39] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2022-06-03 15:13:39] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2022-06-03 15:13:39] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2022-06-03 15:13:39] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-06-03 15:13:39] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-06-03 15:13:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2449 ms
[2022-06-03 15:13:39] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2022-06-03 15:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-06-03 15:13:40] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2022-06-03 15:13:40] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:13:40] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-06-03 15:13:40] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-06-03 15:13:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 580 ms
[2022-06-03 15:13:40] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2022-06-03 15:13:40] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2022-06-03 15:13:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2022-06-03 15:13:41] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-06-03 15:13:41] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:13:41] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2022-06-03 15:13:41] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 0 ms to minimize.
[2022-06-03 15:13:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 554 ms
[2022-06-03 15:13:41] [INFO ] After 7214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1178 ms.
[2022-06-03 15:13:42] [INFO ] After 9670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 12551 ms.
Support contains 150 out of 784 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 784/784 places, 720/720 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 784 transition count 715
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 779 transition count 715
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 775 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 773 transition count 713
Applied a total of 22 rules in 110 ms. Remains 773 /784 variables (removed 11) and now considering 713/720 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 773/784 places, 713/720 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26790 ms. (steps per millisecond=37 ) properties (out of 9) seen :3
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 690491 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen 0
Interrupted Best-First random walk after 698408 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Interrupted Best-First random walk after 858757 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 607489 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted Best-First random walk after 524048 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 0
Interrupted Best-First random walk after 826019 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Running SMT prover for 6 properties.
// Phase 1: matrix 713 rows 773 cols
[2022-06-03 15:14:52] [INFO ] Computed 271 place invariants in 4 ms
[2022-06-03 15:14:52] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:14:52] [INFO ] [Nat]Absence check using 271 positive place invariants in 57 ms returned sat
[2022-06-03 15:14:53] [INFO ] After 808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:14:53] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-03 15:14:54] [INFO ] After 1058ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 3 ms to minimize.
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:14:55] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2022-06-03 15:14:56] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2022-06-03 15:14:56] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2022-06-03 15:14:56] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:14:56] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:14:56] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-06-03 15:14:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1688 ms
[2022-06-03 15:14:56] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2022-06-03 15:14:57] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2022-06-03 15:14:57] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-06-03 15:14:57] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2022-06-03 15:14:57] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2022-06-03 15:14:57] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:14:57] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2022-06-03 15:14:58] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-06-03 15:14:59] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2022-06-03 15:14:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2313 ms
[2022-06-03 15:14:59] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2022-06-03 15:14:59] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-06-03 15:14:59] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2022-06-03 15:14:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2022-06-03 15:14:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-06-03 15:14:59] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2022-06-03 15:14:59] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 411 ms
[2022-06-03 15:15:00] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2022-06-03 15:15:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 657 ms
[2022-06-03 15:15:00] [INFO ] After 7189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 702 ms.
[2022-06-03 15:15:01] [INFO ] After 9026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 9998 ms.
Support contains 128 out of 773 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 773/773 places, 713/713 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 773 transition count 705
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 765 transition count 705
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 765 transition count 697
Deduced a syphon composed of 8 places in 16 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 757 transition count 697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 756 transition count 696
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 756 transition count 696
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 50 place count 748 transition count 688
Renaming transitions due to excessive name length > 1024 char.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 746 transition count 691
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 746 transition count 690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 745 transition count 690
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 745 transition count 690
Applied a total of 58 rules in 175 ms. Remains 745 /773 variables (removed 28) and now considering 690/713 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 745/773 places, 690/713 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26493 ms. (steps per millisecond=37 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 688370 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen 1
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 719699 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
Interrupted Best-First random walk after 904503 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen 0
Interrupted Best-First random walk after 738105 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Running SMT prover for 4 properties.
// Phase 1: matrix 690 rows 745 cols
[2022-06-03 15:15:58] [INFO ] Computed 271 place invariants in 3 ms
[2022-06-03 15:15:58] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 15:15:58] [INFO ] [Nat]Absence check using 271 positive place invariants in 45 ms returned sat
[2022-06-03 15:15:59] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 15:15:59] [INFO ] State equation strengthened by 156 read => feed constraints.
[2022-06-03 15:16:00] [INFO ] After 695ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-03 15:16:00] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-06-03 15:16:00] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2022-06-03 15:16:00] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:16:00] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2022-06-03 15:16:00] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2022-06-03 15:16:00] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:16:00] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2022-06-03 15:16:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1795 ms
[2022-06-03 15:16:02] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2022-06-03 15:16:02] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2022-06-03 15:16:02] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2022-06-03 15:16:02] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2022-06-03 15:16:02] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2022-06-03 15:16:02] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1396 ms
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-06-03 15:16:03] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2022-06-03 15:16:04] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2022-06-03 15:16:04] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2022-06-03 15:16:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 567 ms
[2022-06-03 15:16:04] [INFO ] After 4924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 576 ms.
[2022-06-03 15:16:04] [INFO ] After 6401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8756 ms.
Support contains 107 out of 745 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 745/745 places, 690/690 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 686
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 741 transition count 686
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 741 transition count 680
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 735 transition count 680
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 46 place count 722 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 721 transition count 667
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 721 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 720 transition count 666
Applied a total of 50 rules in 79 ms. Remains 720 /745 variables (removed 25) and now considering 666/690 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 720/745 places, 666/690 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24406 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 694932 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen 0
Interrupted Best-First random walk after 765593 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
Interrupted Best-First random walk after 959866 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
Interrupted Best-First random walk after 794995 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen 0
Interrupted probabilistic random walk after 5275430 steps, run timeout after 132001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 5275430 steps, saw 3054997 distinct states, run finished after 132004 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 666 rows 720 cols
[2022-06-03 15:19:10] [INFO ] Computed 271 place invariants in 6 ms
[2022-06-03 15:19:10] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 15:19:10] [INFO ] [Nat]Absence check using 271 positive place invariants in 133 ms returned sat
[2022-06-03 15:19:11] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 15:19:11] [INFO ] State equation strengthened by 164 read => feed constraints.
[2022-06-03 15:19:12] [INFO ] After 1193ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-03 15:19:13] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-06-03 15:19:13] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:19:13] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2022-06-03 15:19:13] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2022-06-03 15:19:13] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-03 15:19:13] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-06-03 15:19:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 780 ms
[2022-06-03 15:19:14] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-06-03 15:19:14] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-06-03 15:19:14] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2022-06-03 15:19:14] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2022-06-03 15:19:14] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2022-06-03 15:19:14] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1424 ms
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-06-03 15:19:15] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2022-06-03 15:19:16] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:19:16] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2022-06-03 15:19:16] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2022-06-03 15:19:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 629 ms
[2022-06-03 15:19:16] [INFO ] After 4934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1034 ms.
[2022-06-03 15:19:17] [INFO ] After 7117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 6761 ms.
Support contains 107 out of 720 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 720/720 places, 666/666 transitions.
Applied a total of 0 rules in 15 ms. Remains 720 /720 variables (removed 0) and now considering 666/666 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 720/720 places, 666/666 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 720/720 places, 666/666 transitions.
Applied a total of 0 rules in 15 ms. Remains 720 /720 variables (removed 0) and now considering 666/666 (removed 0) transitions.
// Phase 1: matrix 666 rows 720 cols
[2022-06-03 15:19:24] [INFO ] Computed 271 place invariants in 3 ms
[2022-06-03 15:19:24] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 666 rows 720 cols
[2022-06-03 15:19:24] [INFO ] Computed 271 place invariants in 3 ms
[2022-06-03 15:19:25] [INFO ] State equation strengthened by 164 read => feed constraints.
[2022-06-03 15:19:26] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
[2022-06-03 15:19:26] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 666 rows 720 cols
[2022-06-03 15:19:26] [INFO ] Computed 271 place invariants in 3 ms
[2022-06-03 15:19:26] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 720/720 places, 666/666 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26710 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 780295 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=156 ) properties seen 0
Interrupted Best-First random walk after 858628 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 878929 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Running SMT prover for 3 properties.
// Phase 1: matrix 666 rows 720 cols
[2022-06-03 15:20:08] [INFO ] Computed 271 place invariants in 5 ms
[2022-06-03 15:20:08] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 15:20:08] [INFO ] [Nat]Absence check using 271 positive place invariants in 46 ms returned sat
[2022-06-03 15:20:09] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 15:20:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2022-06-03 15:20:10] [INFO ] After 684ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 15:20:10] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-06-03 15:20:10] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2022-06-03 15:20:10] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-06-03 15:20:10] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2022-06-03 15:20:11] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1963 ms
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-06-03 15:20:12] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2022-06-03 15:20:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2022-06-03 15:20:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2022-06-03 15:20:13] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2022-06-03 15:20:13] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2022-06-03 15:20:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 929 ms
[2022-06-03 15:20:13] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-06-03 15:20:13] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-06-03 15:20:13] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-06-03 15:20:14] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2022-06-03 15:20:14] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-06-03 15:20:14] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-03 15:20:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 636 ms
[2022-06-03 15:20:14] [INFO ] After 4787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 566 ms.
[2022-06-03 15:20:14] [INFO ] After 6099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3758 ms.
Support contains 106 out of 720 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 720/720 places, 666/666 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 720 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 719 transition count 665
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 718 transition count 666
Applied a total of 4 rules in 33 ms. Remains 718 /720 variables (removed 2) and now considering 666/666 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 718/720 places, 666/666 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14835 ms. (steps per millisecond=67 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 881536 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4598 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 666 rows 718 cols
[2022-06-03 15:20:43] [INFO ] Computed 271 place invariants in 3 ms
[2022-06-03 15:20:43] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:20:43] [INFO ] [Nat]Absence check using 271 positive place invariants in 41 ms returned sat
[2022-06-03 15:20:43] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:20:43] [INFO ] State equation strengthened by 167 read => feed constraints.
[2022-06-03 15:20:44] [INFO ] After 736ms SMT Verify possible using 167 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:20:44] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2022-06-03 15:20:44] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2022-06-03 15:20:45] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2022-06-03 15:20:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1299 ms
[2022-06-03 15:20:46] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-06-03 15:20:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-06-03 15:20:46] [INFO ] After 2504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 449 ms.
[2022-06-03 15:20:46] [INFO ] After 3559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1004 ms.
Support contains 78 out of 718 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 718/718 places, 666/666 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 718 transition count 656
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 708 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 707 transition count 655
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 22 place count 707 transition count 648
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 36 place count 700 transition count 648
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 68 place count 684 transition count 632
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 78 place count 679 transition count 636
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 679 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 678 transition count 635
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 678 transition count 635
Applied a total of 83 rules in 69 ms. Remains 678 /718 variables (removed 40) and now considering 635/666 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 678/718 places, 635/666 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10819 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 888675 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4638 ms. (steps per millisecond=215 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4383632 steps, run timeout after 60001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 4383632 steps, saw 2886571 distinct states, run finished after 60003 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 635 rows 678 cols
[2022-06-03 15:22:08] [INFO ] Computed 271 place invariants in 3 ms
[2022-06-03 15:22:08] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:22:08] [INFO ] [Nat]Absence check using 271 positive place invariants in 93 ms returned sat
[2022-06-03 15:22:09] [INFO ] After 654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:09] [INFO ] State equation strengthened by 177 read => feed constraints.
[2022-06-03 15:22:09] [INFO ] After 484ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:10] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-06-03 15:22:10] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:22:10] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-06-03 15:22:10] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2022-06-03 15:22:10] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-06-03 15:22:10] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2022-06-03 15:22:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1715 ms
[2022-06-03 15:22:12] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-06-03 15:22:12] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2022-06-03 15:22:12] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-06-03 15:22:12] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-06-03 15:22:12] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2022-06-03 15:22:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 535 ms
[2022-06-03 15:22:12] [INFO ] After 3150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 690 ms.
[2022-06-03 15:22:13] [INFO ] After 4788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1922 ms.
Support contains 78 out of 678 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 678/678 places, 635/635 transitions.
Applied a total of 0 rules in 13 ms. Remains 678 /678 variables (removed 0) and now considering 635/635 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 678/678 places, 635/635 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 678/678 places, 635/635 transitions.
Applied a total of 0 rules in 12 ms. Remains 678 /678 variables (removed 0) and now considering 635/635 (removed 0) transitions.
// Phase 1: matrix 635 rows 678 cols
[2022-06-03 15:22:15] [INFO ] Computed 271 place invariants in 2 ms
[2022-06-03 15:22:15] [INFO ] Implicit Places using invariants in 499 ms returned []
// Phase 1: matrix 635 rows 678 cols
[2022-06-03 15:22:15] [INFO ] Computed 271 place invariants in 2 ms
[2022-06-03 15:22:16] [INFO ] State equation strengthened by 177 read => feed constraints.
[2022-06-03 15:22:17] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 2141 ms to find 0 implicit places.
[2022-06-03 15:22:17] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 635 rows 678 cols
[2022-06-03 15:22:17] [INFO ] Computed 271 place invariants in 2 ms
[2022-06-03 15:22:17] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 678/678 places, 635/635 transitions.
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 678 transition count 635
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 678 transition count 631
Applied a total of 100 rules in 41 ms. Remains 678 /678 variables (removed 0) and now considering 631/635 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 631 rows 678 cols
[2022-06-03 15:22:17] [INFO ] Computed 271 place invariants in 4 ms
[2022-06-03 15:22:18] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:22:18] [INFO ] [Nat]Absence check using 271 positive place invariants in 41 ms returned sat
[2022-06-03 15:22:18] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:18] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-06-03 15:22:19] [INFO ] After 386ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:19] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2022-06-03 15:22:19] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2022-06-03 15:22:19] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2022-06-03 15:22:19] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2022-06-03 15:22:19] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2022-06-03 15:22:19] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2022-06-03 15:22:20] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-06-03 15:22:21] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-06-03 15:22:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1852 ms
[2022-06-03 15:22:21] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2022-06-03 15:22:21] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-03 15:22:21] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-06-03 15:22:21] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-06-03 15:22:21] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-06-03 15:22:22] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2022-06-03 15:22:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 659 ms
[2022-06-03 15:22:22] [INFO ] After 3385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 274 ms.
[2022-06-03 15:22:22] [INFO ] After 4201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:22] [INFO ] Flatten gal took : 187 ms
[2022-06-03 15:22:22] [INFO ] Flatten gal took : 54 ms
[2022-06-03 15:22:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11329524332122687619.gal : 71 ms
[2022-06-03 15:22:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1508740656589282947.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/ReachabilityCardinality11329524332122687619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1508740656589282947.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/ReachabilityCardinality1508740656589282947.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 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 84
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :84 after 10695
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10695 after 1.15474e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.89917e+12 after 4.35574e+12
Detected timeout of ITS tools.
[2022-06-03 15:22:38] [INFO ] Flatten gal took : 72 ms
[2022-06-03 15:22:38] [INFO ] Applying decomposition
[2022-06-03 15:22:38] [INFO ] Flatten gal took : 42 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/graph13310319459804477135.txt' '-o' '/tmp/graph13310319459804477135.bin' '-w' '/tmp/graph13310319459804477135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13310319459804477135.bin' '-l' '-1' '-v' '-w' '/tmp/graph13310319459804477135.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:22:38] [INFO ] Decomposing Gal with order
[2022-06-03 15:22:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:22:38] [INFO ] Removed a total of 335 redundant transitions.
[2022-06-03 15:22:38] [INFO ] Flatten gal took : 149 ms
[2022-06-03 15:22:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 46 ms.
[2022-06-03 15:22:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13786364086840464804.gal : 11 ms
[2022-06-03 15:22:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1160780553448646716.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/ReachabilityCardinality13786364086840464804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1160780553448646716.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/ReachabilityCardinality1160780553448646716.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 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 86
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :86 after 86
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :86 after 248
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :248 after 288689
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :288689 after 1.03926e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6.31877e+14 after 1.7332e+19
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14056240864361316635
[2022-06-03 15:22:53] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14056240864361316635
Running compilation step : cd /tmp/ltsmin14056240864361316635;'/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 1136 ms.
Running link step : cd /tmp/ltsmin14056240864361316635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14056240864361316635;'/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' 'ShieldIIPtPT030BReachabilityFireability02==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 15:23:09] [INFO ] Flatten gal took : 72 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3289495497564577045
[2022-06-03 15:23:09] [INFO ] Computing symmetric may disable matrix : 635 transitions.
[2022-06-03 15:23:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:23:09] [INFO ] Computing symmetric may enable matrix : 635 transitions.
[2022-06-03 15:23:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:23:09] [INFO ] Applying decomposition
[2022-06-03 15:23:09] [INFO ] Flatten gal took : 105 ms
[2022-06-03 15:23:09] [INFO ] Computing Do-Not-Accords matrix : 635 transitions.
[2022-06-03 15:23:09] [INFO ] Flatten gal took : 81 ms
[2022-06-03 15:23:09] [INFO ] Computation of Completed DNA matrix. took 92 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:23:09] [INFO ] Built C files in 297ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3289495497564577045
Running compilation step : cd /tmp/ltsmin3289495497564577045;'/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 15:23:09] [INFO ] Input system was already deterministic with 635 transitions.
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/graph10438048823555120133.txt' '-o' '/tmp/graph10438048823555120133.bin' '-w' '/tmp/graph10438048823555120133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10438048823555120133.bin' '-l' '-1' '-v' '-w' '/tmp/graph10438048823555120133.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:23:09] [INFO ] Decomposing Gal with order
[2022-06-03 15:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:23:09] [INFO ] Removed a total of 459 redundant transitions.
[2022-06-03 15:23:09] [INFO ] Flatten gal took : 118 ms
[2022-06-03 15:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 51 ms.
[2022-06-03 15:23:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3288376060790940087.gal : 19 ms
[2022-06-03 15:23:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1635890314809403656.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/ReachabilityFireability3288376060790940087.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1635890314809403656.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/ReachabilityFireability1635890314809403656.prop.
[2022-06-03 15:23:10] [INFO ] Ran tautology test, simplified 0 / 2 in 933 ms.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 2679
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2679 after 866058
Reachability property ShieldIIPt-PT-030B-ReachabilityFireability-02 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.95568e+17 after 6.98298e+44
[2022-06-03 15:23:10] [INFO ] BMC solution for property ShieldIIPt-PT-030B-ReachabilityFireability-02(UNSAT) depth K=0 took 211 ms
[2022-06-03 15:23:10] [INFO ] BMC solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(UNSAT) depth K=0 took 59 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.98298e+44 after 5.32463e+47
[2022-06-03 15:23:10] [INFO ] BMC solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(UNSAT) depth K=1 took 27 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 635 rows 678 cols
[2022-06-03 15:23:11] [INFO ] Computed 271 place invariants in 1 ms
[2022-06-03 15:23:11] [INFO ] Computed 271 place invariants in 2 ms
[2022-06-03 15:23:11] [INFO ] BMC solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(UNSAT) depth K=2 took 1057 ms
Compilation finished in 3483 ms.
Running link step : cd /tmp/ltsmin3289495497564577045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin3289495497564577045;'/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' 'ShieldIIPtPT030BReachabilityFireability12==true'
[2022-06-03 15:23:15] [INFO ] Proved 678 variables to be positive in 4281 ms
[2022-06-03 15:23:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-030B-ReachabilityFireability-12
[2022-06-03 15:23:15] [INFO ] KInduction solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(SAT) depth K=0 took 400 ms
[2022-06-03 15:23:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-030B-ReachabilityFireability-12
[2022-06-03 15:23:17] [INFO ] KInduction solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(SAT) depth K=1 took 1132 ms
[2022-06-03 15:23:21] [INFO ] BMC solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(UNSAT) depth K=3 took 9203 ms
Reachability property ShieldIIPt-PT-030B-ReachabilityFireability-12 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.00313e+65,40.6111,538544,5731,284,989652,1905,1073,3.671e+06,157,17577,0
Total reachable state count : 3.003133487868386330635146518752184661038e+65

Verifying 2 reachability properties.
[2022-06-03 15:25:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-030B-ReachabilityFireability-12
[2022-06-03 15:25:08] [INFO ] KInduction solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(SAT) depth K=2 took 111672 ms
[2022-06-03 15:38:24] [INFO ] BMC solution for property ShieldIIPt-PT-030B-ReachabilityFireability-12(UNSAT) depth K=4 took 903160 ms
[2022-06-03 15:38:24] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
Detected timeout of ITS tools.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2173239 ms.

BK_STOP 1654271233369

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
++ 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="ShieldIIPt-PT-030B"
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 ShieldIIPt-PT-030B, 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-165286025000303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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