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.r233-tall-165286037500327.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 gold2021
Input is ShieldRVs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037500327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K Apr 30 07:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 07:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 07:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 07:08 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.8K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 07:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 30 07:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 30 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 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 652K 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 ShieldRVs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655080615912

Running Version 0
[2022-06-13 00:36:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 00:36:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 00:36:57] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2022-06-13 00:36:57] [INFO ] Transformed 1403 places.
[2022-06-13 00:36:57] [INFO ] Transformed 1903 transitions.
[2022-06-13 00:36:57] [INFO ] Found NUPN structural information;
[2022-06-13 00:36:57] [INFO ] Parsed PT model containing 1403 places and 1903 transitions in 280 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 16) seen :5
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 10) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1903 rows 1403 cols
[2022-06-13 00:36:58] [INFO ] Computed 401 place invariants in 31 ms
[2022-06-13 00:36:59] [INFO ] [Real]Absence check using 401 positive place invariants in 96 ms returned sat
[2022-06-13 00:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:36:59] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2022-06-13 00:37:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 93 ms returned sat
[2022-06-13 00:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:01] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2022-06-13 00:37:01] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 5 ms to minimize.
[2022-06-13 00:37:01] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 2 ms to minimize.
[2022-06-13 00:37:01] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2022-06-13 00:37:01] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2022-06-13 00:37:02] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2022-06-13 00:37:02] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-13 00:37:02] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2022-06-13 00:37:02] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2022-06-13 00:37:02] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-06-13 00:37:02] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2022-06-13 00:37:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2022-06-13 00:37:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2643 ms
[2022-06-13 00:37:03] [INFO ] Computed and/alt/rep : 911/3364/911 causal constraints (skipped 991 transitions) in 137 ms.
[2022-06-13 00:37:05] [INFO ] Deduced a trap composed of 3 places in 880 ms of which 2 ms to minimize.
[2022-06-13 00:37:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 00:37:06] [INFO ] [Real]Absence check using 401 positive place invariants in 90 ms returned sat
[2022-06-13 00:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:07] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2022-06-13 00:37:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:07] [INFO ] [Nat]Absence check using 401 positive place invariants in 100 ms returned sat
[2022-06-13 00:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:08] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2022-06-13 00:37:08] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-06-13 00:37:08] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-06-13 00:37:08] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2022-06-13 00:37:08] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-06-13 00:37:08] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-13 00:37:09] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2022-06-13 00:37:09] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:37:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 926 ms
[2022-06-13 00:37:09] [INFO ] Computed and/alt/rep : 911/3364/911 causal constraints (skipped 991 transitions) in 132 ms.
[2022-06-13 00:37:12] [INFO ] Deduced a trap composed of 3 places in 855 ms of which 2 ms to minimize.
[2022-06-13 00:37:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-13 00:37:13] [INFO ] [Real]Absence check using 401 positive place invariants in 97 ms returned sat
[2022-06-13 00:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:13] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2022-06-13 00:37:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:14] [INFO ] [Nat]Absence check using 401 positive place invariants in 89 ms returned sat
[2022-06-13 00:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:14] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
[2022-06-13 00:37:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2022-06-13 00:37:16] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2022-06-13 00:37:16] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-06-13 00:37:16] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2022-06-13 00:37:16] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-06-13 00:37:17] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2022-06-13 00:37:17] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2022-06-13 00:37:17] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2022-06-13 00:37:17] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-06-13 00:37:17] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2022-06-13 00:37:18] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-06-13 00:37:18] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2022-06-13 00:37:18] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-06-13 00:37:18] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2022-06-13 00:37:18] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2022-06-13 00:37:18] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2022-06-13 00:37:19] [INFO ] Deduced a trap composed of 3 places in 834 ms of which 5 ms to minimize.
[2022-06-13 00:37:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-13 00:37:20] [INFO ] [Real]Absence check using 401 positive place invariants in 89 ms returned sat
[2022-06-13 00:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:20] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2022-06-13 00:37:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:21] [INFO ] [Nat]Absence check using 401 positive place invariants in 89 ms returned sat
[2022-06-13 00:37:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:21] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 10 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2022-06-13 00:37:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 906 ms
[2022-06-13 00:37:22] [INFO ] Computed and/alt/rep : 911/3364/911 causal constraints (skipped 991 transitions) in 96 ms.
[2022-06-13 00:37:26] [INFO ] Deduced a trap composed of 3 places in 846 ms of which 2 ms to minimize.
[2022-06-13 00:37:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-13 00:37:27] [INFO ] [Real]Absence check using 401 positive place invariants in 131 ms returned sat
[2022-06-13 00:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:28] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2022-06-13 00:37:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 105 ms returned sat
[2022-06-13 00:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:29] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2022-06-13 00:37:29] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
[2022-06-13 00:37:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1082 ms
[2022-06-13 00:37:31] [INFO ] Computed and/alt/rep : 911/3364/911 causal constraints (skipped 991 transitions) in 94 ms.
[2022-06-13 00:37:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-13 00:37:33] [INFO ] [Real]Absence check using 401 positive place invariants in 105 ms returned sat
[2022-06-13 00:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:35] [INFO ] [Real]Absence check using state equation in 1352 ms returned sat
[2022-06-13 00:37:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:35] [INFO ] [Nat]Absence check using 401 positive place invariants in 109 ms returned sat
[2022-06-13 00:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:36] [INFO ] [Nat]Absence check using state equation in 1438 ms returned sat
[2022-06-13 00:37:36] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2022-06-13 00:37:37] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2022-06-13 00:37:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-06-13 00:37:37] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-06-13 00:37:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-06-13 00:37:37] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-06-13 00:37:37] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-06-13 00:37:37] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-06-13 00:37:38] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:37:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1249 ms
[2022-06-13 00:37:38] [INFO ] Computed and/alt/rep : 911/3364/911 causal constraints (skipped 991 transitions) in 94 ms.
[2022-06-13 00:37:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-13 00:37:40] [INFO ] [Real]Absence check using 401 positive place invariants in 111 ms returned sat
[2022-06-13 00:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:41] [INFO ] [Real]Absence check using state equation in 1403 ms returned sat
[2022-06-13 00:37:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:42] [INFO ] [Nat]Absence check using 401 positive place invariants in 119 ms returned sat
[2022-06-13 00:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:43] [INFO ] [Nat]Absence check using state equation in 1701 ms returned sat
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:37:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-06-13 00:37:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1853 ms
[2022-06-13 00:37:45] [INFO ] Computed and/alt/rep : 911/3364/911 causal constraints (skipped 991 transitions) in 90 ms.
[2022-06-13 00:37:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
[2022-06-13 00:37:47] [INFO ] [Real]Absence check using 401 positive place invariants in 116 ms returned sat
[2022-06-13 00:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:48] [INFO ] [Real]Absence check using state equation in 1425 ms returned sat
[2022-06-13 00:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 129 ms returned sat
[2022-06-13 00:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:50] [INFO ] [Nat]Absence check using state equation in 1549 ms returned sat
[2022-06-13 00:37:50] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2022-06-13 00:37:50] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2022-06-13 00:37:51] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-06-13 00:37:51] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-06-13 00:37:51] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-06-13 00:37:51] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2022-06-13 00:37:51] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-06-13 00:37:51] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2022-06-13 00:37:51] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-06-13 00:37:52] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2022-06-13 00:37:52] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-06-13 00:37:52] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-06-13 00:37:52] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-06-13 00:37:52] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-06-13 00:37:52] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-06-13 00:37:52] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2022-06-13 00:37:53] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2022-06-13 00:37:53] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-13 00:37:53] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-06-13 00:37:53] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-06-13 00:37:53] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2022-06-13 00:37:53] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:37:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3143 ms
[2022-06-13 00:37:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
[2022-06-13 00:37:54] [INFO ] [Real]Absence check using 401 positive place invariants in 98 ms returned sat
[2022-06-13 00:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:54] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2022-06-13 00:37:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:37:55] [INFO ] [Nat]Absence check using 401 positive place invariants in 95 ms returned sat
[2022-06-13 00:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:37:56] [INFO ] [Nat]Absence check using state equation in 1133 ms returned sat
[2022-06-13 00:37:56] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2022-06-13 00:37:56] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2022-06-13 00:37:56] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-06-13 00:37:56] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2022-06-13 00:37:57] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2022-06-13 00:37:57] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2022-06-13 00:37:57] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-06-13 00:37:57] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2022-06-13 00:37:57] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2022-06-13 00:37:57] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
[2022-06-13 00:37:58] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-06-13 00:37:59] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-06-13 00:37:59] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2022-06-13 00:37:59] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2022-06-13 00:37:59] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2022-06-13 00:37:59] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2022-06-13 00:37:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3215 ms
[2022-06-13 00:37:59] [INFO ] Computed and/alt/rep : 911/3364/911 causal constraints (skipped 991 transitions) in 96 ms.
[2022-06-13 00:37:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
Fused 9 Parikh solutions to 1 different solutions.
Support contains 302 out of 1403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 140 times.
Drop transitions removed 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 142 place count 1402 transition count 1902
Applied a total of 142 rules in 396 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1402/1403 places, 1902/1903 transitions.
[2022-06-13 00:38:00] [INFO ] Flatten gal took : 272 ms
[2022-06-13 00:38:00] [INFO ] Flatten gal took : 136 ms
[2022-06-13 00:38:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15634129838772075148.gal : 49 ms
[2022-06-13 00:38:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8802462099749449877.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15634129838772075148.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8802462099749449877.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15634129838772075148.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8802462099749449877.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8802462099749449877.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :134 after 590
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :590 after 25556
Reachability property ShieldRVs-PT-100A-ReachabilityFireability-07 is true.
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :25556 after 322178
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :322178 after 4.25905e+06
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :4.25905e+06 after 2.6467e+07
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2.6467e+07 after 5.16664e+08
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :5.16664e+08 after 4.92643e+10
Detected timeout of ITS tools.
[2022-06-13 00:38:16] [INFO ] Flatten gal took : 116 ms
[2022-06-13 00:38:16] [INFO ] Applying decomposition
[2022-06-13 00:38:16] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph712889708698833584.txt, -o, /tmp/graph712889708698833584.bin, -w, /tmp/graph712889708698833584.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph712889708698833584.bin, -l, -1, -v, -w, /tmp/graph712889708698833584.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:38:16] [INFO ] Decomposing Gal with order
[2022-06-13 00:38:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:38:17] [INFO ] Removed a total of 2203 redundant transitions.
[2022-06-13 00:38:17] [INFO ] Flatten gal took : 342 ms
[2022-06-13 00:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2178 labels/synchronizations in 200 ms.
[2022-06-13 00:38:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16423751383241160462.gal : 50 ms
[2022-06-13 00:38:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7903554809340134801.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16423751383241160462.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7903554809340134801.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16423751383241160462.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7903554809340134801.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7903554809340134801.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6138548270482377482
[2022-06-13 00:38:32] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6138548270482377482
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6138548270482377482]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6138548270482377482] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6138548270482377482] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 845 resets, run finished after 8978 ms. (steps per millisecond=111 ) properties (out of 8) seen :2
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 905462 steps, including 66 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen :{0=1}
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 852289 steps, including 51 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen :{0=1}
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 750690 steps, including 64 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen :{0=1}
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 768522 steps, including 72 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen :{0=1}
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 692177 steps, including 52 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :{0=1}
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 864282 steps, including 68 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:39:12] [INFO ] Computed 401 place invariants in 26 ms
[2022-06-13 00:39:13] [INFO ] [Real]Absence check using 401 positive place invariants in 88 ms returned sat
[2022-06-13 00:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:39:14] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2022-06-13 00:39:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:39:14] [INFO ] [Nat]Absence check using 401 positive place invariants in 96 ms returned sat
[2022-06-13 00:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:39:15] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2022-06-13 00:39:15] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2022-06-13 00:39:15] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2022-06-13 00:39:15] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-06-13 00:39:16] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-06-13 00:39:16] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-06-13 00:39:16] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-06-13 00:39:16] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2022-06-13 00:39:16] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-06-13 00:39:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:39:17] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:39:18] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:39:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2941 ms
[2022-06-13 00:39:18] [INFO ] Computed and/alt/rep : 853/3869/853 causal constraints (skipped 1048 transitions) in 89 ms.
[2022-06-13 00:39:35] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2022-06-13 00:39:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2022-06-13 00:39:36] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-13 00:39:36] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-06-13 00:39:36] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-13 00:39:36] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-13 00:39:36] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-13 00:39:37] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2022-06-13 00:39:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2022-06-13 00:39:37] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2022-06-13 00:39:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2166 ms
[2022-06-13 00:39:38] [INFO ] Added : 696 causal constraints over 141 iterations in 19871 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 58 ms.
Incomplete Parikh walk after 231800 steps, including 1145 resets, run finished after 2125 ms. (steps per millisecond=109 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 24 out of 1402 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 1402 transition count 1902
Applied a total of 60 rules in 259 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1402/1402 places, 1902/1902 transitions.
[2022-06-13 00:39:40] [INFO ] Flatten gal took : 127 ms
[2022-06-13 00:39:40] [INFO ] Flatten gal took : 122 ms
[2022-06-13 00:39:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15859014660135932476.gal : 10 ms
[2022-06-13 00:39:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1742107811564117487.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15859014660135932476.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1742107811564117487.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15859014660135932476.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1742107811564117487.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1742107811564117487.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 566
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :566 after 25570
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25570 after 171146
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :171146 after 3.62299e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.62299e+06 after 3.34271e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.34271e+08 after 4.82497e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.82497e+10 after 2.22382e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.22382e+13 after 2.18047e+16
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.33447e+20
Detected timeout of ITS tools.
[2022-06-13 00:39:55] [INFO ] Flatten gal took : 91 ms
[2022-06-13 00:39:55] [INFO ] Applying decomposition
[2022-06-13 00:39:56] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15649448684387971380.txt, -o, /tmp/graph15649448684387971380.bin, -w, /tmp/graph15649448684387971380.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15649448684387971380.bin, -l, -1, -v, -w, /tmp/graph15649448684387971380.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:39:56] [INFO ] Decomposing Gal with order
[2022-06-13 00:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:39:56] [INFO ] Removed a total of 2181 redundant transitions.
[2022-06-13 00:39:56] [INFO ] Flatten gal took : 136 ms
[2022-06-13 00:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2435 labels/synchronizations in 84 ms.
[2022-06-13 00:39:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4937691975307254193.gal : 13 ms
[2022-06-13 00:39:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15532243586414894229.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4937691975307254193.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15532243586414894229.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4937691975307254193.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15532243586414894229.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15532243586414894229.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15609495153081221436
[2022-06-13 00:40:11] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15609495153081221436
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15609495153081221436]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15609495153081221436] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15609495153081221436] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 879 resets, run finished after 8118 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 852039 steps, including 70 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen :{}
Interrupted probabilistic random walk after 2156371 steps, run timeout after 30001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 2156371 steps, saw 1896741 distinct states, run finished after 30001 ms. (steps per millisecond=71 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:40:55] [INFO ] Computed 401 place invariants in 39 ms
[2022-06-13 00:40:56] [INFO ] [Real]Absence check using 401 positive place invariants in 87 ms returned sat
[2022-06-13 00:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:40:56] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2022-06-13 00:40:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:40:57] [INFO ] [Nat]Absence check using 401 positive place invariants in 88 ms returned sat
[2022-06-13 00:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:40:58] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2022-06-13 00:40:58] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-06-13 00:40:58] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2022-06-13 00:40:58] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-06-13 00:40:58] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2022-06-13 00:40:59] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-06-13 00:40:59] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-06-13 00:40:59] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-06-13 00:40:59] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2022-06-13 00:40:59] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2022-06-13 00:40:59] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-06-13 00:40:59] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-06-13 00:41:00] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2022-06-13 00:41:00] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2022-06-13 00:41:00] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2022-06-13 00:41:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2022-06-13 00:41:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2022-06-13 00:41:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2022-06-13 00:41:00] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2265 ms
[2022-06-13 00:41:00] [INFO ] Computed and/alt/rep : 810/3876/810 causal constraints (skipped 1091 transitions) in 90 ms.
[2022-06-13 00:41:18] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2022-06-13 00:41:18] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-06-13 00:41:19] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-06-13 00:41:19] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:41:19] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:41:19] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:41:20] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:41:20] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:41:20] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2022-06-13 00:41:20] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:41:20] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2022-06-13 00:41:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:41:21] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:41:21] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2022-06-13 00:41:21] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3092 ms
[2022-06-13 00:41:21] [INFO ] Added : 640 causal constraints over 128 iterations in 21334 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
Incomplete Parikh walk after 198100 steps, including 1075 resets, run finished after 1827 ms. (steps per millisecond=108 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 24 out of 1402 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 60 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1402/1402 places, 1902/1902 transitions.
Starting structural reductions, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 55 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:41:24] [INFO ] Computed 401 place invariants in 6 ms
[2022-06-13 00:41:24] [INFO ] Implicit Places using invariants in 823 ms returned []
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:41:24] [INFO ] Computed 401 place invariants in 7 ms
[2022-06-13 00:41:26] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2849 ms to find 0 implicit places.
[2022-06-13 00:41:27] [INFO ] Redundant transitions in 578 ms returned []
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:41:27] [INFO ] Computed 401 place invariants in 5 ms
[2022-06-13 00:41:28] [INFO ] Dead Transitions using invariants and state equation in 924 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 100000 steps, including 88 resets, run finished after 880 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:41:29] [INFO ] Computed 401 place invariants in 13 ms
[2022-06-13 00:41:29] [INFO ] [Real]Absence check using 401 positive place invariants in 88 ms returned sat
[2022-06-13 00:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:41:30] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-06-13 00:41:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:41:30] [INFO ] [Nat]Absence check using 401 positive place invariants in 93 ms returned sat
[2022-06-13 00:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:41:31] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2022-06-13 00:41:31] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-06-13 00:41:32] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-06-13 00:41:32] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-06-13 00:41:32] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2022-06-13 00:41:32] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-06-13 00:41:32] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-06-13 00:41:32] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2022-06-13 00:41:33] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:41:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2022-06-13 00:41:34] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2402 ms
[2022-06-13 00:41:34] [INFO ] Computed and/alt/rep : 810/3876/810 causal constraints (skipped 1091 transitions) in 113 ms.
[2022-06-13 00:41:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 00:41:50] [INFO ] Flatten gal took : 91 ms
[2022-06-13 00:41:50] [INFO ] Flatten gal took : 92 ms
[2022-06-13 00:41:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4405289957578293503.gal : 9 ms
[2022-06-13 00:41:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6500028166970265533.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4405289957578293503.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6500028166970265533.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4405289957578293503.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6500028166970265533.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6500028166970265533.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 566
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :566 after 25570
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25570 after 171146
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :171146 after 3.62299e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.62299e+06 after 3.34271e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.34271e+08 after 4.82497e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.82497e+10 after 2.22382e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.22382e+13 after 2.18047e+16
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.33447e+20
Detected timeout of ITS tools.
[2022-06-13 00:42:05] [INFO ] Flatten gal took : 89 ms
[2022-06-13 00:42:05] [INFO ] Applying decomposition
[2022-06-13 00:42:05] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph963005004958757245.txt, -o, /tmp/graph963005004958757245.bin, -w, /tmp/graph963005004958757245.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph963005004958757245.bin, -l, -1, -v, -w, /tmp/graph963005004958757245.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:42:06] [INFO ] Decomposing Gal with order
[2022-06-13 00:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:42:06] [INFO ] Removed a total of 2175 redundant transitions.
[2022-06-13 00:42:06] [INFO ] Flatten gal took : 132 ms
[2022-06-13 00:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2538 labels/synchronizations in 84 ms.
[2022-06-13 00:42:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4783298716628319804.gal : 14 ms
[2022-06-13 00:42:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9658978472060607331.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4783298716628319804.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9658978472060607331.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4783298716628319804.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9658978472060607331.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9658978472060607331.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15529542312346469848
[2022-06-13 00:42:21] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15529542312346469848
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15529542312346469848]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15529542312346469848] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15529542312346469848] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Applied a total of 0 rules in 73 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:42:22] [INFO ] Computed 401 place invariants in 5 ms
[2022-06-13 00:42:22] [INFO ] [Real]Absence check using 401 positive place invariants in 92 ms returned sat
[2022-06-13 00:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:42:23] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2022-06-13 00:42:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:42:24] [INFO ] [Nat]Absence check using 401 positive place invariants in 91 ms returned sat
[2022-06-13 00:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:42:25] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2022-06-13 00:42:25] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-06-13 00:42:25] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2022-06-13 00:42:25] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-06-13 00:42:25] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2022-06-13 00:42:26] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-06-13 00:42:26] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-06-13 00:42:26] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-06-13 00:42:26] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2022-06-13 00:42:26] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2022-06-13 00:42:26] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-06-13 00:42:26] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-06-13 00:42:27] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2022-06-13 00:42:27] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2022-06-13 00:42:27] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-06-13 00:42:27] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-13 00:42:27] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2022-06-13 00:42:27] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:42:27] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2419 ms
[2022-06-13 00:42:27] [INFO ] Computed and/alt/rep : 810/3876/810 causal constraints (skipped 1091 transitions) in 90 ms.
[2022-06-13 00:42:45] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-06-13 00:42:46] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-13 00:42:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-06-13 00:42:46] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-06-13 00:42:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-06-13 00:42:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-06-13 00:42:47] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2022-06-13 00:42:47] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:42:47] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-13 00:42:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2022-06-13 00:42:48] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2022-06-13 00:42:48] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
[2022-06-13 00:42:48] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:42:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2022-06-13 00:42:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3174 ms
[2022-06-13 00:42:49] [INFO ] Added : 640 causal constraints over 128 iterations in 21433 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-13 00:42:49] [INFO ] Flatten gal took : 88 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8240857659896690923
[2022-06-13 00:42:49] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2022-06-13 00:42:49] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8240857659896690923
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8240857659896690923]
[2022-06-13 00:42:49] [INFO ] Applying decomposition
[2022-06-13 00:42:49] [INFO ] Flatten gal took : 130 ms
[2022-06-13 00:42:49] [INFO ] Flatten gal took : 112 ms
[2022-06-13 00:42:49] [INFO ] Input system was already deterministic with 1902 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1632544732857285514.txt, -o, /tmp/graph1632544732857285514.bin, -w, /tmp/graph1632544732857285514.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1632544732857285514.bin, -l, -1, -v, -w, /tmp/graph1632544732857285514.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:42:49] [INFO ] Decomposing Gal with order
[2022-06-13 00:42:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:42:50] [INFO ] Removed a total of 2177 redundant transitions.
[2022-06-13 00:42:50] [INFO ] Flatten gal took : 121 ms
[2022-06-13 00:42:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2505 labels/synchronizations in 83 ms.
[2022-06-13 00:42:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6691460942794210378.gal : 12 ms
[2022-06-13 00:42:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9180463136024742740.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability6691460942794210378.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability9180463136024742740.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability6691460942794210378.gal -t CGAL -reachable-file /tmp/ReachabilityFireability9180463136024742740.prop --nowitness
Loading property file /tmp/ReachabilityFireability9180463136024742740.prop.
[2022-06-13 00:42:50] [INFO ] Ran tautology test, simplified 0 / 1 in 1134 ms.
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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
[2022-06-13 00:42:50] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=0 took 32 ms
[2022-06-13 00:42:50] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=1 took 60 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1902 rows 1402 cols
[2022-06-13 00:42:51] [INFO ] Computed 401 place invariants in 6 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p479 + p480 + p481 + p482 = 1
inv : p0 + p751 + p752 + p753 + p754 = 1
inv : p0 + p1105 + p1106 + p1107 + p1108 = 1
inv : p0 + p1239 + p1240 = 1
inv : p0 + p1309 + p1310 = 1
inv : p0 + p289 + p290 + p291 + p292 = 1
inv : p0 + p1161 + p1162 + p1163 + p1164 = 1
inv : p0 + p807 + p808 + p809 + p810 = 1
inv : p0 + p125 + p126 + p127 + p128 = 1
inv : p0 + p997 + p998 + p999 + p1000 = 1
inv : p0 + p643 + p644 + p645 + p646 = 1
inv : p0 + p1325 + p1326 + p1327 + p1328 = 1
inv : p0 + p695 + p696 + p697 + p698 = 1
inv : p0 + p535 + p536 + p537 + p538 = 1
inv : p0 + p1053 + p1054 + p1055 + p1056 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p1213 + p1214 + p1215 + p1216 = 1
inv : p0 + p587 + p588 + p589 + p590 = 1
inv : p0 + p69 + p70 + p71 + p72 = 1
inv : p0 + p345 + p346 + p347 + p348 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p885 + p886 + p887 + p888 = 1
inv : p0 + p17 + p18 + p19 + p20 = 1
inv : p0 + p237 + p238 + p239 + p240 = 1
inv : p0 + p177 + p178 + p179 + p180 = 1
inv : p0 + p367 + p368 + p369 + p370 = 1
inv : p0 + p993 + p994 + p995 + p996 = 1
inv : p0 + p401 + p402 + p403 + p404 = 1
inv : p0 + p639 + p640 + p641 + p642 = 1
inv : p0 + p385 + p386 = 1
inv : p0 + p591 + p592 + p593 + p594 = 1
inv : p0 + p863 + p864 + p865 + p866 = 1
inv : p0 + p315 + p316 = 1
inv : p0 + p829 + p830 + p831 + p832 = 1
inv : p0 + p293 + p294 + p295 + p296 = 1
inv : p0 + p525 + p526 = 1
inv : p0 + p129 + p130 + p131 + p132 = 1
inv : p0 + p455 + p456 = 1
inv : p0 + p423 + p424 + p425 + p426 = 1
inv : p0 + p1291 + p1292 + p1293 + p1294 = 1
inv : p0 + p699 + p700 + p701 + p702 = 1
inv : p0 + p65 + p66 + p67 + p68 = 1
inv : p0 + p595 + p596 = 1
inv : p0 + p531 + p532 + p533 + p534 = 1
inv : p0 + p1101 + p1102 + p1103 + p1104 = 1
inv : p0 + p665 + p666 = 1
inv : p0 + p233 + p234 + p235 + p236 = 1
inv : p0 + p1269 + p1270 + p1271 + p1272 = 1
inv : p0 + p735 + p736 = 1
inv : p0 + p469 + p470 = 1
inv : p0 + p867 + p868 + p869 + p870 = 1
inv : p0 + p241 + p242 + p243 + p244 = 1
inv : p0 + p513 + p514 + p515 + p516 = 1
inv : p0 + p1343 + p1344 + p1345 + p1346 = 1
inv : p0 + p703 + p704 + p705 + p706 = 1
inv : p0 + p539 + p540 = 1
inv : p0 + p349 + p350 + p351 + p352 = 1
inv : p0 + p975 + p976 + p977 + p978 = 1
inv : p0 + p773 + p774 + p775 + p776 = 1
inv : p0 + p989 + p990 + p991 + p992 = 1
inv : p0 + p255 + p256 + p257 + p258 = 1
inv : p0 + p457 + p458 + p459 + p460 = 1
inv : p0 + p679 + p680 = 1
inv : p0 + p1165 + p1166 + p1167 + p1168 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p297 + p298 + p299 + p300 = 1
inv : p0 + p1287 + p1288 + p1289 + p1290 = 1
inv : p0 + p825 + p826 + p827 + p828 = 1
inv : p0 + p609 + p610 = 1
inv : p0 + p419 + p420 + p421 + p422 = 1
inv : p0 + p185 + p186 + p187 + p188 = 1
inv : p0 + p937 + p938 + p939 + p940 = 1
inv : p0 + p107 + p108 + p109 + p110 = 1
inv : p0 + p1045 + p1046 + p1047 + p1048 = 1
inv : p0 + p1273 + p1274 + p1275 + p1276 = 1
inv : p0 + p399 + p400 = 1
inv : p0 + p329 + p330 = 1
inv : p0 + p1235 + p1236 + p1237 + p1238 = 1
inv : p0 + p717 + p718 + p719 + p720 = 1
inv : p0 + p527 + p528 + p529 + p530 = 1
inv : p0 + p405 + p406 + p407 + p408 = 1
inv : p0 + p13 + p14 + p15 + p16 = 1
inv : p0 + p1381 + p1382 + p1383 + p1384 = 1
inv : p0 + p755 + p756 + p757 + p758 = 1
inv : p0 + p819 + p820 = 1
inv : p0 + p1109 + p1110 + p1111 + p1112 = 1
inv : p0 + p889 + p890 = 1
inv : p0 + p1395 + p1396 + p1397 + p1398 = 1
inv : p0 + p1217 + p1218 + p1219 + p1220 = 1
inv : p0 + p121 + p122 + p123 + p124 = 1
inv : p0 + p749 + p750 = 1
inv : p0 + p475 + p476 + p477 + p478 = 1
inv : p0 + p647 + p648 + p649 + p650 = 1
inv : p0 + p1029 + p1030 = 1
inv : p0 + p1379 + p1380 = 1
inv : p0 + p811 + p812 + p813 + p814 = 1
inv : p0 + p311 + p312 + p313 + p314 = 1
inv : p0 + p1179 + p1180 + p1181 + p1182 = 1
inv : p0 + p583 + p584 + p585 + p586 = 1
inv : p0 + p919 + p920 + p921 + p922 = 1
inv : p0 + p959 + p960 = 1
inv : p0 + p1169 + p1170 = 1
inv : p0 + p51 + p52 + p53 + p54 = 1
inv : p0 + p1099 + p1100 = 1
inv : p0 + p881 + p882 + p883 + p884 = 1
inv : p0 + p275 + p276 + p277 + p278 = 1
inv : p0 + p629 + p630 + p631 + p632 = 1
inv : p0 + p493 + p494 + p495 + p496 = 1
inv : p0 + p139 + p140 + p141 + p142 = 1
inv : p0 + p983 + p984 + p985 + p986 = 1
inv : p0 + p111 + p112 + p113 + p114 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p465 + p466 + p467 + p468 = 1
inv : p0 + p833 + p834 = 1
inv : p0 + p83 + p84 + p85 + p86 = 1
inv : p0 + p973 + p974 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p1199 + p1200 + p1201 + p1202 = 1
inv : p0 + p1175 + p1176 + p1177 + p1178 = 1
inv : p0 + p709 + p710 + p711 + p712 = 1
inv : p0 + p899 + p900 + p901 + p902 = 1
inv : p0 + p1295 + p1296 = 1
inv : p0 + p793 + p794 + p795 + p796 = 1
inv : p0 + p223 + p224 + p225 + p226 = 1
inv : p0 + p657 + p658 + p659 + p660 = 1
inv : p0 + p1227 + p1228 + p1229 + p1230 = 1
inv : p0 + p693 + p694 = 1
inv : p0 + p353 + p354 + p355 + p356 = 1
inv : p0 + p1367 + p1368 + p1369 + p1370 = 1
inv : p0 + p1253 + p1254 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p1123 + p1124 + p1125 + p1126 = 1
inv : p0 + p1203 + p1204 + p1205 + p1206 = 1
inv : p0 + p769 + p770 + p771 + p772 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p1035 + p1036 + p1037 + p1038 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p163 + p164 + p165 + p166 = 1
inv : p0 + p1155 + p1156 = 1
inv : p0 + p87 + p88 + p89 + p90 = 1
inv : p0 + p1113 + p1114 = 1
inv : p0 + p59 + p60 + p61 + p62 = 1
inv : p0 + p933 + p934 + p935 + p936 = 1
inv : p0 + p1015 + p1016 = 1
inv : p0 + p1063 + p1064 + p1065 + p1066 = 1
inv : p0 + p1339 + p1340 + p1341 + p1342 = 1
inv : p0 + p303 + p304 + p305 + p306 = 1
inv : p0 + p759 + p760 + p761 + p762 = 1
inv : p0 + p875 + p876 = 1
inv : p0 + p135 + p136 + p137 + p138 = 1
inv : p0 + p363 + p364 + p365 + p366 = 1
inv : p0 + p797 + p798 + p799 + p800 = 1
inv : p0 + p569 + p570 + p571 + p572 = 1
inv : p0 + p325 + p326 + p327 + p328 = 1
inv : p0 + p731 + p732 + p733 + p734 = 1
inv : p0 + p377 + p378 + p379 + p380 = 1
inv : p0 + p23 + p24 + p25 + p26 = 1
inv : p0 + p745 + p746 + p747 + p748 = 1
inv : p0 + p391 + p392 + p393 + p394 = 1
inv : p0 + p1001 + p1002 = 1
inv : p0 + p541 + p542 + p543 + p544 = 1
inv : p0 + p1267 + p1268 = 1
inv : p0 + p1329 + p1330 + p1331 + p1332 = 1
inv : p0 + p213 + p214 + p215 + p216 = 1
inv : p0 + p909 + p910 + p911 + p912 = 1
inv : p0 + p555 + p556 + p557 + p558 = 1
inv : p0 + p947 + p948 + p949 + p950 = 1
inv : p0 + p1151 + p1152 + p1153 + p1154 = 1
inv : p0 + p1137 + p1138 + p1139 + p1140 = 1
inv : p0 + p1127 + p1128 = 1
inv : p0 + p199 + p200 + p201 + p202 = 1
inv : p0 + p1141 + p1142 = 1
inv : p0 + p1281 + p1282 = 1
inv : p0 + p923 + p924 + p925 + p926 = 1
inv : p0 + p9 + p10 + p11 + p12 = 1
inv : p0 + p961 + p962 + p963 + p964 = 1
inv : p0 + p149 + p150 + p151 + p152 = 1
inv : p0 + p605 + p606 + p607 + p608 = 1
inv : p0 + p987 + p988 = 1
inv : p0 + p251 + p252 + p253 + p254 = 1
inv : p0 + p721 + p722 = 1
inv : p0 + p339 + p340 + p341 + p342 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p415 + p416 + p417 + p418 = 1
inv : p0 + p871 + p872 + p873 + p874 = 1
inv : p0 + p517 + p518 + p519 + p520 = 1
inv : p0 + p681 + p682 + p683 + p684 = 1
inv : p0 + p861 + p862 = 1
inv : p0 + p1049 + p1050 + p1051 + p1052 = 1
inv : p0 + p73 + p74 + p75 + p76 = 1
inv : p0 + p783 + p784 + p785 + p786 = 1
inv : p0 + p821 + p822 + p823 + p824 = 1
inv : p0 + p441 + p442 = 1
inv : p0 + p581 + p582 = 1
inv : p0 + p1011 + p1012 + p1013 + p1014 = 1
inv : p0 + p1087 + p1088 + p1089 + p1090 = 1
inv : p0 + p1315 + p1316 + p1317 + p1318 = 1
inv : p0 + p1353 + p1354 + p1355 + p1356 = 1
inv : p0 + p1277 + p1278 + p1279 + p1280 = 1
inv : p0 + p637 + p638 = 1
inv : p0 + p615 + p616 + p617 + p618 = 1
inv : p0 + p969 + p970 + p971 + p972 = 1
inv : p0 + p779 + p780 + p781 + p782 = 1
inv : p0 + p153 + p154 + p155 + p156 = 1
inv : p0 + p1133 + p1134 + p1135 + p1136 = 1
inv : p0 + p261 + p262 + p263 + p264 = 1
inv : p0 + p507 + p508 + p509 + p510 = 1
inv : p0 + p707 + p708 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p1241 + p1242 + p1243 + p1244 = 1
inv : p0 + p1077 + p1078 + p1079 + p1080 = 1
inv : p0 + p45 + p46 + p47 + p48 = 1
inv : p0 + p567 + p568 = 1
inv : p0 + p723 + p724 + p725 + p726 = 1
inv : p0 + p559 + p560 + p561 + p562 = 1
inv : p0 + p1189 + p1190 + p1191 + p1192 = 1
inv : p0 + p847 + p848 = 1
inv : p0 + p671 + p672 + p673 + p674 = 1
inv : p0 + p777 + p778 = 1
inv : p0 + p1297 + p1298 + p1299 + p1300 = 1
inv : p0 + p1021 + p1022 + p1023 + p1024 = 1
inv : p0 + p451 + p452 + p453 + p454 = 1
inv : p0 + p917 + p918 = 1
inv : p0 + p503 + p504 + p505 + p506 = 1
inv : p0 + p857 + p858 + p859 + p860 = 1
inv : p0 + p287 + p288 = 1
inv : p0 + p1129 + p1130 + p1131 + p1132 = 1
inv : p0 + p619 + p620 + p621 + p622 = 1
inv : p0 + p265 + p266 + p267 + p268 = 1
inv : p0 + p429 + p430 + p431 + p432 = 1
inv : p0 + p373 + p374 + p375 + p376 = 1
inv : p0 + p395 + p396 + p397 + p398 = 1
inv : p0 + p727 + p728 + p729 + p730 = 1
inv : p0 + p205 + p206 + p207 + p208 = 1
inv : p0 + p563 + p564 + p565 + p566 = 1
inv : p0 + p427 + p428 = 1
inv : p0 + p1073 + p1074 + p1075 + p1076 = 1
inv : p0 + p1301 + p1302 + p1303 + p1304 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p835 + p836 + p837 + p838 = 1
inv : p0 + p1025 + p1026 + p1027 + p1028 = 1
inv : p0 + p1263 + p1264 + p1265 + p1266 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p357 + p358 = 1
inv : p0 + p667 + p668 + p669 + p670 = 1
inv : p0 + p965 + p966 + p967 + p968 = 1
inv : p0 + p1193 + p1194 + p1195 + p1196 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p97 + p98 + p99 + p100 = 1
inv : p0 + p157 + p158 + p159 + p160 = 1
inv : p0 + p1003 + p1004 + p1005 + p1006 = 1
inv : p0 + p217 + p218 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p37 + p38 + p39 + p40 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p227 + p228 + p229 + p230 = 1
inv : p0 + p273 + p274 = 1
inv : p0 + p1249 + p1250 + p1251 + p1252 = 1
inv : p0 + p895 + p896 + p897 + p898 = 1
inv : p0 + p335 + p336 + p337 + p338 = 1
inv : p0 + p787 + p788 + p789 + p790 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p413 + p414 = 1
inv : p0 + p1059 + p1060 + p1061 + p1062 = 1
inv : p0 + p633 + p634 + p635 + p636 = 1
inv : p0 + p443 + p444 + p445 + p446 = 1
inv : p0 + p489 + p490 + p491 + p492 = 1
inv : p0 + p1319 + p1320 + p1321 + p1322 = 1
inv : p0 + p1357 + p1358 + p1359 + p1360 = 1
inv : p0 + p115 + p116 + p117 + p118 = 1
inv : p0 + p653 + p654 + p655 + p656 = 1
inv : p0 + p553 + p554 = 1
inv : p0 + p101 + p102 + p103 + p104 = 1
inv : p0 + p381 + p382 + p383 + p384 = 1
inv : p0 + p387 + p388 + p389 + p390 = 1
inv : p0 + p483 + p484 = 1
inv : p0 + p741 + p742 + p743 + p744 = 1
inv : p0 + p1375 + p1376 + p1377 + p1378 = 1
inv : p0 + p1305 + p1306 + p1307 + p1308 = 1
inv : p0 + p849 + p850 + p851 + p852 = 1
inv : p0 + p951 + p952 + p953 + p954 = 1
inv : p0 + p209 + p210 + p211 + p212 = 1
inv : p0 + p1115 + p1116 + p1117 + p1118 = 1
inv : p0 + p1039 + p1040 + p1041 + p1042 = 1
inv : p0 + p913 + p914 + p915 + p916 = 1
inv : p0 + p171 + p172 + p173 + p174 = 1
inv : p0 + p1185 + p1186 + p1187 + p1188 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p545 + p546 + p547 + p548 = 1
inv : p0 + p577 + p578 + p579 + p580 = 1
inv : p0 + p1147 + p1148 + p1149 + p1150 = 1
inv : p0 + p279 + p280 + p281 + p282 = 1
inv : p0 + p317 + p318 + p319 + p320 = 1
inv : p0 + p843 + p844 + p845 + p846 = 1
inv : p0 + p765 + p766 + p767 + p768 = 1
inv : p0 + p1255 + p1256 + p1257 + p1258 = 1
inv : p0 + p903 + p904 = 1
inv : p0 + p371 + p372 = 1
inv : p0 + p1283 + p1284 + p1285 + p1286 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p437 + p438 + p439 + p440 = 1
inv : p0 + p1043 + p1044 = 1
inv : p0 + p3 + p4 + p5 + p6 = 1
inv : p0 + p955 + p956 + p957 + p958 = 1
inv : p0 + p601 + p602 + p603 + p604 = 1
inv : p0 + p521 + p522 + p523 + p524 = 1
inv : p0 + p247 + p248 + p249 + p250 = 1
inv : p0 + p1119 + p1120 + p1121 + p1122 = 1
inv : p0 + p167 + p168 + p169 + p170 = 1
inv : p0 + p685 + p686 + p687 + p688 = 1
inv : p0 + p549 + p550 + p551 + p552 = 1
inv : p0 + p1311 + p1312 + p1313 + p1314 = 1
inv : p0 + p763 + p764 = 1
inv : p0 + p573 + p574 + p575 + p576 = 1
inv : p0 + p1365 + p1366 = 1
inv : p0 + p191 + p192 + p193 + p194 = 1
inv : p0 + p31 + p32 + p33 + p34 = 1
inv : p0 + p1067 + p1068 + p1069 + p1070 = 1
inv : p0 + p359 + p360 + p361 + p362 = 1
inv : p0 + p1091 + p1092 + p1093 + p1094 = 1
inv : p0 + p55 + p56 + p57 + p58 = 1
inv : p0 + p1007 + p1008 + p1009 + p1010 = 1
inv : p0 + p877 + p878 + p879 + p880 = 1
inv : p0 + p623 + p624 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p1095 + p1096 + p1097 + p1098 = 1
inv : p0 + p1390 + p1391 + p1392 = 1
inv : p0 + p1231 + p1232 + p1233 + p1234 = 1
inv : p0 + p27 + p28 + p29 + p30 = 1
inv : p0 + p1333 + p1334 + p1335 + p1336 = 1
inv : p0 + p905 + p906 + p907 + p908 = 1
inv : p0 + p1143 + p1144 + p1145 + p1146 = 1
inv : p0 + p1259 + p1260 + p1261 + p1262 = 1
inv : p0 + p1225 + p1226 = 1
inv : p0 + p1085 + p1086 = 1
inv : p0 + p597 + p598 + p599 + p600 = 1
inv : p0 + p195 + p196 + p197 + p198 = 1
inv : p0 + p331 + p332 + p333 + p334 = 1
inv : p0 + p945 + p946 = 1
inv : p0 + p433 + p434 + p435 + p436 = 1
inv : p0 + p471 + p472 + p473 + p474 = 1
inv : p0 + p661 + p662 + p663 + p664 = 1
inv : p0 + p461 + p462 + p463 + p464 = 1
inv : p0 + p1183 + p1184 = 1
inv : p0 + p737 + p738 + p739 + p740 = 1
inv : p0 + p1171 + p1172 + p1173 + p1174 = 1
inv : p0 + p927 + p928 + p929 + p930 = 1
inv : p0 + p1323 + p1324 = 1
inv : p0 + p1361 + p1362 + p1363 + p1364 = 1
inv : p0 + p805 + p806 = 1
inv : p0 + p1221 + p1222 + p1223 + p1224 = 1
inv : p0 + p1399 + p1400 + p1401 + p1402 = 1
inv : p0 + p1071 + p1072 = 1
inv : p0 + p1207 + p1208 + p1209 + p1210 = 1
inv : p0 + p853 + p854 + p855 + p856 = 1
inv : p0 + p1393 + p1394 = 1
inv : p0 + p499 + p500 + p501 + p502 = 1
inv : p0 + p1371 + p1372 + p1373 + p1374 = 1
inv : p0 + p1017 + p1018 + p1019 + p1020 = 1
inv : p0 + p269 + p270 + p271 + p272 = 1
inv : p0 + p1385 + p1386 + p1387 + p1388 = 1
inv : p0 + p689 + p690 + p691 + p692 = 1
inv : p0 + p1031 + p1032 + p1033 + p1034 = 1
inv : p0 + p931 + p932 = 1
inv : p0 + p1337 + p1338 = 1
inv : p0 + p93 + p94 + p95 + p96 = 1
inv : p0 + p321 + p322 + p323 + p324 = 1
inv : p0 + p1197 + p1198 = 1
inv : p0 + p79 + p80 + p81 + p82 = 1
inv : p0 + p307 + p308 + p309 + p310 = 1
inv : p0 + p611 + p612 + p613 + p614 = 1
inv : p0 + p839 + p840 + p841 + p842 = 1
inv : p0 + p1351 + p1352 = 1
inv : p0 + p1057 + p1058 = 1
inv : p0 + p283 + p284 + p285 + p286 = 1
inv : p0 + p1211 + p1212 = 1
inv : p0 + p801 + p802 + p803 + p804 = 1
inv : p0 + p1245 + p1246 + p1247 + p1248 = 1
inv : p0 + p891 + p892 + p893 + p894 = 1
inv : p0 + p1347 + p1348 + p1349 + p1350 = 1
inv : p0 + p651 + p652 = 1
inv : p0 + p625 + p626 + p627 + p628 = 1
inv : p0 + p979 + p980 + p981 + p982 = 1
inv : p0 + p41 + p42 + p43 + p44 = 1
inv : p0 + p791 + p792 = 1
inv : p0 + p815 + p816 + p817 + p818 = 1
inv : p0 + p1081 + p1082 + p1083 + p1084 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p1157 + p1158 + p1159 + p1160 = 1
inv : p0 + p511 + p512 = 1
inv : p0 + p675 + p676 + p677 + p678 = 1
inv : p0 + p219 + p220 + p221 + p222 = 1
inv : p0 + p181 + p182 + p183 + p184 = 1
inv : p0 + p941 + p942 + p943 + p944 = 1
inv : p0 + p143 + p144 + p145 + p146 = 1
inv : p0 + p713 + p714 + p715 + p716 = 1
inv : p0 + p409 + p410 + p411 + p412 = 1
inv : p0 + p447 + p448 + p449 + p450 = 1
inv : p0 + p485 + p486 + p487 + p488 = 1
Total of 401 invariants.
[2022-06-13 00:42:51] [INFO ] Computed 401 place invariants in 19 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
[2022-06-13 00:42:55] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=2 took 4092 ms
[2022-06-13 00:42:55] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=3 took 264 ms
[2022-06-13 00:42:56] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=4 took 1482 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 2
[2022-06-13 00:42:59] [INFO ] Proved 1402 variables to be positive in 8024 ms
[2022-06-13 00:42:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-100A-ReachabilityFireability-14
[2022-06-13 00:42:59] [INFO ] KInduction solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(SAT) depth K=0 took 440 ms
[2022-06-13 00:43:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-100A-ReachabilityFireability-14
[2022-06-13 00:43:03] [INFO ] KInduction solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(SAT) depth K=1 took 3381 ms
[2022-06-13 00:43:05] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=5 took 9046 ms
Compilation finished in 21379 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8240857659896690923]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT100AReachabilityFireability14==true], workingDir=/tmp/ltsmin8240857659896690923]
[2022-06-13 00:47:05] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=6 took 239578 ms
[2022-06-13 00:49:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-100A-ReachabilityFireability-14
[2022-06-13 00:49:50] [INFO ] KInduction solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(SAT) depth K=2 took 407287 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2 after 7.6313e+06
[2022-06-13 00:57:36] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=7 took 631262 ms
Detected timeout of ITS tools.
[2022-06-13 01:04:49] [INFO ] Applying decomposition
[2022-06-13 01:04:49] [INFO ] Flatten gal took : 329 ms
[2022-06-13 01:04:49] [INFO ] Decomposing Gal with order
[2022-06-13 01:04:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:04:50] [INFO ] Removed a total of 2175 redundant transitions.
[2022-06-13 01:04:50] [INFO ] Flatten gal took : 465 ms
[2022-06-13 01:04:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2538 labels/synchronizations in 343 ms.
[2022-06-13 01:04:51] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4086717352792309085.gal : 119 ms
[2022-06-13 01:04:51] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5621661060423887549.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability4086717352792309085.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability5621661060423887549.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability4086717352792309085.gal -t CGAL -reachable-file /tmp/ReachabilityFireability5621661060423887549.prop --nowitness
Loading property file /tmp/ReachabilityFireability5621661060423887549.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 2
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.048: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.063: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.063: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.149: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.150: Initializing POR dependencies: labels 1903, guards 1902
pins2lts-mc-linux64( 5/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.218: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.231: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 47.524: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 0/ 8), 198.797: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 199.264: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 199.265: There are 1903 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 199.265: State length is 1402, there are 1902 groups
pins2lts-mc-linux64( 0/ 8), 199.265: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 199.265: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 199.265: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 199.265: Visible groups: 135 / 1902, labels: 1 / 1903
pins2lts-mc-linux64( 0/ 8), 199.265: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 199.265: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 199.262: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 199.269: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 199.262: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 199.262: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 199.270: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 199.258: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 199.258: "ShieldRVsPT100AReachabilityFireability14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 199.790: ~11 levels ~960 states ~4088 transitions
pins2lts-mc-linux64( 0/ 8), 199.956: ~12 levels ~1920 states ~8704 transitions
pins2lts-mc-linux64( 0/ 8), 200.412: ~13 levels ~3840 states ~19600 transitions
pins2lts-mc-linux64( 0/ 8), 201.159: ~14 levels ~7680 states ~40656 transitions
pins2lts-mc-linux64( 0/ 8), 203.039: ~15 levels ~15360 states ~88968 transitions
pins2lts-mc-linux64( 0/ 8), 206.772: ~16 levels ~30720 states ~182952 transitions
pins2lts-mc-linux64( 0/ 8), 214.752: ~17 levels ~61440 states ~392792 transitions
pins2lts-mc-linux64( 0/ 8), 230.285: ~18 levels ~122880 states ~812480 transitions
pins2lts-mc-linux64( 0/ 8), 264.745: ~19 levels ~245760 states ~1717504 transitions
pins2lts-mc-linux64( 0/ 8), 333.862: ~20 levels ~491520 states ~3577712 transitions
pins2lts-mc-linux64( 0/ 8), 503.034: ~21 levels ~983040 states ~7505704 transitions
pins2lts-mc-linux64( 0/ 8), 810.844: ~23 levels ~1966080 states ~15656272 transitions
pins2lts-mc-linux64( 0/ 8), 1417.235: ~24 levels ~3932160 states ~32510592 transitions
pins2lts-mc-linux64( 1/ 8), 1536.047: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1536.191:
pins2lts-mc-linux64( 0/ 8), 1536.191: mean standard work distribution: 4.1% (states) 2.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1536.192:
pins2lts-mc-linux64( 0/ 8), 1536.192: Explored 3970367 states 34678315 transitions, fanout: 8.734
pins2lts-mc-linux64( 0/ 8), 1536.192: Total exploration time 1336.910 sec (1336.770 sec minimum, 1336.821 sec on average)
pins2lts-mc-linux64( 0/ 8), 1536.192: States per second: 2970, Transitions per second: 25939
pins2lts-mc-linux64( 0/ 8), 1536.192: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1536.192:
pins2lts-mc-linux64( 0/ 8), 1536.192: Queue width: 8B, total height: 4226902, memory: 32.25MB
pins2lts-mc-linux64( 0/ 8), 1536.192: Tree memory: 318.5MB, 40.7 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1536.192: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1536.192: Stored 1932 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1536.193: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1536.193: Est. total memory use: 350.8MB (~1056.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT100AReachabilityFireability14==true], workingDir=/tmp/ltsmin8240857659896690923]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT100AReachabilityFireability14==true], workingDir=/tmp/ltsmin8240857659896690923]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2 after 6.90828e+08
[2022-06-13 01:13:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-100A-ReachabilityFireability-14
[2022-06-13 01:13:54] [INFO ] KInduction solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(SAT) depth K=3 took 1443332 ms
[2022-06-13 01:15:34] [INFO ] BMC solution for property ShieldRVs-PT-100A-ReachabilityFireability-14(UNSAT) depth K=8 took 1077919 ms
ITS-tools command line returned an error code 137
[2022-06-13 01:20:47] [INFO ] Flatten gal took : 179 ms
[2022-06-13 01:20:49] [INFO ] Input system was already deterministic with 1902 transitions.
[2022-06-13 01:20:49] [INFO ] Transformed 1402 places.
[2022-06-13 01:20:49] [INFO ] Transformed 1902 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-13 01:20:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3585180054194351409.gal : 12 ms
[2022-06-13 01:20:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8539734549555163845.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability3585180054194351409.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability8539734549555163845.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability3585180054194351409.gal -t CGAL -reachable-file /tmp/ReachabilityFireability8539734549555163845.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability8539734549555163845.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 60
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :60 after 145
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :145 after 299
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :299 after 725
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :725 after 1797
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1797 after 8745
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8745 after 106704
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :106704 after 403758
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :403758 after 1.39587e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.39587e+06 after 6.55487e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.55487e+06 after 4.12412e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.12412e+07 after 7.66797e+08
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :7.66797e+08 after 4.22847e+09
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :4.22847e+09 after 4.62196e+10
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :4.62196e+10 after 3.06993e+11
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :3.06993e+11 after 6.89195e+12
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :6.89195e+12 after 5.25031e+13

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldRVs-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ShieldRVs-PT-100A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037500327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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