fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286026201039
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldRVt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2964.403 364951.00 517281.00 552.70 TTFTTFFTTTFTTFTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 7.0K Apr 30 01:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 01:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 01:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:00 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.3K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 09:02 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 7.1K Apr 30 01:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 01:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 01:00 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 614K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654283680849

Running Version 202205111006
[2022-06-03 19:14:42] [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:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 19:14:42] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2022-06-03 19:14:42] [INFO ] Transformed 2503 places.
[2022-06-03 19:14:42] [INFO ] Transformed 2503 transitions.
[2022-06-03 19:14:42] [INFO ] Found NUPN structural information;
[2022-06-03 19:14:42] [INFO ] Parsed PT model containing 2503 places and 2503 transitions in 331 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=15 ) properties (out of 16) seen :4
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2503 rows 2503 cols
[2022-06-03 19:14:43] [INFO ] Computed 201 place invariants in 36 ms
[2022-06-03 19:14:44] [INFO ] [Real]Absence check using 201 positive place invariants in 93 ms returned sat
[2022-06-03 19:14:45] [INFO ] After 1267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-03 19:14:45] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2022-06-03 19:14:58] [INFO ] After 12289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-06-03 19:14:59] [INFO ] Deduced a trap composed of 51 places in 812 ms of which 11 ms to minimize.
[2022-06-03 19:15:00] [INFO ] Deduced a trap composed of 28 places in 723 ms of which 2 ms to minimize.
[2022-06-03 19:15:01] [INFO ] Deduced a trap composed of 32 places in 749 ms of which 4 ms to minimize.
[2022-06-03 19:15:02] [INFO ] Deduced a trap composed of 48 places in 705 ms of which 5 ms to minimize.
[2022-06-03 19:15:02] [INFO ] Deduced a trap composed of 28 places in 724 ms of which 2 ms to minimize.
[2022-06-03 19:15:03] [INFO ] Deduced a trap composed of 37 places in 707 ms of which 5 ms to minimize.
[2022-06-03 19:15:04] [INFO ] Deduced a trap composed of 45 places in 677 ms of which 1 ms to minimize.
[2022-06-03 19:15:05] [INFO ] Deduced a trap composed of 30 places in 687 ms of which 1 ms to minimize.
[2022-06-03 19:15:05] [INFO ] Deduced a trap composed of 48 places in 656 ms of which 2 ms to minimize.
[2022-06-03 19:15:06] [INFO ] Deduced a trap composed of 33 places in 643 ms of which 1 ms to minimize.
[2022-06-03 19:15:07] [INFO ] Deduced a trap composed of 52 places in 649 ms of which 2 ms to minimize.
[2022-06-03 19:15:08] [INFO ] Deduced a trap composed of 37 places in 631 ms of which 2 ms to minimize.
[2022-06-03 19:15:08] [INFO ] Deduced a trap composed of 47 places in 620 ms of which 2 ms to minimize.
[2022-06-03 19:15:09] [INFO ] Deduced a trap composed of 48 places in 626 ms of which 1 ms to minimize.
[2022-06-03 19:15:10] [INFO ] Deduced a trap composed of 45 places in 611 ms of which 1 ms to minimize.
[2022-06-03 19:15:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 19:15:10] [INFO ] After 25270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 71414 ms.
Support contains 70 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions removed 722 transitions
Trivial Post-agglo rules discarded 722 transitions
Performed 722 trivial Post agglomeration. Transition count delta: 722
Iterating post reduction 0 with 722 rules applied. Total rules applied 722 place count 2503 transition count 1781
Reduce places removed 722 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 724 rules applied. Total rules applied 1446 place count 1781 transition count 1779
Reduce places removed 1 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 2 with 33 rules applied. Total rules applied 1479 place count 1780 transition count 1747
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 1511 place count 1748 transition count 1747
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 205 Pre rules applied. Total rules applied 1511 place count 1748 transition count 1542
Deduced a syphon composed of 205 places in 8 ms
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 4 with 410 rules applied. Total rules applied 1921 place count 1543 transition count 1542
Discarding 335 places :
Symmetric choice reduction at 4 with 335 rule applications. Total rules 2256 place count 1208 transition count 1207
Iterating global reduction 4 with 335 rules applied. Total rules applied 2591 place count 1208 transition count 1207
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 133 Pre rules applied. Total rules applied 2591 place count 1208 transition count 1074
Deduced a syphon composed of 133 places in 5 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 2857 place count 1075 transition count 1074
Performed 428 Post agglomeration using F-continuation condition.Transition count delta: 428
Deduced a syphon composed of 428 places in 1 ms
Reduce places removed 428 places and 0 transitions.
Iterating global reduction 4 with 856 rules applied. Total rules applied 3713 place count 647 transition count 646
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3915 place count 546 transition count 729
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 3981 place count 513 transition count 759
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3982 place count 513 transition count 758
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3983 place count 513 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3984 place count 512 transition count 757
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3985 place count 512 transition count 756
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3986 place count 512 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3987 place count 511 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3988 place count 510 transition count 755
Applied a total of 3988 rules in 698 ms. Remains 510 /2503 variables (removed 1993) and now considering 755/2503 (removed 1748) transitions.
Finished structural reductions, in 1 iterations. Remains : 510/2503 places, 755/2503 transitions.
Incomplete random walk after 1000000 steps, including 260 resets, run finished after 18851 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 4111 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 4220 ms. (steps per millisecond=236 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 4442 ms. (steps per millisecond=225 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 857334 steps, including 14 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 4150 ms. (steps per millisecond=240 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 12969074 steps, run timeout after 120001 ms. (steps per millisecond=108 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 12969074 steps, saw 2396199 distinct states, run finished after 120002 ms. (steps per millisecond=108 ) properties seen :4
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 510 cols
[2022-06-03 19:19:03] [INFO ] Computed 200 place invariants in 9 ms
[2022-06-03 19:19:03] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:19:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2022-06-03 19:19:03] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:19:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-03 19:19:04] [INFO ] After 756ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:19:05] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2022-06-03 19:19:05] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-06-03 19:19:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2022-06-03 19:19:05] [INFO ] After 1470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-06-03 19:19:05] [INFO ] After 2166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 369 ms.
Support contains 66 out of 510 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 510/510 places, 755/755 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 510 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 509 transition count 754
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 509 transition count 752
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 507 transition count 752
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 504 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 504 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 503 transition count 755
Applied a total of 14 rules in 58 ms. Remains 503 /510 variables (removed 7) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/510 places, 755/755 transitions.
Incomplete random walk after 1000000 steps, including 251 resets, run finished after 4810 ms. (steps per millisecond=207 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 4493 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3216489 steps, run timeout after 27001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 3216489 steps, saw 1216417 distinct states, run finished after 27001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:19:42] [INFO ] Computed 200 place invariants in 11 ms
[2022-06-03 19:19:42] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:19:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2022-06-03 19:19:42] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:19:42] [INFO ] State equation strengthened by 293 read => feed constraints.
[2022-06-03 19:19:43] [INFO ] After 272ms SMT Verify possible using 293 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:19:43] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 373 ms.
[2022-06-03 19:19:43] [INFO ] After 1327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 236 ms.
Support contains 66 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 755/755 transitions.
Applied a total of 0 rules in 14 ms. Remains 503 /503 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 755/755 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 755/755 transitions.
Applied a total of 0 rules in 13 ms. Remains 503 /503 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:19:43] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:19:44] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:19:44] [INFO ] Computed 200 place invariants in 15 ms
[2022-06-03 19:19:44] [INFO ] State equation strengthened by 293 read => feed constraints.
[2022-06-03 19:19:45] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2022-06-03 19:19:45] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:19:45] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:19:46] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 755/755 transitions.
Incomplete random walk after 1000000 steps, including 232 resets, run finished after 4759 ms. (steps per millisecond=210 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 4462 ms. (steps per millisecond=224 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3200801 steps, run timeout after 27001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 3200801 steps, saw 1215191 distinct states, run finished after 27001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:20:22] [INFO ] Computed 200 place invariants in 6 ms
[2022-06-03 19:20:22] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:20:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-06-03 19:20:22] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:20:22] [INFO ] State equation strengthened by 293 read => feed constraints.
[2022-06-03 19:20:23] [INFO ] After 273ms SMT Verify possible using 293 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:20:23] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 378 ms.
[2022-06-03 19:20:23] [INFO ] After 1334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 243 ms.
Support contains 66 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 755/755 transitions.
Applied a total of 0 rules in 13 ms. Remains 503 /503 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 755/755 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 755/755 transitions.
Applied a total of 0 rules in 13 ms. Remains 503 /503 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:20:24] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:20:24] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:20:24] [INFO ] Computed 200 place invariants in 4 ms
[2022-06-03 19:20:24] [INFO ] State equation strengthened by 293 read => feed constraints.
[2022-06-03 19:20:25] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2022-06-03 19:20:25] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 755 rows 503 cols
[2022-06-03 19:20:25] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:20:26] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 755/755 transitions.
Graph (trivial) has 153 edges and 503 vertex of which 4 / 503 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1695 edges and 501 vertex of which 499 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 497 vertex of which 4 / 497 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 495 transition count 746
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 147 edges and 494 vertex of which 2 / 494 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 493 transition count 739
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 493 transition count 736
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 492 transition count 735
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1663 edges and 492 vertex of which 491 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 25 place count 491 transition count 733
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 4 with 39 rules applied. Total rules applied 64 place count 491 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 490 transition count 694
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 68 place count 488 transition count 693
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 72 place count 488 transition count 689
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 6 with 33 rules applied. Total rules applied 105 place count 488 transition count 689
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 128 place count 488 transition count 666
Applied a total of 128 rules in 89 ms. Remains 488 /503 variables (removed 15) and now considering 666/755 (removed 89) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 666 rows 488 cols
[2022-06-03 19:20:26] [INFO ] Computed 193 place invariants in 2 ms
[2022-06-03 19:20:26] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:20:26] [INFO ] [Nat]Absence check using 193 positive place invariants in 23 ms returned sat
[2022-06-03 19:20:26] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:20:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 19:20:26] [INFO ] After 113ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:20:27] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-06-03 19:20:27] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:20:27] [INFO ] Flatten gal took : 113 ms
[2022-06-03 19:20:27] [INFO ] Flatten gal took : 51 ms
[2022-06-03 19:20:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality163723741575169530.gal : 32 ms
[2022-06-03 19:20:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2394270916229802403.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/ReachabilityCardinality163723741575169530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2394270916229802403.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...318
Loading property file /tmp/ReachabilityCardinality2394270916229802403.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 116
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :116 after 16418
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :16418 after 5.51581e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.00473e+12 after 1.29044e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.29044e+13 after 1.29152e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.29152e+13 after 1.30022e+13
Detected timeout of ITS tools.
[2022-06-03 19:20:42] [INFO ] Flatten gal took : 42 ms
[2022-06-03 19:20:42] [INFO ] Applying decomposition
[2022-06-03 19:20:42] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3406141346030480955.txt' '-o' '/tmp/graph3406141346030480955.bin' '-w' '/tmp/graph3406141346030480955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3406141346030480955.bin' '-l' '-1' '-v' '-w' '/tmp/graph3406141346030480955.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:20:42] [INFO ] Decomposing Gal with order
[2022-06-03 19:20:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:20:43] [INFO ] Removed a total of 642 redundant transitions.
[2022-06-03 19:20:43] [INFO ] Flatten gal took : 108 ms
[2022-06-03 19:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 22 ms.
[2022-06-03 19:20:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15490666744834011974.gal : 10 ms
[2022-06-03 19:20:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1044156195904390583.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/ReachabilityCardinality15490666744834011974.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1044156195904390583.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/ReachabilityCardinality1044156195904390583.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :65 after 3649
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3649 after 9.80589e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.80843e+15 after 1.54503e+45
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,4.37631e+69,2.29921,84532,733,32,167848,563,1476,416553,80,2579,0
Total reachable state count : 4.376311450582449158460088569919116221542e+69

Verifying 1 reachability properties.
Reachability property ShieldRVt-PT-050B-ReachabilityFireability-10 does not hold.
No reachable states exhibit your property : ShieldRVt-PT-050B-ReachabilityFireability-10

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-050B-ReachabilityFireability-10,0,2.44537,84532,1,0,167848,563,1611,416553,90,2579,5878
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 363645 ms.

BK_STOP 1654284045800

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026201039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;