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-165286026101022.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026101022
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654283476777

Running Version 202205111006
[2022-06-03 19:11:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 19:11:18] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2022-06-03 19:11:18] [INFO ] Transformed 2003 places.
[2022-06-03 19:11:18] [INFO ] Transformed 2003 transitions.
[2022-06-03 19:11:18] [INFO ] Found NUPN structural information;
[2022-06-03 19:11:18] [INFO ] Parsed PT model containing 2003 places and 2003 transitions in 340 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 13) seen :7
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2022-06-03 19:11:19] [INFO ] Computed 161 place invariants in 32 ms
[2022-06-03 19:11:20] [INFO ] After 740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 19:11:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 72 ms returned sat
[2022-06-03 19:11:22] [INFO ] After 1938ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-06-03 19:11:23] [INFO ] Deduced a trap composed of 29 places in 366 ms of which 6 ms to minimize.
[2022-06-03 19:11:23] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 2 ms to minimize.
[2022-06-03 19:11:24] [INFO ] Deduced a trap composed of 64 places in 311 ms of which 2 ms to minimize.
[2022-06-03 19:11:24] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 1 ms to minimize.
[2022-06-03 19:11:24] [INFO ] Deduced a trap composed of 42 places in 319 ms of which 1 ms to minimize.
[2022-06-03 19:11:25] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 1 ms to minimize.
[2022-06-03 19:11:25] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 1 ms to minimize.
[2022-06-03 19:11:26] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 1 ms to minimize.
[2022-06-03 19:11:26] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 0 ms to minimize.
[2022-06-03 19:11:26] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2022-06-03 19:11:27] [INFO ] Deduced a trap composed of 52 places in 274 ms of which 1 ms to minimize.
[2022-06-03 19:11:27] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 0 ms to minimize.
[2022-06-03 19:11:27] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 1 ms to minimize.
[2022-06-03 19:11:28] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 1 ms to minimize.
[2022-06-03 19:11:28] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 0 ms to minimize.
[2022-06-03 19:11:28] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 1 ms to minimize.
[2022-06-03 19:11:29] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 1 ms to minimize.
[2022-06-03 19:11:29] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 0 ms to minimize.
[2022-06-03 19:11:29] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 1 ms to minimize.
[2022-06-03 19:11:29] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 1 ms to minimize.
[2022-06-03 19:11:30] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 1 ms to minimize.
[2022-06-03 19:11:30] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 1 ms to minimize.
[2022-06-03 19:11:30] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 1 ms to minimize.
[2022-06-03 19:11:31] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 1 ms to minimize.
[2022-06-03 19:11:31] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 1 ms to minimize.
[2022-06-03 19:11:31] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 1 ms to minimize.
[2022-06-03 19:11:31] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 1 ms to minimize.
[2022-06-03 19:11:31] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9055 ms
[2022-06-03 19:11:32] [INFO ] Deduced a trap composed of 24 places in 549 ms of which 1 ms to minimize.
[2022-06-03 19:11:33] [INFO ] Deduced a trap composed of 36 places in 537 ms of which 1 ms to minimize.
[2022-06-03 19:11:34] [INFO ] Deduced a trap composed of 46 places in 555 ms of which 2 ms to minimize.
[2022-06-03 19:11:34] [INFO ] Deduced a trap composed of 40 places in 540 ms of which 2 ms to minimize.
[2022-06-03 19:11:35] [INFO ] Deduced a trap composed of 36 places in 527 ms of which 1 ms to minimize.
[2022-06-03 19:11:35] [INFO ] Deduced a trap composed of 50 places in 487 ms of which 1 ms to minimize.
[2022-06-03 19:11:36] [INFO ] Deduced a trap composed of 65 places in 500 ms of which 2 ms to minimize.
[2022-06-03 19:11:37] [INFO ] Deduced a trap composed of 26 places in 486 ms of which 3 ms to minimize.
[2022-06-03 19:11:37] [INFO ] Deduced a trap composed of 39 places in 492 ms of which 2 ms to minimize.
[2022-06-03 19:11:38] [INFO ] Deduced a trap composed of 23 places in 473 ms of which 1 ms to minimize.
[2022-06-03 19:11:38] [INFO ] Deduced a trap composed of 47 places in 473 ms of which 1 ms to minimize.
[2022-06-03 19:11:39] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 1 ms to minimize.
[2022-06-03 19:11:39] [INFO ] Deduced a trap composed of 32 places in 474 ms of which 1 ms to minimize.
[2022-06-03 19:11:40] [INFO ] Deduced a trap composed of 26 places in 452 ms of which 1 ms to minimize.
[2022-06-03 19:11:40] [INFO ] Deduced a trap composed of 34 places in 445 ms of which 1 ms to minimize.
[2022-06-03 19:11:41] [INFO ] Deduced a trap composed of 48 places in 425 ms of which 2 ms to minimize.
[2022-06-03 19:11:41] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 2 ms to minimize.
[2022-06-03 19:11:42] [INFO ] Deduced a trap composed of 49 places in 454 ms of which 1 ms to minimize.
[2022-06-03 19:11:43] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 1 ms to minimize.
[2022-06-03 19:11:43] [INFO ] Deduced a trap composed of 28 places in 441 ms of which 1 ms to minimize.
[2022-06-03 19:11:44] [INFO ] Deduced a trap composed of 37 places in 461 ms of which 1 ms to minimize.
[2022-06-03 19:11:44] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 1 ms to minimize.
[2022-06-03 19:11:45] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 1 ms to minimize.
[2022-06-03 19:11:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 19:11:45] [INFO ] After 25111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 15143 ms.
Support contains 30 out of 2003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 615 transitions
Trivial Post-agglo rules discarded 615 transitions
Performed 615 trivial Post agglomeration. Transition count delta: 615
Iterating post reduction 0 with 615 rules applied. Total rules applied 615 place count 2003 transition count 1388
Reduce places removed 615 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 617 rules applied. Total rules applied 1232 place count 1388 transition count 1386
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 1239 place count 1387 transition count 1380
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1245 place count 1381 transition count 1380
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 161 Pre rules applied. Total rules applied 1245 place count 1381 transition count 1219
Deduced a syphon composed of 161 places in 4 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 4 with 322 rules applied. Total rules applied 1567 place count 1220 transition count 1219
Discarding 270 places :
Symmetric choice reduction at 4 with 270 rule applications. Total rules 1837 place count 950 transition count 949
Iterating global reduction 4 with 270 rules applied. Total rules applied 2107 place count 950 transition count 949
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 115 Pre rules applied. Total rules applied 2107 place count 950 transition count 834
Deduced a syphon composed of 115 places in 4 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 4 with 230 rules applied. Total rules applied 2337 place count 835 transition count 834
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 2 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 4 with 698 rules applied. Total rules applied 3035 place count 486 transition count 485
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3237 place count 385 transition count 578
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 4 with 26 rules applied. Total rules applied 3263 place count 372 transition count 591
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3264 place count 372 transition count 590
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3266 place count 372 transition count 588
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3268 place count 370 transition count 588
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3270 place count 370 transition count 586
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3271 place count 369 transition count 585
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3272 place count 368 transition count 585
Applied a total of 3272 rules in 485 ms. Remains 368 /2003 variables (removed 1635) and now considering 585/2003 (removed 1418) transitions.
Finished structural reductions, in 1 iterations. Remains : 368/2003 places, 585/2003 transitions.
Incomplete random walk after 1000000 steps, including 271 resets, run finished after 11640 ms. (steps per millisecond=85 ) properties (out of 4) seen :2
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 169 resets, run finished after 3045 ms. (steps per millisecond=328 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 2859 ms. (steps per millisecond=349 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 585 rows 368 cols
[2022-06-03 19:12:18] [INFO ] Computed 160 place invariants in 6 ms
[2022-06-03 19:12:18] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 19:12:18] [INFO ] [Nat]Absence check using 160 positive place invariants in 23 ms returned sat
[2022-06-03 19:12:18] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 19:12:18] [INFO ] State equation strengthened by 331 read => feed constraints.
[2022-06-03 19:12:18] [INFO ] After 284ms SMT Verify possible using 331 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 19:12:19] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-03 19:12:19] [INFO ] After 768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 137 ms.
Support contains 11 out of 368 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 368/368 places, 585/585 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 368 transition count 579
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 362 transition count 579
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 362 transition count 573
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 24 place count 356 transition count 573
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 48 place count 344 transition count 561
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 340 transition count 567
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 340 transition count 567
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 338 transition count 565
Applied a total of 59 rules in 80 ms. Remains 338 /368 variables (removed 30) and now considering 565/585 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 338/368 places, 565/585 transitions.
Incomplete random walk after 1000000 steps, including 257 resets, run finished after 10407 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 175 resets, run finished after 3000 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 33 resets, run finished after 2797 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 8249349 steps, run timeout after 48001 ms. (steps per millisecond=171 ) properties seen :{1=1}
Probabilistic random walk after 8249349 steps, saw 1556351 distinct states, run finished after 48003 ms. (steps per millisecond=171 ) properties seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 338 cols
[2022-06-03 19:13:23] [INFO ] Computed 160 place invariants in 5 ms
[2022-06-03 19:13:23] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:13:23] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2022-06-03 19:13:23] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:13:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-03 19:13:23] [INFO ] After 29ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:13:23] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-03 19:13:24] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 163 ms.
Support contains 10 out of 338 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 338/338 places, 565/565 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 337 transition count 565
Applied a total of 2 rules in 17 ms. Remains 337 /338 variables (removed 1) and now considering 565/565 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 337/338 places, 565/565 transitions.
Incomplete random walk after 1000000 steps, including 307 resets, run finished after 4302 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 165 resets, run finished after 2425 ms. (steps per millisecond=412 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2875797 steps, run timeout after 18001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 2875797 steps, saw 973922 distinct states, run finished after 18001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:13:48] [INFO ] Computed 160 place invariants in 4 ms
[2022-06-03 19:13:48] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:13:49] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2022-06-03 19:13:49] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:13:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-03 19:13:49] [INFO ] After 29ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:13:49] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-03 19:13:49] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 215 ms.
Support contains 10 out of 337 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 565/565 transitions.
Applied a total of 0 rules in 10 ms. Remains 337 /337 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 337/337 places, 565/565 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 565/565 transitions.
Applied a total of 0 rules in 9 ms. Remains 337 /337 variables (removed 0) and now considering 565/565 (removed 0) transitions.
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:13:49] [INFO ] Computed 160 place invariants in 18 ms
[2022-06-03 19:13:49] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:13:49] [INFO ] Computed 160 place invariants in 1 ms
[2022-06-03 19:13:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-03 19:13:50] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2022-06-03 19:13:50] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:13:50] [INFO ] Computed 160 place invariants in 1 ms
[2022-06-03 19:13:50] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/337 places, 565/565 transitions.
Incomplete random walk after 1000000 steps, including 264 resets, run finished after 4518 ms. (steps per millisecond=221 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 2332 ms. (steps per millisecond=428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3075291 steps, run timeout after 18001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 3075291 steps, saw 996761 distinct states, run finished after 18002 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:14:15] [INFO ] Computed 160 place invariants in 2 ms
[2022-06-03 19:14:15] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:14:15] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2022-06-03 19:14:15] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:14:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-03 19:14:15] [INFO ] After 28ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:14:15] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-03 19:14:15] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 200 ms.
Support contains 10 out of 337 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 565/565 transitions.
Applied a total of 0 rules in 10 ms. Remains 337 /337 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 337/337 places, 565/565 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 565/565 transitions.
Applied a total of 0 rules in 9 ms. Remains 337 /337 variables (removed 0) and now considering 565/565 (removed 0) transitions.
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:14:16] [INFO ] Computed 160 place invariants in 1 ms
[2022-06-03 19:14:16] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:14:16] [INFO ] Computed 160 place invariants in 2 ms
[2022-06-03 19:14:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-03 19:14:17] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2022-06-03 19:14:17] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:14:17] [INFO ] Computed 160 place invariants in 2 ms
[2022-06-03 19:14:17] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/337 places, 565/565 transitions.
Graph (trivial) has 153 edges and 337 vertex of which 4 / 337 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1127 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 150 edges and 331 vertex of which 4 / 331 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 329 transition count 556
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 149 edges and 327 vertex of which 6 / 327 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 324 transition count 547
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 147 edges and 321 vertex of which 6 / 321 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 318 transition count 536
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 142 edges and 316 vertex of which 2 / 316 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 3 with 13 rules applied. Total rules applied 48 place count 315 transition count 526
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 51 place count 315 transition count 523
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 51 place count 315 transition count 522
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 54 place count 313 transition count 522
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 5 with 2 rules applied. Total rules applied 56 place count 312 transition count 521
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 58 place count 312 transition count 519
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 59 place count 312 transition count 518
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 63 place count 312 transition count 518
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 67 place count 312 transition count 514
Applied a total of 67 rules in 72 ms. Remains 312 /337 variables (removed 25) and now considering 514/565 (removed 51) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 514 rows 312 cols
[2022-06-03 19:14:17] [INFO ] Computed 149 place invariants in 1 ms
[2022-06-03 19:14:17] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:14:17] [INFO ] [Nat]Absence check using 149 positive place invariants in 21 ms returned sat
[2022-06-03 19:14:17] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:14:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 19:14:17] [INFO ] After 21ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:14:17] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-03 19:14:18] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:14:18] [INFO ] Flatten gal took : 122 ms
[2022-06-03 19:14:18] [INFO ] Flatten gal took : 63 ms
[2022-06-03 19:14:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16477548906845135982.gal : 42 ms
[2022-06-03 19:14:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3416013170865733451.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/ReachabilityCardinality16477548906845135982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3416013170865733451.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/ReachabilityCardinality3416013170865733451.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 945
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :945 after 1565
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1565 after 3342
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3342 after 1.25844e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.25844e+07 after 5.54154e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.54154e+14 after 4.45658e+29
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,1.44509e+46,0.2104,8220,2,836,14,15732,7,0,1767,16730,0
Total reachable state count : 1.445088288865441529642672858189349716529e+46

Verifying 1 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-05,6.0212e+44,0.214645,8484,2,920,14,15732,7,0,1785,16730,0
[2022-06-03 19:14:18] [INFO ] Flatten gal took : 76 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14877207885567469449
[2022-06-03 19:14:18] [INFO ] Applying decomposition
[2022-06-03 19:14:18] [INFO ] Computing symmetric may disable matrix : 565 transitions.
[2022-06-03 19:14:18] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:14:18] [INFO ] Computing symmetric may enable matrix : 565 transitions.
[2022-06-03 19:14:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:14:18] [INFO ] Flatten gal took : 59 ms
[2022-06-03 19:14:19] [INFO ] Flatten gal took : 99 ms
[2022-06-03 19:14:19] [INFO ] Computing Do-Not-Accords matrix : 565 transitions.
[2022-06-03 19:14:19] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:14:19] [INFO ] Built C files in 256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14877207885567469449
Running compilation step : cd /tmp/ltsmin14877207885567469449;'/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'
[2022-06-03 19:14:19] [INFO ] Input system was already deterministic with 565 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/graph1973361746693449042.txt' '-o' '/tmp/graph1973361746693449042.bin' '-w' '/tmp/graph1973361746693449042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1973361746693449042.bin' '-l' '-1' '-v' '-w' '/tmp/graph1973361746693449042.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:14:19] [INFO ] Decomposing Gal with order
[2022-06-03 19:14:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:14:19] [INFO ] Removed a total of 1076 redundant transitions.
[2022-06-03 19:14:19] [INFO ] Ran tautology test, simplified 0 / 1 in 522 ms.
[2022-06-03 19:14:19] [INFO ] BMC solution for property ShieldRVt-PT-040B-ReachabilityCardinality-05(UNSAT) depth K=0 took 6 ms
[2022-06-03 19:14:19] [INFO ] Flatten gal took : 192 ms
[2022-06-03 19:14:19] [INFO ] BMC solution for property ShieldRVt-PT-040B-ReachabilityCardinality-05(UNSAT) depth K=1 took 24 ms
[2022-06-03 19:14:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 506 labels/synchronizations in 61 ms.
[2022-06-03 19:14:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14445366173534698702.gal : 7 ms
[2022-06-03 19:14:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4247165103707277416.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/ReachabilityCardinality14445366173534698702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4247165103707277416.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/ReachabilityCardinality4247165103707277416.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 565 rows 337 cols
[2022-06-03 19:14:19] [INFO ] Computed 160 place invariants in 1 ms
[2022-06-03 19:14:19] [INFO ] Computed 160 place invariants in 2 ms
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-05 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-05 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 5 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,6.55939e+44,0.11087,7700,381,20,7054,158,507,11529,38,256,0
Total reachable state count : 6.559388819077927391470121350406308163549e+44

Verifying 1 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-05,3.66167e+36,0.113266,7964,256,15,7054,158,554,11529,49,256,0
[2022-06-03 19:14:19] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 19:14:19] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 19:14:19] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVt-PT-040B-ReachabilityCardinality-05 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 19:14:19] [INFO ] During BMC, SMT solver timed out at depth 2
[2022-06-03 19:14:19] [INFO ] BMC solving timed out (3600000 secs) at depth 2
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
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:14:19] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 181826 ms.

BK_STOP 1654283659878

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-165286026101022"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;