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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 00:58 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.5K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 30 00:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 00:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 30 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:02 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 489K 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 ShieldRVt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654283554069

Running Version 202205111006
[2022-06-03 19:12:35] [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 19:12:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 19:12:35] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2022-06-03 19:12:35] [INFO ] Transformed 2003 places.
[2022-06-03 19:12:35] [INFO ] Transformed 2003 transitions.
[2022-06-03 19:12:35] [INFO ] Found NUPN structural information;
[2022-06-03 19:12:35] [INFO ] Parsed PT model containing 2003 places and 2003 transitions in 320 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 16) seen :8
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2022-06-03 19:12:36] [INFO ] Computed 161 place invariants in 31 ms
[2022-06-03 19:12:37] [INFO ] [Real]Absence check using 161 positive place invariants in 128 ms returned sat
[2022-06-03 19:12:37] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 19:12:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 65 ms returned sat
[2022-06-03 19:12:43] [INFO ] After 4680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 19:12:44] [INFO ] Deduced a trap composed of 22 places in 1241 ms of which 20 ms to minimize.
[2022-06-03 19:12:45] [INFO ] Deduced a trap composed of 34 places in 447 ms of which 1 ms to minimize.
[2022-06-03 19:12:45] [INFO ] Deduced a trap composed of 44 places in 397 ms of which 2 ms to minimize.
[2022-06-03 19:12:46] [INFO ] Deduced a trap composed of 50 places in 369 ms of which 2 ms to minimize.
[2022-06-03 19:12:46] [INFO ] Deduced a trap composed of 51 places in 619 ms of which 1 ms to minimize.
[2022-06-03 19:12:47] [INFO ] Deduced a trap composed of 34 places in 344 ms of which 1 ms to minimize.
[2022-06-03 19:12:47] [INFO ] Deduced a trap composed of 63 places in 326 ms of which 2 ms to minimize.
[2022-06-03 19:12:48] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 1 ms to minimize.
[2022-06-03 19:12:48] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 1 ms to minimize.
[2022-06-03 19:12:48] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 1 ms to minimize.
[2022-06-03 19:12:49] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 1 ms to minimize.
[2022-06-03 19:12:49] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 1 ms to minimize.
[2022-06-03 19:12:49] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 1 ms to minimize.
[2022-06-03 19:12:50] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 2 ms to minimize.
[2022-06-03 19:12:50] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 1 ms to minimize.
[2022-06-03 19:12:50] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 1 ms to minimize.
[2022-06-03 19:12:51] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 0 ms to minimize.
[2022-06-03 19:12:51] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 1 ms to minimize.
[2022-06-03 19:12:51] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 1 ms to minimize.
[2022-06-03 19:12:52] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 1 ms to minimize.
[2022-06-03 19:12:52] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 1 ms to minimize.
[2022-06-03 19:12:52] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 0 ms to minimize.
[2022-06-03 19:12:53] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 0 ms to minimize.
[2022-06-03 19:12:53] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 0 ms to minimize.
[2022-06-03 19:12:53] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 1 ms to minimize.
[2022-06-03 19:12:53] [INFO ] Deduced a trap composed of 58 places in 208 ms of which 0 ms to minimize.
[2022-06-03 19:12:54] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 1 ms to minimize.
[2022-06-03 19:12:54] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 1 ms to minimize.
[2022-06-03 19:12:54] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2022-06-03 19:12:55] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 1 ms to minimize.
[2022-06-03 19:12:55] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 1 ms to minimize.
[2022-06-03 19:12:55] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 11951 ms
[2022-06-03 19:12:55] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 1 ms to minimize.
[2022-06-03 19:12:56] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 0 ms to minimize.
[2022-06-03 19:12:56] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 1 ms to minimize.
[2022-06-03 19:12:56] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 4 ms to minimize.
[2022-06-03 19:12:57] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 1 ms to minimize.
[2022-06-03 19:12:57] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 0 ms to minimize.
[2022-06-03 19:12:57] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 1 ms to minimize.
[2022-06-03 19:12:58] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 1 ms to minimize.
[2022-06-03 19:12:58] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 1 ms to minimize.
[2022-06-03 19:12:58] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 1 ms to minimize.
[2022-06-03 19:12:59] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 1 ms to minimize.
[2022-06-03 19:12:59] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2022-06-03 19:12:59] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 0 ms to minimize.
[2022-06-03 19:13:00] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2022-06-03 19:13:00] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2022-06-03 19:13:00] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 1 ms to minimize.
[2022-06-03 19:13:00] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 1 ms to minimize.
[2022-06-03 19:13:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5539 ms
[2022-06-03 19:13:02] [INFO ] Deduced a trap composed of 32 places in 368 ms of which 1 ms to minimize.
[2022-06-03 19:13:02] [INFO ] Deduced a trap composed of 34 places in 356 ms of which 1 ms to minimize.
[2022-06-03 19:13:02] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 1 ms to minimize.
[2022-06-03 19:13:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 19:13:02] [INFO ] After 25172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 21901 ms.
Support contains 71 out of 2003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 578 transitions
Trivial Post-agglo rules discarded 578 transitions
Performed 578 trivial Post agglomeration. Transition count delta: 578
Iterating post reduction 0 with 578 rules applied. Total rules applied 578 place count 2003 transition count 1425
Reduce places removed 578 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 580 rules applied. Total rules applied 1158 place count 1425 transition count 1423
Reduce places removed 1 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 27 rules applied. Total rules applied 1185 place count 1424 transition count 1397
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1211 place count 1398 transition count 1397
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 159 Pre rules applied. Total rules applied 1211 place count 1398 transition count 1238
Deduced a syphon composed of 159 places in 2 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 318 rules applied. Total rules applied 1529 place count 1239 transition count 1238
Discarding 256 places :
Symmetric choice reduction at 4 with 256 rule applications. Total rules 1785 place count 983 transition count 982
Iterating global reduction 4 with 256 rules applied. Total rules applied 2041 place count 983 transition count 982
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 2041 place count 983 transition count 880
Deduced a syphon composed of 102 places in 4 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 2245 place count 881 transition count 880
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 2 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 4 with 690 rules applied. Total rules applied 2935 place count 536 transition count 535
Renaming transitions due to excessive name length > 1024 char.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 3133 place count 437 transition count 611
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3134 place count 437 transition count 610
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3142 place count 437 transition count 602
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3150 place count 429 transition count 602
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3153 place count 429 transition count 599
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3154 place count 429 transition count 599
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3155 place count 428 transition count 598
Applied a total of 3155 rules in 511 ms. Remains 428 /2003 variables (removed 1575) and now considering 598/2003 (removed 1405) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/2003 places, 598/2003 transitions.
Incomplete random walk after 1000000 steps, including 245 resets, run finished after 19649 ms. (steps per millisecond=50 ) properties (out of 8) seen :5
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 32 resets, run finished after 4347 ms. (steps per millisecond=230 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 30 resets, run finished after 3659 ms. (steps per millisecond=273 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34 resets, run finished after 3504 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 598 rows 428 cols
[2022-06-03 19:13:56] [INFO ] Computed 161 place invariants in 3 ms
[2022-06-03 19:13:56] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 19:13:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned sat
[2022-06-03 19:13:57] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 19:13:57] [INFO ] State equation strengthened by 206 read => feed constraints.
[2022-06-03 19:13:57] [INFO ] After 212ms SMT Verify possible using 206 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 19:13:57] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2022-06-03 19:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-06-03 19:13:57] [INFO ] After 480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-06-03 19:13:57] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 896 ms.
Support contains 28 out of 428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 428/428 places, 598/598 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 428 transition count 586
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 416 transition count 586
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 24 place count 416 transition count 573
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 50 place count 403 transition count 573
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 401 transition count 571
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 401 transition count 571
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 100 place count 378 transition count 548
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 120 place count 368 transition count 563
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 368 transition count 561
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 368 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 367 transition count 560
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 367 transition count 560
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 364 transition count 557
Applied a total of 129 rules in 126 ms. Remains 364 /428 variables (removed 64) and now considering 557/598 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 364/428 places, 557/598 transitions.
Incomplete random walk after 1000000 steps, including 195 resets, run finished after 13282 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 4613 ms. (steps per millisecond=216 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 17 resets, run finished after 3339 ms. (steps per millisecond=299 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 3345 ms. (steps per millisecond=298 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 13108000 steps, run timeout after 72001 ms. (steps per millisecond=182 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 13108000 steps, saw 2761863 distinct states, run finished after 72002 ms. (steps per millisecond=182 ) properties seen :2
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 557 rows 364 cols
[2022-06-03 19:15:35] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-03 19:15:35] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:15:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 18 ms returned sat
[2022-06-03 19:15:35] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:15:35] [INFO ] State equation strengthened by 210 read => feed constraints.
[2022-06-03 19:15:35] [INFO ] After 211ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:15:35] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-06-03 19:15:36] [INFO ] After 800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 130 ms.
Support contains 26 out of 364 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 364/364 places, 557/557 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 364 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 363 transition count 556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 362 transition count 555
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 362 transition count 555
Applied a total of 5 rules in 32 ms. Remains 362 /364 variables (removed 2) and now considering 555/557 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/364 places, 555/557 transitions.
Incomplete random walk after 1000000 steps, including 212 resets, run finished after 4073 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 32 resets, run finished after 2746 ms. (steps per millisecond=364 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3273968 steps, run timeout after 18001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 3273968 steps, saw 1002779 distinct states, run finished after 18001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:01] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-03 19:16:01] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:16:01] [INFO ] [Nat]Absence check using 161 positive place invariants in 24 ms returned sat
[2022-06-03 19:16:01] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:16:01] [INFO ] State equation strengthened by 211 read => feed constraints.
[2022-06-03 19:16:01] [INFO ] After 284ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:16:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-03 19:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-06-03 19:16:02] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-06-03 19:16:02] [INFO ] After 937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 209 ms.
Support contains 26 out of 362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 362/362 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 362 /362 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/362 places, 555/555 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 362/362 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 362 /362 variables (removed 0) and now considering 555/555 (removed 0) transitions.
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:02] [INFO ] Computed 161 place invariants in 1 ms
[2022-06-03 19:16:02] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:02] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-03 19:16:02] [INFO ] State equation strengthened by 211 read => feed constraints.
[2022-06-03 19:16:03] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2022-06-03 19:16:03] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:03] [INFO ] Computed 161 place invariants in 1 ms
[2022-06-03 19:16:04] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 362/362 places, 555/555 transitions.
Incomplete random walk after 1000000 steps, including 212 resets, run finished after 4134 ms. (steps per millisecond=241 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 2799 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3228148 steps, run timeout after 18001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 3228148 steps, saw 994825 distinct states, run finished after 18001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:29] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-03 19:16:29] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:16:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2022-06-03 19:16:29] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:16:29] [INFO ] State equation strengthened by 211 read => feed constraints.
[2022-06-03 19:16:29] [INFO ] After 289ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:16:29] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-06-03 19:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-03 19:16:29] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-06-03 19:16:30] [INFO ] After 952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 214 ms.
Support contains 26 out of 362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 362/362 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/362 places, 555/555 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 362/362 places, 555/555 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 555/555 (removed 0) transitions.
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:30] [INFO ] Computed 161 place invariants in 3 ms
[2022-06-03 19:16:30] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:30] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-03 19:16:30] [INFO ] State equation strengthened by 211 read => feed constraints.
[2022-06-03 19:16:31] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2022-06-03 19:16:31] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 555 rows 362 cols
[2022-06-03 19:16:31] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-03 19:16:31] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 362/362 places, 555/555 transitions.
Graph (trivial) has 133 edges and 362 vertex of which 4 / 362 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1257 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 356 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 354 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 354 transition count 541
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 354 transition count 535
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 38 place count 354 transition count 535
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 354 transition count 519
Applied a total of 54 rules in 50 ms. Remains 354 /362 variables (removed 8) and now considering 519/555 (removed 36) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 354 cols
[2022-06-03 19:16:31] [INFO ] Computed 157 place invariants in 1 ms
[2022-06-03 19:16:31] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:16:31] [INFO ] [Nat]Absence check using 157 positive place invariants in 26 ms returned sat
[2022-06-03 19:16:32] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:16:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 19:16:32] [INFO ] After 38ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:16:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-06-03 19:16:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-03 19:16:32] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-03 19:16:32] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:16:32] [INFO ] Flatten gal took : 84 ms
[2022-06-03 19:16:32] [INFO ] Flatten gal took : 39 ms
[2022-06-03 19:16:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4906761713966248385.gal : 20 ms
[2022-06-03 19:16:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12126066247124940392.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/ReachabilityCardinality4906761713966248385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12126066247124940392.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/ReachabilityCardinality12126066247124940392.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 50
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :50 after 218
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :218 after 650
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35100 after 160550
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :160550 after 212973
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :212973 after 6.79664e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.79664e+08 after 3.08928e+15
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.08928e+15 after 3.99228e+23
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,8.19365e+51,0.364183,14136,2,1361,16,41667,7,0,1969,52456,0
Total reachable state count : 8.193650607736434281365817825716323449357e+51

Verifying 1 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityFireability-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityFireability-02,1.05423e+49,0.385867,14136,2,6139,16,41667,7,0,2007,52456,0
[2022-06-03 19:16:33] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2291336369842373977
[2022-06-03 19:16:33] [INFO ] Computing symmetric may disable matrix : 555 transitions.
[2022-06-03 19:16:33] [INFO ] Applying decomposition
[2022-06-03 19:16:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:16:33] [INFO ] Computing symmetric may enable matrix : 555 transitions.
[2022-06-03 19:16:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:16:33] [INFO ] Flatten gal took : 44 ms
[2022-06-03 19:16:33] [INFO ] Flatten gal took : 130 ms
[2022-06-03 19:16:33] [INFO ] Computing Do-Not-Accords matrix : 555 transitions.
[2022-06-03 19:16:33] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:16:33] [INFO ] Input system was already deterministic with 555 transitions.
[2022-06-03 19:16:33] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2291336369842373977
Running compilation step : cd /tmp/ltsmin2291336369842373977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph9617674387653764318.txt' '-o' '/tmp/graph9617674387653764318.bin' '-w' '/tmp/graph9617674387653764318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9617674387653764318.bin' '-l' '-1' '-v' '-w' '/tmp/graph9617674387653764318.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:16:33] [INFO ] Decomposing Gal with order
[2022-06-03 19:16:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:16:33] [INFO ] Removed a total of 925 redundant transitions.
[2022-06-03 19:16:33] [INFO ] Flatten gal took : 111 ms
[2022-06-03 19:16:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 462 labels/synchronizations in 32 ms.
[2022-06-03 19:16:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14027094986761825400.gal : 9 ms
[2022-06-03 19:16:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14587469829666560869.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/ReachabilityFireability14027094986761825400.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14587469829666560869.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...300
Loading property file /tmp/ReachabilityFireability14587469829666560869.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 74
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :74 after 650
[2022-06-03 19:16:34] [INFO ] Ran tautology test, simplified 0 / 1 in 671 ms.
[2022-06-03 19:16:34] [INFO ] BMC solution for property ShieldRVt-PT-040B-ReachabilityFireability-02(UNSAT) depth K=0 took 32 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.3903e+52,0.367178,17524,364,29,27853,147,897,57427,87,486,0
Total reachable state count : 8.390298237197790712435511907053189271423e+52

Verifying 1 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityFireability-02 is true.
[2022-06-03 19:16:34] [INFO ] BMC solution for property ShieldRVt-PT-040B-ReachabilityFireability-02(UNSAT) depth K=1 took 2 ms
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityFireability-02,4.33526e+47,0.370611,17524,142,23,27853,147,944,57427,94,486,521
[2022-06-03 19:16:34] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 19:16:34] [WARNING] Script execution failed on command (define-fun tr25 ((step Int)) Bool (trsrc25 (select s step) (select s (+ step 1)))) with error
[2022-06-03 19:16:34] [WARNING] Script execution failed on command (define-fun _enabledsrc__26 ((src (Array Int Int))) Bool (>= (select src 109) 1)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Exception in thread "Thread-9" java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:60)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 19:16:34] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 239037 ms.

BK_STOP 1654283794451

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

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