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-165286024700094.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 ShieldIIPs-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 15:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 29 15:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 15:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 15:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 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 164K 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 ShieldIIPs-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654264914088

Running Version 202205111006
[2022-06-03 14:01:55] [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 14:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:01:55] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-06-03 14:01:55] [INFO ] Transformed 603 places.
[2022-06-03 14:01:55] [INFO ] Transformed 593 transitions.
[2022-06-03 14:01:55] [INFO ] Found NUPN structural information;
[2022-06-03 14:01:55] [INFO ] Parsed PT model containing 603 places and 593 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 692 ms. (steps per millisecond=14 ) properties (out of 16) seen :7
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 593 rows 603 cols
[2022-06-03 14:01:56] [INFO ] Computed 91 place invariants in 15 ms
[2022-06-03 14:01:56] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 14:01:57] [INFO ] [Nat]Absence check using 91 positive place invariants in 21 ms returned sat
[2022-06-03 14:01:57] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2022-06-03 14:01:58] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 3 ms to minimize.
[2022-06-03 14:01:58] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 1 ms to minimize.
[2022-06-03 14:01:58] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:01:58] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2022-06-03 14:01:58] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:01:58] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2022-06-03 14:01:59] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 10 ms to minimize.
[2022-06-03 14:01:59] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2022-06-03 14:01:59] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2022-06-03 14:01:59] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2022-06-03 14:01:59] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2022-06-03 14:01:59] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2022-06-03 14:02:00] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:02:00] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:02:00] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-06-03 14:02:00] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2022-06-03 14:02:00] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2022-06-03 14:02:00] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2022-06-03 14:02:00] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2022-06-03 14:02:01] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2022-06-03 14:02:01] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2022-06-03 14:02:01] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-06-03 14:02:01] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2022-06-03 14:02:01] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-06-03 14:02:01] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-06-03 14:02:01] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4040 ms
[2022-06-03 14:02:01] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 0 ms to minimize.
[2022-06-03 14:02:02] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
[2022-06-03 14:02:02] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2022-06-03 14:02:02] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2022-06-03 14:02:02] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:02:02] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2022-06-03 14:02:02] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2022-06-03 14:02:03] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2022-06-03 14:02:03] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2022-06-03 14:02:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1373 ms
[2022-06-03 14:02:03] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2022-06-03 14:02:03] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2022-06-03 14:02:03] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2022-06-03 14:02:03] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2022-06-03 14:02:03] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2022-06-03 14:02:04] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2022-06-03 14:02:04] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2022-06-03 14:02:04] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2022-06-03 14:02:04] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2022-06-03 14:02:04] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2022-06-03 14:02:04] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2022-06-03 14:02:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1495 ms
[2022-06-03 14:02:04] [INFO ] After 7619ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 380 ms.
[2022-06-03 14:02:05] [INFO ] After 8208ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1372 ms.
Support contains 71 out of 603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 603 transition count 562
Reduce places removed 31 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 572 transition count 557
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 567 transition count 557
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 72 place count 567 transition count 513
Deduced a syphon composed of 44 places in 9 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 160 place count 523 transition count 513
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 209 place count 474 transition count 464
Iterating global reduction 3 with 49 rules applied. Total rules applied 258 place count 474 transition count 464
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 258 place count 474 transition count 454
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 278 place count 464 transition count 454
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 532 place count 337 transition count 327
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 590 place count 337 transition count 327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 591 place count 336 transition count 326
Applied a total of 591 rules in 170 ms. Remains 336 /603 variables (removed 267) and now considering 326/593 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 336/603 places, 326/593 transitions.
Incomplete random walk after 1000000 steps, including 896 resets, run finished after 4981 ms. (steps per millisecond=200 ) properties (out of 3) seen :2
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1678 ms. (steps per millisecond=595 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 326 rows 336 cols
[2022-06-03 14:02:13] [INFO ] Computed 91 place invariants in 13 ms
[2022-06-03 14:02:13] [INFO ] [Real]Absence check using 89 positive place invariants in 26 ms returned sat
[2022-06-03 14:02:13] [INFO ] [Real]Absence check using 89 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-03 14:02:13] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:02:13] [INFO ] [Nat]Absence check using 89 positive place invariants in 13 ms returned sat
[2022-06-03 14:02:13] [INFO ] [Nat]Absence check using 89 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-03 14:02:13] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:02:13] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-06-03 14:02:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 745 ms
[2022-06-03 14:02:14] [INFO ] After 906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-03 14:02:14] [INFO ] After 1007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 13 out of 336 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 336/336 places, 326/326 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 336 transition count 315
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 325 transition count 315
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 22 place count 325 transition count 306
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 316 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 315 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 315 transition count 305
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 128 place count 272 transition count 262
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 141 place count 272 transition count 262
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 268 transition count 258
Applied a total of 145 rules in 51 ms. Remains 268 /336 variables (removed 68) and now considering 258/326 (removed 68) transitions.
Finished structural reductions, in 1 iterations. Remains : 268/336 places, 258/326 transitions.
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 2829 ms. (steps per millisecond=353 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1795 ms. (steps per millisecond=557 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3710819 steps, run timeout after 12001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 3710819 steps, saw 691201 distinct states, run finished after 12003 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 258 rows 268 cols
[2022-06-03 14:02:31] [INFO ] Computed 91 place invariants in 11 ms
[2022-06-03 14:02:31] [INFO ] [Real]Absence check using 90 positive place invariants in 12 ms returned sat
[2022-06-03 14:02:31] [INFO ] [Real]Absence check using 90 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-03 14:02:31] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:02:31] [INFO ] [Nat]Absence check using 90 positive place invariants in 11 ms returned sat
[2022-06-03 14:02:31] [INFO ] [Nat]Absence check using 90 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-03 14:02:31] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:02:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 14:02:31] [INFO ] After 22ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:02:31] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2022-06-03 14:02:31] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2022-06-03 14:02:31] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 10 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 944 ms
[2022-06-03 14:02:32] [INFO ] After 991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-06-03 14:02:32] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 87 ms.
Support contains 13 out of 268 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 268/268 places, 258/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 268 /268 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 268/268 places, 258/258 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 268/268 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 268 /268 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 268 cols
[2022-06-03 14:02:32] [INFO ] Computed 91 place invariants in 11 ms
[2022-06-03 14:02:33] [INFO ] Implicit Places using invariants in 143 ms returned [253]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 267/268 places, 258/258 transitions.
Applied a total of 0 rules in 12 ms. Remains 267 /267 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 267/268 places, 258/258 transitions.
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 2899 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1721 ms. (steps per millisecond=581 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3800442 steps, run timeout after 12001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 3800442 steps, saw 704206 distinct states, run finished after 12001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:02:49] [INFO ] Computed 90 place invariants in 9 ms
[2022-06-03 14:02:49] [INFO ] [Real]Absence check using 89 positive place invariants in 11 ms returned sat
[2022-06-03 14:02:49] [INFO ] [Real]Absence check using 89 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-03 14:02:49] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:02:49] [INFO ] [Nat]Absence check using 89 positive place invariants in 10 ms returned sat
[2022-06-03 14:02:49] [INFO ] [Nat]Absence check using 89 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-03 14:02:49] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 670 ms
[2022-06-03 14:02:50] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-03 14:02:50] [INFO ] After 868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 13 out of 267 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 267/267 places, 258/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 267 /267 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 258/258 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 267/267 places, 258/258 transitions.
Applied a total of 0 rules in 12 ms. Remains 267 /267 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:02:50] [INFO ] Computed 90 place invariants in 10 ms
[2022-06-03 14:02:50] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:02:50] [INFO ] Computed 90 place invariants in 2 ms
[2022-06-03 14:02:51] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2022-06-03 14:02:51] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:02:51] [INFO ] Computed 90 place invariants in 2 ms
[2022-06-03 14:02:51] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 258/258 transitions.
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 2793 ms. (steps per millisecond=358 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3841204 steps, run timeout after 12001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 3841204 steps, saw 710274 distinct states, run finished after 12001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:03:07] [INFO ] Computed 90 place invariants in 8 ms
[2022-06-03 14:03:07] [INFO ] [Real]Absence check using 89 positive place invariants in 11 ms returned sat
[2022-06-03 14:03:07] [INFO ] [Real]Absence check using 89 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-03 14:03:08] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:03:08] [INFO ] [Nat]Absence check using 89 positive place invariants in 11 ms returned sat
[2022-06-03 14:03:08] [INFO ] [Nat]Absence check using 89 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-03 14:03:08] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-06-03 14:03:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 678 ms
[2022-06-03 14:03:08] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-03 14:03:08] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 13 out of 267 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 267/267 places, 258/258 transitions.
Applied a total of 0 rules in 10 ms. Remains 267 /267 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 258/258 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 267/267 places, 258/258 transitions.
Applied a total of 0 rules in 13 ms. Remains 267 /267 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:03:08] [INFO ] Computed 90 place invariants in 3 ms
[2022-06-03 14:03:09] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:03:09] [INFO ] Computed 90 place invariants in 1 ms
[2022-06-03 14:03:09] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2022-06-03 14:03:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:03:09] [INFO ] Computed 90 place invariants in 2 ms
[2022-06-03 14:03:09] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:03:09] [INFO ] Computed 90 place invariants in 1 ms
[2022-06-03 14:03:09] [INFO ] [Real]Absence check using 89 positive place invariants in 11 ms returned sat
[2022-06-03 14:03:09] [INFO ] [Real]Absence check using 89 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-03 14:03:09] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:03:09] [INFO ] [Nat]Absence check using 89 positive place invariants in 10 ms returned sat
[2022-06-03 14:03:09] [INFO ] [Nat]Absence check using 89 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-03 14:03:09] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:03:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-06-03 14:03:09] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2022-06-03 14:03:09] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-06-03 14:03:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 665 ms
[2022-06-03 14:03:10] [INFO ] After 794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-03 14:03:10] [INFO ] After 876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:03:10] [INFO ] Flatten gal took : 65 ms
[2022-06-03 14:03:10] [INFO ] Flatten gal took : 27 ms
[2022-06-03 14:03:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5999788525279068816.gal : 14 ms
[2022-06-03 14:03:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8471421531274756228.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/ReachabilityCardinality5999788525279068816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8471421531274756228.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/ReachabilityCardinality8471421531274756228.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 54
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :54 after 486
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :486 after 4681
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4681 after 5066
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5066 after 8452
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8452 after 11248
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :11248 after 113819
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :113819 after 6.12053e+06
Detected timeout of ITS tools.
[2022-06-03 14:03:25] [INFO ] Flatten gal took : 22 ms
[2022-06-03 14:03:25] [INFO ] Applying decomposition
[2022-06-03 14:03:25] [INFO ] Flatten gal took : 20 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/graph15986477805557524386.txt' '-o' '/tmp/graph15986477805557524386.bin' '-w' '/tmp/graph15986477805557524386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15986477805557524386.bin' '-l' '-1' '-v' '-w' '/tmp/graph15986477805557524386.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:03:25] [INFO ] Decomposing Gal with order
[2022-06-03 14:03:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:03:26] [INFO ] Removed a total of 197 redundant transitions.
[2022-06-03 14:03:26] [INFO ] Flatten gal took : 76 ms
[2022-06-03 14:03:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 15 ms.
[2022-06-03 14:03:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4608906992874926420.gal : 7 ms
[2022-06-03 14:03:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14047769290183589107.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/ReachabilityCardinality4608906992874926420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14047769290183589107.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/ReachabilityCardinality14047769290183589107.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 324
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :123444 after 8.41655e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8.41655e+06 after 1.09609e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.09609e+09 after 2.82117e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.82117e+11 after 8.65309e+13
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2808895806306923315
[2022-06-03 14:03:41] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2808895806306923315
Running compilation step : cd /tmp/ltsmin2808895806306923315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 537 ms.
Running link step : cd /tmp/ltsmin2808895806306923315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2808895806306923315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPsPT010BReachabilityCardinality14==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 14:03:56] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17588840089360945467
[2022-06-03 14:03:56] [INFO ] Applying decomposition
[2022-06-03 14:03:56] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-06-03 14:03:56] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:03:56] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-06-03 14:03:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:03:56] [INFO ] Flatten gal took : 32 ms
[2022-06-03 14:03:56] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-06-03 14:03:56] [INFO ] Flatten gal took : 44 ms
[2022-06-03 14:03:56] [INFO ] Input system was already deterministic with 258 transitions.
[2022-06-03 14:03:56] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:03:56] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17588840089360945467
Running compilation step : cd /tmp/ltsmin17588840089360945467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11265759398038378856.txt' '-o' '/tmp/graph11265759398038378856.bin' '-w' '/tmp/graph11265759398038378856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11265759398038378856.bin' '-l' '-1' '-v' '-w' '/tmp/graph11265759398038378856.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:03:56] [INFO ] Decomposing Gal with order
[2022-06-03 14:03:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:03:56] [INFO ] Ran tautology test, simplified 0 / 1 in 188 ms.
[2022-06-03 14:03:56] [INFO ] Removed a total of 197 redundant transitions.
[2022-06-03 14:03:56] [INFO ] Flatten gal took : 73 ms
[2022-06-03 14:03:56] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=0 took 12 ms
[2022-06-03 14:03:56] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=1 took 7 ms
[2022-06-03 14:03:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 20 ms.
[2022-06-03 14:03:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17305853682259753434.gal : 5 ms
[2022-06-03 14:03:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18099966854599627653.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/ReachabilityCardinality17305853682259753434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18099966854599627653.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality18099966854599627653.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 258 rows 267 cols
[2022-06-03 14:03:56] [INFO ] Computed 90 place invariants in 1 ms
[2022-06-03 14:03:56] [INFO ] Computed 90 place invariants in 2 ms
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 162
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :123444 after 665820
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :665820 after 3.21055e+10
[2022-06-03 14:03:56] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=2 took 364 ms
[2022-06-03 14:03:57] [INFO ] Proved 267 variables to be positive in 426 ms
[2022-06-03 14:03:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:03:57] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=0 took 26 ms
Compilation finished in 879 ms.
Running link step : cd /tmp/ltsmin17588840089360945467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-03 14:03:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:03:57] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=1 took 90 ms
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17588840089360945467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT010BReachabilityCardinality14==true'
[2022-06-03 14:03:59] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=3 took 2820 ms
[2022-06-03 14:04:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:04:11] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=2 took 14228 ms
[2022-06-03 14:04:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:04:31] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=3 took 20432 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.21055e+10 after 3.10077e+15
[2022-06-03 14:05:45] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=4 took 105618 ms
[2022-06-03 14:06:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:06:02] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=4 took 90350 ms
[2022-06-03 14:11:50] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=5 took 365140 ms
[2022-06-03 14:21:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:21:00] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=5 took 898415 ms
[2022-06-03 14:22:35] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=6 took 645139 ms
Detected timeout of ITS tools.
[2022-06-03 14:24:37] [INFO ] Applying decomposition
[2022-06-03 14:24:37] [INFO ] Flatten gal took : 90 ms
[2022-06-03 14:24:37] [INFO ] Decomposing Gal with order
[2022-06-03 14:24:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:24:37] [INFO ] Removed a total of 197 redundant transitions.
[2022-06-03 14:24:37] [INFO ] Flatten gal took : 115 ms
[2022-06-03 14:24:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 8 ms.
[2022-06-03 14:24:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15781086989861345993.gal : 14 ms
[2022-06-03 14:24:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5494822745355060052.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/ReachabilityCardinality15781086989861345993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5494822745355060052.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/ReachabilityCardinality5494822745355060052.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 162
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :123444 after 2.01739e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.01739e+07 after 4.53547e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.53547e+09 after 6.22527e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.22527e+11 after 4.45217e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.45217e+13 after 6.5414e+15
Detected timeout of ITS tools.
[2022-06-03 14:45:18] [INFO ] Flatten gal took : 66 ms
[2022-06-03 14:45:18] [INFO ] Input system was already deterministic with 258 transitions.
[2022-06-03 14:45:18] [INFO ] Transformed 267 places.
[2022-06-03 14:45:18] [INFO ] Transformed 258 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 14:45:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality504414881004280857.gal : 56 ms
[2022-06-03 14:45:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13474333118751150205.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/ReachabilityCardinality504414881004280857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13474333118751150205.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality13474333118751150205.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 206
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :206 after 760
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :760 after 1737
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1737 after 15026
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15026 after 940343
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :940343 after 1.20761e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.20761e+06 after 4.73558e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.73558e+07 after 8.12557e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.12557e+08 after 7.25441e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.25441e+09 after 1.03783e+10
[2022-06-03 14:45:34] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=7 took 1378478 ms
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.03783e+10 after 3.10769e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.10769e+11 after 2.66171e+13
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.66171e+13 after 1.11112e+14
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.11112e+14 after 3.15449e+16
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :3.15449e+16 after 3.33718e+17
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Initializing POR dependencies: labels 259, guards 258
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.217: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 6/ 8), 0.258: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.264: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.262: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.258: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.265: There are 259 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.265: State length is 267, there are 258 groups
pins2lts-mc-linux64( 0/ 8), 0.265: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.265: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.265: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.265: Visible groups: 0 / 258, labels: 1 / 259
pins2lts-mc-linux64( 2/ 8), 0.258: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.265: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.265: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.258: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.262: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.265: "ShieldIIPsPT010BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.286: ~5 levels ~960 states ~6088 transitions
pins2lts-mc-linux64( 0/ 8), 0.314: ~6 levels ~1920 states ~11920 transitions
pins2lts-mc-linux64( 0/ 8), 0.371: ~8 levels ~3840 states ~22648 transitions
pins2lts-mc-linux64( 4/ 8), 0.452: ~6 levels ~7680 states ~40344 transitions
pins2lts-mc-linux64( 4/ 8), 0.670: ~8 levels ~15360 states ~87920 transitions
pins2lts-mc-linux64( 4/ 8), 1.044: ~9 levels ~30720 states ~191784 transitions
pins2lts-mc-linux64( 5/ 8), 1.883: ~10 levels ~61440 states ~405424 transitions
pins2lts-mc-linux64( 5/ 8), 3.496: ~11 levels ~122880 states ~865424 transitions
pins2lts-mc-linux64( 5/ 8), 6.658: ~12 levels ~245760 states ~1811968 transitions
pins2lts-mc-linux64( 7/ 8), 12.614: ~14 levels ~491520 states ~3430608 transitions
pins2lts-mc-linux64( 7/ 8), 23.091: ~15 levels ~983040 states ~6961096 transitions
pins2lts-mc-linux64( 7/ 8), 46.340: ~16 levels ~1966080 states ~14453768 transitions
pins2lts-mc-linux64( 7/ 8), 94.558: ~18 levels ~3932160 states ~29395896 transitions
pins2lts-mc-linux64( 7/ 8), 195.902: ~19 levels ~7864320 states ~59870736 transitions
pins2lts-mc-linux64( 7/ 8), 478.376: ~21 levels ~15728640 states ~123693896 transitions
pins2lts-mc-linux64( 7/ 8), 953.024: ~22 levels ~31457280 states ~255318288 transitions
pins2lts-mc-linux64( 7/ 8), 1945.567: ~24 levels ~62914560 states ~527837280 transitions
pins2lts-mc-linux64( 0/ 8), 2927.244: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2927.259:
pins2lts-mc-linux64( 0/ 8), 2927.259: mean standard work distribution: 9.1% (states) 5.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 2927.259:
pins2lts-mc-linux64( 0/ 8), 2927.259: Explored 81843974 states 801233941 transitions, fanout: 9.790
pins2lts-mc-linux64( 0/ 8), 2927.259: Total exploration time 2926.990 sec (2926.980 sec minimum, 2926.989 sec on average)
pins2lts-mc-linux64( 0/ 8), 2927.259: States per second: 27962, Transitions per second: 273740
pins2lts-mc-linux64( 0/ 8), 2927.259: Ignoring proviso: 40531431
pins2lts-mc-linux64( 0/ 8), 2927.259:
pins2lts-mc-linux64( 0/ 8), 2927.259: Queue width: 8B, total height: 52771364, memory: 402.61MB
pins2lts-mc-linux64( 0/ 8), 2927.259: Tree memory: 1044.1MB, 8.2 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 2927.259: Tree fill ratio (roots/leafs): 99.0%/7.0%
pins2lts-mc-linux64( 0/ 8), 2927.260: Stored 258 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2927.260: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2927.260: Est. total memory use: 1446.8MB (~1426.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17588840089360945467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT010BReachabilityCardinality14==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17588840089360945467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT010BReachabilityCardinality14==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 14:53:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:53:22] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=6 took 1941228 ms
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :3.33718e+17 after 3.60579e+17
[2022-06-03 14:56:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-010B-ReachabilityCardinality-14
[2022-06-03 14:56:53] [INFO ] KInduction solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(SAT) depth K=7 took 211027 ms
SDD proceeding with computation,1 properties remain. new max is 4194304
SDD size :3.60579e+17 after 4.83569e+20
[2022-06-03 15:01:32] [INFO ] BMC solution for property ShieldIIPs-PT-010B-ReachabilityCardinality-14(UNSAT) depth K=8 took 957846 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldIIPs-PT-010B"
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 ShieldIIPs-PT-010B, 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-165286024700094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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