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

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

=== Now, execution of the tool begins

BK_START 1654283674810

Running Version 202205111006
[2022-06-03 19:14:35] [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:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 19:14:36] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2022-06-03 19:14:36] [INFO ] Transformed 2503 places.
[2022-06-03 19:14:36] [INFO ] Transformed 2503 transitions.
[2022-06-03 19:14:36] [INFO ] Found NUPN structural information;
[2022-06-03 19:14:36] [INFO ] Parsed PT model containing 2503 places and 2503 transitions in 341 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 15) seen :2
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2503 rows 2503 cols
[2022-06-03 19:14:37] [INFO ] Computed 201 place invariants in 32 ms
[2022-06-03 19:14:39] [INFO ] [Real]Absence check using 201 positive place invariants in 94 ms returned sat
[2022-06-03 19:14:39] [INFO ] After 1267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-03 19:14:39] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2022-06-03 19:14:48] [INFO ] After 8042ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2022-06-03 19:14:49] [INFO ] Deduced a trap composed of 44 places in 717 ms of which 7 ms to minimize.
[2022-06-03 19:14:50] [INFO ] Deduced a trap composed of 26 places in 715 ms of which 3 ms to minimize.
[2022-06-03 19:14:51] [INFO ] Deduced a trap composed of 36 places in 613 ms of which 2 ms to minimize.
[2022-06-03 19:14:51] [INFO ] Deduced a trap composed of 54 places in 591 ms of which 2 ms to minimize.
[2022-06-03 19:14:52] [INFO ] Deduced a trap composed of 47 places in 586 ms of which 2 ms to minimize.
[2022-06-03 19:14:53] [INFO ] Deduced a trap composed of 36 places in 576 ms of which 2 ms to minimize.
[2022-06-03 19:14:53] [INFO ] Deduced a trap composed of 46 places in 568 ms of which 2 ms to minimize.
[2022-06-03 19:14:54] [INFO ] Deduced a trap composed of 39 places in 542 ms of which 2 ms to minimize.
[2022-06-03 19:14:55] [INFO ] Deduced a trap composed of 70 places in 551 ms of which 2 ms to minimize.
[2022-06-03 19:14:55] [INFO ] Deduced a trap composed of 51 places in 539 ms of which 1 ms to minimize.
[2022-06-03 19:14:56] [INFO ] Deduced a trap composed of 49 places in 538 ms of which 1 ms to minimize.
[2022-06-03 19:14:56] [INFO ] Deduced a trap composed of 48 places in 521 ms of which 1 ms to minimize.
[2022-06-03 19:14:57] [INFO ] Deduced a trap composed of 55 places in 487 ms of which 2 ms to minimize.
[2022-06-03 19:14:58] [INFO ] Deduced a trap composed of 57 places in 481 ms of which 2 ms to minimize.
[2022-06-03 19:14:58] [INFO ] Deduced a trap composed of 47 places in 480 ms of which 2 ms to minimize.
[2022-06-03 19:14:59] [INFO ] Deduced a trap composed of 29 places in 504 ms of which 2 ms to minimize.
[2022-06-03 19:14:59] [INFO ] Deduced a trap composed of 48 places in 489 ms of which 1 ms to minimize.
[2022-06-03 19:15:00] [INFO ] Deduced a trap composed of 32 places in 487 ms of which 1 ms to minimize.
[2022-06-03 19:15:00] [INFO ] Deduced a trap composed of 55 places in 447 ms of which 1 ms to minimize.
[2022-06-03 19:15:01] [INFO ] Deduced a trap composed of 47 places in 445 ms of which 1 ms to minimize.
[2022-06-03 19:15:01] [INFO ] Deduced a trap composed of 43 places in 453 ms of which 1 ms to minimize.
[2022-06-03 19:15:02] [INFO ] Deduced a trap composed of 19 places in 465 ms of which 4 ms to minimize.
[2022-06-03 19:15:03] [INFO ] Deduced a trap composed of 47 places in 426 ms of which 1 ms to minimize.
[2022-06-03 19:15:03] [INFO ] Deduced a trap composed of 48 places in 425 ms of which 1 ms to minimize.
[2022-06-03 19:15:04] [INFO ] Deduced a trap composed of 57 places in 414 ms of which 1 ms to minimize.
[2022-06-03 19:15:05] [INFO ] Deduced a trap composed of 19 places in 1164 ms of which 2 ms to minimize.
[2022-06-03 19:15:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 19:15:05] [INFO ] After 26179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 36865 ms.
Support contains 91 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions removed 726 transitions
Trivial Post-agglo rules discarded 726 transitions
Performed 726 trivial Post agglomeration. Transition count delta: 726
Iterating post reduction 0 with 726 rules applied. Total rules applied 726 place count 2503 transition count 1777
Reduce places removed 726 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 728 rules applied. Total rules applied 1454 place count 1777 transition count 1775
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 28 rules applied. Total rules applied 1482 place count 1776 transition count 1748
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1509 place count 1749 transition count 1748
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 198 Pre rules applied. Total rules applied 1509 place count 1749 transition count 1550
Deduced a syphon composed of 198 places in 3 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 396 rules applied. Total rules applied 1905 place count 1551 transition count 1550
Discarding 326 places :
Symmetric choice reduction at 4 with 326 rule applications. Total rules 2231 place count 1225 transition count 1224
Iterating global reduction 4 with 326 rules applied. Total rules applied 2557 place count 1225 transition count 1224
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 117 Pre rules applied. Total rules applied 2557 place count 1225 transition count 1107
Deduced a syphon composed of 117 places in 3 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 4 with 234 rules applied. Total rules applied 2791 place count 1108 transition count 1107
Performed 446 Post agglomeration using F-continuation condition.Transition count delta: 446
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 4 with 892 rules applied. Total rules applied 3683 place count 662 transition count 661
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -73
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 3885 place count 561 transition count 734
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 3923 place count 542 transition count 746
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3924 place count 542 transition count 745
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3932 place count 542 transition count 737
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3940 place count 534 transition count 737
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 3946 place count 534 transition count 731
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3947 place count 534 transition count 731
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3948 place count 534 transition count 731
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3949 place count 533 transition count 730
Applied a total of 3949 rules in 639 ms. Remains 533 /2503 variables (removed 1970) and now considering 730/2503 (removed 1773) transitions.
Finished structural reductions, in 1 iterations. Remains : 533/2503 places, 730/2503 transitions.
Incomplete random walk after 1000000 steps, including 324 resets, run finished after 21126 ms. (steps per millisecond=47 ) properties (out of 10) seen :2
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 41 resets, run finished after 4298 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 839423 steps, including 34 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 32 resets, run finished after 4294 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 51 resets, run finished after 4226 ms. (steps per millisecond=236 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 45 resets, run finished after 4244 ms. (steps per millisecond=235 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 11 resets, run finished after 4471 ms. (steps per millisecond=223 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 43 resets, run finished after 4647 ms. (steps per millisecond=215 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 40 resets, run finished after 4550 ms. (steps per millisecond=219 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 730 rows 533 cols
[2022-06-03 19:16:39] [INFO ] Computed 201 place invariants in 4 ms
[2022-06-03 19:16:39] [INFO ] [Real]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-06-03 19:16:39] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 19:16:39] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2022-06-03 19:16:40] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 19:16:40] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-03 19:16:40] [INFO ] After 280ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-03 19:16:40] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-06-03 19:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-06-03 19:16:41] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-06-03 19:16:41] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-06-03 19:16:41] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2022-06-03 19:16:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2022-06-03 19:16:41] [INFO ] After 975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 330 ms.
[2022-06-03 19:16:41] [INFO ] After 1986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 3129 ms.
Support contains 64 out of 533 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 533/533 places, 730/730 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 533 transition count 722
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 525 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 524 transition count 721
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 18 place count 524 transition count 710
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 40 place count 513 transition count 710
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 54 place count 506 transition count 703
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 74 place count 496 transition count 717
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 496 transition count 716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 495 transition count 716
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 491 transition count 712
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 490 transition count 712
Applied a total of 81 rules in 85 ms. Remains 490 /533 variables (removed 43) and now considering 712/730 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/533 places, 712/730 transitions.
Incomplete random walk after 1000000 steps, including 189 resets, run finished after 20171 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 4336 ms. (steps per millisecond=230 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 842404 steps, including 20 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 4819 ms. (steps per millisecond=207 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 4565 ms. (steps per millisecond=219 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 4573 ms. (steps per millisecond=218 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 4634 ms. (steps per millisecond=215 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 30 resets, run finished after 4761 ms. (steps per millisecond=210 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 4551 ms. (steps per millisecond=219 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 8249728 steps, run timeout after 171001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 8249728 steps, saw 5821033 distinct states, run finished after 171002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:20:33] [INFO ] Computed 200 place invariants in 5 ms
[2022-06-03 19:20:33] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-06-03 19:20:33] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 19:20:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-06-03 19:20:34] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 19:20:34] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-03 19:20:34] [INFO ] After 256ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-03 19:20:34] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-06-03 19:20:34] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-06-03 19:20:34] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-06-03 19:20:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2022-06-03 19:20:35] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2022-06-03 19:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-06-03 19:20:35] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 298 ms.
[2022-06-03 19:20:35] [INFO ] After 1811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 3479 ms.
Support contains 64 out of 490 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 490/490 places, 712/712 transitions.
Applied a total of 0 rules in 22 ms. Remains 490 /490 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/490 places, 712/712 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 490/490 places, 712/712 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 712/712 (removed 0) transitions.
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:20:38] [INFO ] Computed 200 place invariants in 5 ms
[2022-06-03 19:20:39] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:20:39] [INFO ] Computed 200 place invariants in 3 ms
[2022-06-03 19:20:39] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-03 19:20:39] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2022-06-03 19:20:39] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:20:39] [INFO ] Computed 200 place invariants in 5 ms
[2022-06-03 19:20:40] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 490/490 places, 712/712 transitions.
Incomplete random walk after 1000000 steps, including 206 resets, run finished after 19813 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 4222 ms. (steps per millisecond=236 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 869283 steps, including 18 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 4209 ms. (steps per millisecond=237 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 4212 ms. (steps per millisecond=237 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 4158 ms. (steps per millisecond=240 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 4260 ms. (steps per millisecond=234 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 4343 ms. (steps per millisecond=230 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 30 resets, run finished after 4281 ms. (steps per millisecond=233 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 8076762 steps, run timeout after 162001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 8076762 steps, saw 5697054 distinct states, run finished after 162001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:24:16] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:24:16] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2022-06-03 19:24:16] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 19:24:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-06-03 19:24:17] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 19:24:17] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-03 19:24:17] [INFO ] After 260ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-03 19:24:17] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-03 19:24:17] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-06-03 19:24:17] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-06-03 19:24:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2022-06-03 19:24:18] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2022-06-03 19:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-06-03 19:24:18] [INFO ] After 891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 286 ms.
[2022-06-03 19:24:18] [INFO ] After 1786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 3809 ms.
Support contains 64 out of 490 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 490/490 places, 712/712 transitions.
Applied a total of 0 rules in 21 ms. Remains 490 /490 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/490 places, 712/712 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 490/490 places, 712/712 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 712/712 (removed 0) transitions.
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:24:22] [INFO ] Computed 200 place invariants in 4 ms
[2022-06-03 19:24:22] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:24:22] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:24:22] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-03 19:24:23] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2022-06-03 19:24:23] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:24:23] [INFO ] Computed 200 place invariants in 4 ms
[2022-06-03 19:24:23] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 490/490 places, 712/712 transitions.
Graph (trivial) has 135 edges and 490 vertex of which 2 / 490 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 135 edges and 488 vertex of which 2 / 488 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 487 transition count 708
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 134 edges and 486 vertex of which 2 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 485 transition count 703
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 133 edges and 484 vertex of which 2 / 484 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 17 place count 483 transition count 700
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 23 place count 482 transition count 695
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 23 place count 482 transition count 693
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 29 place count 478 transition count 693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 478 transition count 692
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 32 place count 477 transition count 691
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 6 with 3 rules applied. Total rules applied 35 place count 475 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 38 place count 475 transition count 687
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 63 place count 475 transition count 662
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 70 place count 475 transition count 662
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 75 place count 475 transition count 657
Applied a total of 75 rules in 65 ms. Remains 475 /490 variables (removed 15) and now considering 657/712 (removed 55) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 657 rows 475 cols
[2022-06-03 19:24:23] [INFO ] Computed 193 place invariants in 2 ms
[2022-06-03 19:24:23] [INFO ] [Real]Absence check using 193 positive place invariants in 24 ms returned sat
[2022-06-03 19:24:23] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 19:24:23] [INFO ] [Nat]Absence check using 193 positive place invariants in 22 ms returned sat
[2022-06-03 19:24:24] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 19:24:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-03 19:24:24] [INFO ] After 231ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-03 19:24:24] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-06-03 19:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-06-03 19:24:25] [INFO ] After 659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 222 ms.
[2022-06-03 19:24:25] [INFO ] After 1451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-06-03 19:24:25] [INFO ] Flatten gal took : 84 ms
[2022-06-03 19:24:25] [INFO ] Flatten gal took : 55 ms
[2022-06-03 19:24:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1505919331987816500.gal : 22 ms
[2022-06-03 19:24:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9255151937982834801.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1505919331987816500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9255151937982834801.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...319
Loading property file /tmp/ReachabilityCardinality9255151937982834801.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :18 after 54
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :54 after 2268
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :2268 after 27216
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-11 does not hold.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-06 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :27216 after 8.29931e+06
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-15 is true.
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :8.29931e+06 after 8.48361e+06
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-07 is true.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8.48361e+06 after 1.49369e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.49369e+07 after 2.04713e+07
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.04713e+07 after 6.45887e+08
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-02 is true.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :6.45887e+08 after 2.76286e+17
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-00 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.76286e+17 after 2.06242e+27
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.06242e+27 after 6.76304e+32
Detected timeout of ITS tools.
[2022-06-03 19:24:40] [INFO ] Flatten gal took : 45 ms
[2022-06-03 19:24:40] [INFO ] Applying decomposition
[2022-06-03 19:24:40] [INFO ] Flatten gal took : 40 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/graph6222487340873617565.txt' '-o' '/tmp/graph6222487340873617565.bin' '-w' '/tmp/graph6222487340873617565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6222487340873617565.bin' '-l' '-1' '-v' '-w' '/tmp/graph6222487340873617565.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:24:40] [INFO ] Decomposing Gal with order
[2022-06-03 19:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:24:40] [INFO ] Removed a total of 609 redundant transitions.
[2022-06-03 19:24:41] [INFO ] Flatten gal took : 90 ms
[2022-06-03 19:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2022-06-03 19:24:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4886470660405808140.gal : 9 ms
[2022-06-03 19:24:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12871973756004375316.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/ReachabilityCardinality4886470660405808140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12871973756004375316.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/ReachabilityCardinality12871973756004375316.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 9072
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-10 is true.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-01 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,4.97369e+63,0.424938,21704,942,30,35794,197,1061,82305,62,441,0
Total reachable state count : 4.973689107933649392964534415335544582101e+63

Verifying 2 reachability properties.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-01 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-050B-ReachabilityCardinality-01,6.11657e+59,0.441832,21968,708,31,35794,197,1325,82305,80,441,0
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-10 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-050B-ReachabilityCardinality-10,4.07159e+48,0.443407,21968,501,22,35794,197,1352,82305,80,441,0
[2022-06-03 19:24:41] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8741383286972900120
[2022-06-03 19:24:41] [INFO ] Applying decomposition
[2022-06-03 19:24:41] [INFO ] Computing symmetric may disable matrix : 712 transitions.
[2022-06-03 19:24:41] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:24:41] [INFO ] Flatten gal took : 59 ms
[2022-06-03 19:24:41] [INFO ] Computing symmetric may enable matrix : 712 transitions.
[2022-06-03 19:24:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:24:41] [INFO ] Flatten gal took : 60 ms
[2022-06-03 19:24:41] [INFO ] Input system was already deterministic with 712 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/graph2993534259705464682.txt' '-o' '/tmp/graph2993534259705464682.bin' '-w' '/tmp/graph2993534259705464682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2993534259705464682.bin' '-l' '-1' '-v' '-w' '/tmp/graph2993534259705464682.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:24:41] [INFO ] Decomposing Gal with order
[2022-06-03 19:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:24:41] [INFO ] Computing Do-Not-Accords matrix : 712 transitions.
[2022-06-03 19:24:41] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:24:41] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8741383286972900120
[2022-06-03 19:24:41] [INFO ] Removed a total of 1036 redundant transitions.
Running compilation step : cd /tmp/ltsmin8741383286972900120;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '90' '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:24:41] [INFO ] Flatten gal took : 106 ms
[2022-06-03 19:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 384 labels/synchronizations in 26 ms.
[2022-06-03 19:24:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18360051729955175877.gal : 6 ms
[2022-06-03 19:24:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7484038385182820804.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/ReachabilityCardinality18360051729955175877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7484038385182820804.prop' '--nowitness'
[2022-06-03 19:24:42] [INFO ] Ran tautology test, simplified 0 / 8 in 347 ms.

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/ReachabilityCardinality7484038385182820804.prop.
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-00(UNSAT) depth K=0 took 15 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-01(UNSAT) depth K=0 took 2 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-02(UNSAT) depth K=0 took 0 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-06(UNSAT) depth K=0 took 1 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-07(UNSAT) depth K=0 took 0 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-10(UNSAT) depth K=0 took 1 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-11(UNSAT) depth K=0 took 10 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-00(UNSAT) depth K=1 took 2 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-01(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-02(UNSAT) depth K=1 took 3 ms
SDD size :6 after 6
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-06(UNSAT) depth K=1 took 1 ms
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 54
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-07(UNSAT) depth K=1 took 12 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-10(UNSAT) depth K=1 took 2 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-11(UNSAT) depth K=1 took 2 ms
[2022-06-03 19:24:42] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-15(UNSAT) depth K=1 took 1 ms
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :54 after 9072
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :9072 after 244944
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 712 rows 490 cols
[2022-06-03 19:24:42] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:24:42] [INFO ] Computed 200 place invariants in 2 ms
[2022-06-03 19:24:43] [INFO ] BMC solution for property ShieldRVt-PT-050B-ReachabilityCardinality-00(UNSAT) depth K=2 took 936 ms
[2022-06-03 19:24:43] [INFO ] Proved 490 variables to be positive in 757 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.40431e+72,0.847762,35648,902,81,70762,620,976,132529,129,2114,0
Total reachable state count : 1.404314671391187820170842609458767359738e+72

Verifying 8 reachability properties.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-00 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-00,9.04556e+58,0.850067,35648,428,67,70762,620,976,132529,131,2114,0
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-01 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-01,4.79694e+49,0.860713,35648,425,55,70762,620,1091,132529,138,2114,2369
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-02 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-02,1.98864e+57,0.861115,35648,297,58,70762,620,1091,132529,138,2114,2369
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-06 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-06,9.94321e+56,0.861506,35648,294,58,70762,620,1091,132529,138,2114,2369
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-07 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-07,3.4288e+56,0.86184,35648,271,55,70762,620,1091,132529,138,2114,2369
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-10 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-10,8.26177e+54,0.863161,35648,292,52,70762,620,1103,132529,139,2114,2556
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-11 does not hold.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-11,2.32164e+71,0.86456,35648,562,70,70762,620,1111,132529,139,2114,2672
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-15 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-050B-ReachabilityCardinality-15,2.05728e+56,0.864937,35648,271,55,70762,620,1111,132529,139,2114,2672
[2022-06-03 19:24:43] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 19:24:43] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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:24:43] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
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:24:43] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVt-PT-050B-ReachabilityCardinality-01 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
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 "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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:24:43] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVt-PT-050B-ReachabilityCardinality-00 K-induction depth 0
Exception in thread "Thread-11" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-03 19:24:43] [INFO ] During BMC, SMT solver timed out at depth 2
[2022-06-03 19:24:43] [INFO ] BMC solving timed out (3600000 secs) at depth 2
[2022-06-03 19:24:43] [INFO ] SMT solved 0/ 8 properties. Interrupting SMT analysis.
Total runtime 607218 ms.

BK_STOP 1654284283281

--------------------
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-050B"
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-050B, 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-165286026201038"
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 [ "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 ;