Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683762401038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
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 r356-tall-171683762401038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 614K May 18 16:43 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-2024-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717088890206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 17:08:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 17:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:08:11] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-30 17:08:11] [INFO ] Transformed 2503 places.
[2024-05-30 17:08:11] [INFO ] Transformed 2503 transitions.
[2024-05-30 17:08:11] [INFO ] Found NUPN structural information;
[2024-05-30 17:08:11] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2253 ms. (17 steps per ms) remains 8/13 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 452 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 8/8 properties
[2024-05-30 17:08:12] [INFO ] Flatten gal took : 533 ms
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 8/8 properties
[2024-05-30 17:08:13] [INFO ] Flatten gal took : 223 ms
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
[2024-05-30 17:08:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15935512207962030033.gal : 94 ms
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
[2024-05-30 17:08:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8139760448868790781.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15935512207962030033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8139760448868790781.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 2503 rows 2503 cols
[2024-05-30 17:08:13] [INFO ] Computed 201 invariants in 39 ms
Loading property file /tmp/ReachabilityCardinality8139760448868790781.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1740/1877 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1877 variables, 1740/2023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1877 variables, 0/2023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 626/2503 variables, 55/2078 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 626/2704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/2704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2503/5006 variables, 2503/5207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 114
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :114 after 43939
At refinement iteration 10 (OVERLAPS) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :43939 after 4.00695e+11
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :4.00695e+11 after 3.33958e+25
After SMT solving in domain Real declared 5006/5006 variables, and 5207 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3460 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.33958e+25 after 2.31978e+53
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1740/1877 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1877 variables, 1740/2023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 17:08:17] [INFO ] Deduced a trap composed of 35 places in 466 ms of which 67 ms to minimize.
[2024-05-30 17:08:18] [INFO ] Deduced a trap composed of 28 places in 387 ms of which 14 ms to minimize.
[2024-05-30 17:08:18] [INFO ] Deduced a trap composed of 25 places in 340 ms of which 6 ms to minimize.
[2024-05-30 17:08:19] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 6 ms to minimize.
[2024-05-30 17:08:19] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 6 ms to minimize.
[2024-05-30 17:08:19] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 7 ms to minimize.
[2024-05-30 17:08:20] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 7 ms to minimize.
[2024-05-30 17:08:20] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 6 ms to minimize.
[2024-05-30 17:08:20] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 7 ms to minimize.
[2024-05-30 17:08:21] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 5 ms to minimize.
[2024-05-30 17:08:21] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 6 ms to minimize.
[2024-05-30 17:08:21] [INFO ] Deduced a trap composed of 28 places in 310 ms of which 6 ms to minimize.
[2024-05-30 17:08:22] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 6 ms to minimize.
SMT process timed out in 8806ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 137 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 675 transitions
Trivial Post-agglo rules discarded 675 transitions
Performed 675 trivial Post agglomeration. Transition count delta: 675
Iterating post reduction 0 with 675 rules applied. Total rules applied 675 place count 2503 transition count 1828
Reduce places removed 675 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 718 rules applied. Total rules applied 1393 place count 1828 transition count 1785
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 1436 place count 1785 transition count 1785
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 1436 place count 1785 transition count 1588
Deduced a syphon composed of 197 places in 4 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 1830 place count 1588 transition count 1588
Discarding 300 places :
Symmetric choice reduction at 3 with 300 rule applications. Total rules 2130 place count 1288 transition count 1288
Iterating global reduction 3 with 300 rules applied. Total rules applied 2430 place count 1288 transition count 1288
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 2430 place count 1288 transition count 1169
Deduced a syphon composed of 119 places in 6 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 2668 place count 1169 transition count 1169
Performed 431 Post agglomeration using F-continuation condition.Transition count delta: 431
Deduced a syphon composed of 431 places in 1 ms
Reduce places removed 431 places and 0 transitions.
Iterating global reduction 3 with 862 rules applied. Total rules applied 3530 place count 738 transition count 738
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3732 place count 637 transition count 815
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 3770 place count 618 transition count 827
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3771 place count 618 transition count 826
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3772 place count 618 transition count 825
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 3775 place count 618 transition count 822
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3778 place count 615 transition count 822
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3779 place count 615 transition count 821
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3780 place count 615 transition count 821
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3781 place count 614 transition count 820
Applied a total of 3781 rules in 706 ms. Remains 614 /2503 variables (removed 1889) and now considering 820/2503 (removed 1683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 715 ms. Remains : 614/2503 places, 820/2503 transitions.
RANDOM walk for 40000 steps (20 resets) in 670 ms. (59 steps per ms) remains 7/8 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 308 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 6/7 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
// Phase 1: matrix 820 rows 614 cols
[2024-05-30 17:08:23] [INFO ] Computed 201 invariants in 13 ms
[2024-05-30 17:08:23] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 344/453 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 144/597 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 802/1399 variables, 597/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1399 variables, 329/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1399 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/1421 variables, 10/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1421 variables, 5/1134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1421 variables, 1/1135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1421 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/1433 variables, 6/1141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1433 variables, 2/1143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1433 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/1434 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1434 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1434 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1434 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1434/1434 variables, and 1145 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1748 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 614/614 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 344/453 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:25] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-30 17:08:25] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 17:08:25] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-30 17:08:25] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-30 17:08:25] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-30 17:08:25] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 144/597 variables, 61/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:26] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-30 17:08:27] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 17:08:27] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 17:08:27] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 802/1399 variables, 597/809 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1399 variables, 329/1138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1399 variables, 4/1142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-30 17:08:28] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-30 17:08:28] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-30 17:08:29] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-30 17:08:29] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 17:08:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-30 17:08:29] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1399 variables, 7/1149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1399 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 22/1421 variables, 10/1159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1421 variables, 5/1164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1421 variables, 1/1165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1421 variables, 2/1167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:32] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-30 17:08:32] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-30 17:08:32] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-30 17:08:32] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-05-30 17:08:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1421 variables, 5/1172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1421 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 12/1433 variables, 6/1178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1433 variables, 2/1180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1433 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 1/1434 variables, 1/1181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1434 variables, 1/1182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1434 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/1434 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1434/1434 variables, and 1182 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10600 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 614/614 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 31/31 constraints]
After SMT, in 12407ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3162 ms.
Support contains 109 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 820/820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 614 transition count 812
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 606 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 605 transition count 811
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 18 place count 605 transition count 805
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 599 transition count 805
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 598 transition count 804
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 598 transition count 804
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 69 place count 579 transition count 786
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 83 place count 572 transition count 793
Applied a total of 83 rules in 79 ms. Remains 572 /614 variables (removed 42) and now considering 793/820 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 572/614 places, 793/820 transitions.
RANDOM walk for 40000 steps (16 resets) in 456 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 158175 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 6
Probabilistic random walk after 158175 steps, saw 88498 distinct states, run finished after 3005 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 793 rows 572 cols
[2024-05-30 17:08:42] [INFO ] Computed 200 invariants in 3 ms
[2024-05-30 17:08:42] [INFO ] State equation strengthened by 353 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 327/436 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 122/558 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 777/1335 variables, 558/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 352/1103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/1357 variables, 10/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1357 variables, 5/1118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1357 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1357 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 8/1365 variables, 4/1123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1365 variables, 2/1125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1365 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1365 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1365/1365 variables, and 1125 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 327/436 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:44] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-30 17:08:44] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 17:08:44] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 122/558 variables, 61/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:44] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 17:08:44] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-30 17:08:44] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:45] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:45] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-30 17:08:45] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 777/1335 variables, 558/760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1335 variables, 352/1112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1335 variables, 4/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:46] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-30 17:08:46] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-30 17:08:46] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1335 variables, 3/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:47] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-30 17:08:47] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1335 variables, 2/1121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1335 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 22/1357 variables, 10/1131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1357 variables, 5/1136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1357 variables, 1/1137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1357 variables, 2/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1357 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 8/1365 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1365 variables, 2/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 17:08:50] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1365 variables, 1/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1365 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1365 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1365/1365 variables, and 1146 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7369 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 15/15 constraints]
After SMT, in 8935ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4079 ms.
Support contains 109 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 793/793 transitions.
Applied a total of 0 rules in 14 ms. Remains 572 /572 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 572/572 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 793/793 transitions.
Applied a total of 0 rules in 15 ms. Remains 572 /572 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2024-05-30 17:08:55] [INFO ] Invariant cache hit.
[2024-05-30 17:08:56] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-30 17:08:56] [INFO ] Invariant cache hit.
[2024-05-30 17:08:56] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-05-30 17:08:57] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
[2024-05-30 17:08:58] [INFO ] Redundant transitions in 53 ms returned []
Running 788 sub problems to find dead transitions.
[2024-05-30 17:08:58] [INFO ] Invariant cache hit.
[2024-05-30 17:08:58] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (OVERLAPS) 2/572 variables, 189/200 constraints. Problems are: Problem set: 0 solved, 788 unsolved
[2024-05-30 17:09:11] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-30 17:09:11] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-30 17:09:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-30 17:09:12] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 17:09:12] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 17:09:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-30 17:09:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 17:09:12] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-30 17:09:13] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 17:09:13] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 17:09:13] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-30 17:09:13] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-30 17:09:13] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-30 17:09:14] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-30 17:09:14] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-30 17:09:14] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-30 17:09:15] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2024-05-30 17:09:15] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-30 17:09:15] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-30 17:09:15] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 788 unsolved
[2024-05-30 17:09:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1365 variables, and 221 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/572 constraints, ReadFeed: 0/353 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (OVERLAPS) 2/572 variables, 189/200 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 21/221 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 5 (OVERLAPS) 793/1365 variables, 572/793 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1365 variables, 353/1146 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1365 variables, 788/1934 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1365/1365 variables, and 1934 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 21/21 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62599 ms. Remains : 572/572 places, 793/793 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 129 edges and 572 vertex of which 4 / 572 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1803 edges and 570 vertex of which 568 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 566 transition count 784
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 1 with 3 rules applied. Total rules applied 10 place count 564 transition count 783
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 564 transition count 779
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 564 transition count 747
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 77 place count 564 transition count 747
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 99 place count 564 transition count 725
Applied a total of 99 rules in 64 ms. Remains 564 /572 variables (removed 8) and now considering 725/793 (removed 68) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 725 rows 564 cols
[2024-05-30 17:09:58] [INFO ] Computed 196 invariants in 2 ms
[2024-05-30 17:09:58] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-30 17:09:58] [INFO ] [Nat]Absence check using 196 positive place invariants in 24 ms returned sat
[2024-05-30 17:09:59] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-30 17:09:59] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2024-05-30 17:09:59] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 1 ms to minimize.
[2024-05-30 17:09:59] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 17:09:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 597 ms
[2024-05-30 17:10:00] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 17:10:00] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-30 17:10:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-05-30 17:10:00] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-30 17:10:00] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-30 17:10:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
TRAPS : Iteration 1
[2024-05-30 17:10:00] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-30 17:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
TRAPS : Iteration 2
[2024-05-30 17:10:01] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-30 17:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-30 17:10:01] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-30 17:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
TRAPS : Iteration 3
[2024-05-30 17:10:01] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 17:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
TRAPS : Iteration 4
[2024-05-30 17:10:02] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-30 17:10:02] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-30 17:10:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2024-05-30 17:10:02] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 17:10:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
TRAPS : Iteration 5
[2024-05-30 17:10:03] [INFO ] After 4177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-30 17:10:03] [INFO ] After 4621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-30 17:10:03] [INFO ] Flatten gal took : 51 ms
[2024-05-30 17:10:03] [INFO ] Flatten gal took : 49 ms
[2024-05-30 17:10:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2900399890744978456.gal : 22 ms
[2024-05-30 17:10:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13974139165414169824.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2900399890744978456.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13974139165414169824.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13974139165414169824.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 33
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :33 after 91
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :91 after 3963
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :3963 after 1.92488e+06
Detected timeout of ITS tools.
[2024-05-30 17:10:18] [INFO ] Flatten gal took : 31 ms
[2024-05-30 17:10:18] [INFO ] Applying decomposition
[2024-05-30 17:10:18] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2799761704276922420.txt' '-o' '/tmp/graph2799761704276922420.bin' '-w' '/tmp/graph2799761704276922420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2799761704276922420.bin' '-l' '-1' '-v' '-w' '/tmp/graph2799761704276922420.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:10:18] [INFO ] Decomposing Gal with order
[2024-05-30 17:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:10:19] [INFO ] Removed a total of 648 redundant transitions.
[2024-05-30 17:10:19] [INFO ] Flatten gal took : 120 ms
[2024-05-30 17:10:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 30 ms.
[2024-05-30 17:10:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12194810579172402065.gal : 24 ms
[2024-05-30 17:10:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7902597578393015353.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12194810579172402065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7902597578393015353.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7902597578393015353.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 53
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :53 after 443
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :443 after 1.70494e+14
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-14 is true.
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-09 does not hold.
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-07 does not hold.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-06 is true.
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-01 does not hold.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-00 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.4951e+78,3.12466,120268,1183,27,263047,460,1175,508873,65,1451,0
Total reachable state count : 3.495102776887513112852210042324307143381e+78

Verifying 6 reachability properties.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-00 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-2024-00,6.92643e+41,3.17374,120268,403,23,263047,460,1311,508873,82,1451,0
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-01 does not hold.

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-2024-01,5.63924e+76,3.2024,120268,880,27,263047,460,1401,508873,84,1451,0
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-06 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-2024-06,2.81608e+75,3.2099,120268,317,22,263047,460,1518,508873,84,1451,0
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-07 does not hold.

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-2024-07,4.93985e+76,3.21245,120268,420,24,263047,460,1529,508873,84,1451,0
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-09 does not hold.

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-2024-09,4.64961e+75,3.22127,120268,677,25,263047,460,1582,508873,84,1451,0
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-14 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-2024-14,1.9959e+75,3.22166,120268,448,24,263047,460,1584,508873,84,1451,0
Over-approximation ignoring read arcs solved 0 properties in 23886 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 17:10:22] [INFO ] Flatten gal took : 49 ms
[2024-05-30 17:10:22] [INFO ] Applying decomposition
[2024-05-30 17:10:22] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9715411416686492799.txt' '-o' '/tmp/graph9715411416686492799.bin' '-w' '/tmp/graph9715411416686492799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9715411416686492799.bin' '-l' '-1' '-v' '-w' '/tmp/graph9715411416686492799.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:10:22] [INFO ] Decomposing Gal with order
[2024-05-30 17:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:10:23] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-30 17:10:23] [INFO ] Flatten gal took : 138 ms
[2024-05-30 17:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-30 17:10:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5955207365160837868.gal : 22 ms
[2024-05-30 17:10:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8560902004780915113.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5955207365160837868.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8560902004780915113.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8560902004780915113.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1130
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1130 after 237091
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :237091 after 2.41094e+117
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2.41094e+117 after 2.55642e+117
ITS-tools command line returned an error code 137
[2024-05-30 17:18:18] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5506425543522204725
[2024-05-30 17:18:18] [INFO ] Applying decomposition
[2024-05-30 17:18:18] [INFO ] Computing symmetric may disable matrix : 793 transitions.
[2024-05-30 17:18:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:18:18] [INFO ] Computing symmetric may enable matrix : 793 transitions.
[2024-05-30 17:18:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:18:18] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5455844757469524406.txt' '-o' '/tmp/graph5455844757469524406.bin' '-w' '/tmp/graph5455844757469524406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5455844757469524406.bin' '-l' '-1' '-v' '-w' '/tmp/graph5455844757469524406.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:18:18] [INFO ] Decomposing Gal with order
[2024-05-30 17:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:18:18] [INFO ] Computing Do-Not-Accords matrix : 793 transitions.
[2024-05-30 17:18:18] [INFO ] Removed a total of 1009 redundant transitions.
[2024-05-30 17:18:18] [INFO ] Flatten gal took : 41 ms
[2024-05-30 17:18:18] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 526 labels/synchronizations in 29 ms.
[2024-05-30 17:18:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9025408118610215795.gal : 6 ms
[2024-05-30 17:18:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14728678627494318711.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9025408118610215795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14728678627494318711.prop' '--nowitness'

[2024-05-30 17:18:18] [INFO ] Built C files in 357ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5506425543522204725
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Running compilation step : cd /tmp/ltsmin5506425543522204725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality14728678627494318711.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 82
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :82 after 487
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :487 after 2593
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2593 after 35803
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :35803 after 1.7324e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3.60083e+18 after 3.83183e+22
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-14 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-09 does not hold.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-07 does not hold.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-01 does not hold.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-00 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.83183e+22 after 1.03259e+73
Compilation finished in 2844 ms.
Running link step : cd /tmp/ltsmin5506425543522204725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin5506425543522204725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVtPT050BReachabilityCardinality202406==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
petri\_inst\_inst\_mod\_flat,1.1843e+79,5.5524,144688,1286,211,275002,3131,1442,785723,183,21875,0
Total reachable state count : 1.184299930741260364958424996820741786458e+79

Verifying 6 reachability properties.
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-00 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-2024-00,2.83219e+33,5.57381,144688,405,96,275002,3131,1585,785723,194,21875,1855
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-01 does not hold.

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-2024-01,2.51136e+77,5.58456,144688,1106,158,275002,3131,1683,785723,198,21875,3228
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-06 is true.
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-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-2024-06,4.90428e+57,5.58808,144688,283,70,275002,3131,1721,785723,198,21875,4065
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-07 does not hold.

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-2024-07,2.58291e+77,5.59059,144688,738,174,275002,3131,1733,785723,200,21875,4266
Invariant property ShieldRVt-PT-050B-ReachabilityCardinality-2024-09 does not hold.

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-2024-09,1.78557e+76,5.59724,144688,726,153,275002,3131,1796,785723,202,21875,5047
Reachability property ShieldRVt-PT-050B-ReachabilityCardinality-2024-14 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-2024-14,3.01728e+57,5.59807,144688,441,116,275002,3131,1797,785723,202,21875,5047
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 615925 ms.

BK_STOP 1717089507351

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5568"
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 r356-tall-171683762401038"
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 ;