About the Execution of 2021-gold for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 798.867 | 420943.00 | 462359.00 | 1631.00 | TFTFFTFTFFTFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r046-smll-165252115900198.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 DES-PT-50b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900198
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 15:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 15:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 127K May 10 09:33 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 DES-PT-50b-ReachabilityFireability-00
FORMULA_NAME DES-PT-50b-ReachabilityFireability-01
FORMULA_NAME DES-PT-50b-ReachabilityFireability-02
FORMULA_NAME DES-PT-50b-ReachabilityFireability-03
FORMULA_NAME DES-PT-50b-ReachabilityFireability-04
FORMULA_NAME DES-PT-50b-ReachabilityFireability-05
FORMULA_NAME DES-PT-50b-ReachabilityFireability-06
FORMULA_NAME DES-PT-50b-ReachabilityFireability-07
FORMULA_NAME DES-PT-50b-ReachabilityFireability-08
FORMULA_NAME DES-PT-50b-ReachabilityFireability-09
FORMULA_NAME DES-PT-50b-ReachabilityFireability-10
FORMULA_NAME DES-PT-50b-ReachabilityFireability-11
FORMULA_NAME DES-PT-50b-ReachabilityFireability-12
FORMULA_NAME DES-PT-50b-ReachabilityFireability-13
FORMULA_NAME DES-PT-50b-ReachabilityFireability-14
FORMULA_NAME DES-PT-50b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655075345669
Running Version 0
[2022-06-12 23:09:08] [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-12 23:09:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:09:08] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2022-06-12 23:09:08] [INFO ] Transformed 479 places.
[2022-06-12 23:09:08] [INFO ] Transformed 430 transitions.
[2022-06-12 23:09:08] [INFO ] Found NUPN structural information;
[2022-06-12 23:09:08] [INFO ] Parsed PT model containing 479 places and 430 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 15) seen :5
FORMULA DES-PT-50b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :1
FORMULA DES-PT-50b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 430 rows 479 cols
[2022-06-12 23:09:09] [INFO ] Computed 65 place invariants in 64 ms
[2022-06-12 23:09:09] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-12 23:09:09] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2022-06-12 23:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:10] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-06-12 23:09:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 53 ms returned sat
[2022-06-12 23:09:10] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 53 ms returned sat
[2022-06-12 23:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:11] [INFO ] [Nat]Absence check using state equation in 1036 ms returned sat
[2022-06-12 23:09:12] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 5 ms to minimize.
[2022-06-12 23:09:12] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 2 ms to minimize.
[2022-06-12 23:09:12] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2022-06-12 23:09:13] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 1 ms to minimize.
[2022-06-12 23:09:14] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 1 ms to minimize.
[2022-06-12 23:09:14] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 1 ms to minimize.
[2022-06-12 23:09:14] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 1 ms to minimize.
[2022-06-12 23:09:14] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2022-06-12 23:09:15] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2022-06-12 23:09:15] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2022-06-12 23:09:15] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2022-06-12 23:09:15] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 0 ms to minimize.
[2022-06-12 23:09:15] [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-12 23:09:15] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2022-06-12 23:09:15] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 57 ms returned sat
[2022-06-12 23:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:16] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2022-06-12 23:09:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2022-06-12 23:09:16] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 40 ms returned sat
[2022-06-12 23:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:17] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2022-06-12 23:09:17] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2022-06-12 23:09:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2022-06-12 23:09:17] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 49 ms.
[2022-06-12 23:09:21] [INFO ] Added : 190 causal constraints over 38 iterations in 3733 ms. Result :unknown
[2022-06-12 23:09:21] [INFO ] [Real]Absence check using 40 positive place invariants in 25 ms returned sat
[2022-06-12 23:09:21] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 22 ms returned unsat
[2022-06-12 23:09:21] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2022-06-12 23:09:21] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 33 ms returned sat
[2022-06-12 23:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:22] [INFO ] [Real]Absence check using state equation in 924 ms returned sat
[2022-06-12 23:09:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-06-12 23:09:22] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 27 ms returned sat
[2022-06-12 23:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:23] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2022-06-12 23:09:23] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2022-06-12 23:09:23] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2022-06-12 23:09:23] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2022-06-12 23:09:24] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2022-06-12 23:09:24] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2022-06-12 23:09:24] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2022-06-12 23:09:24] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 1 ms to minimize.
[2022-06-12 23:09:24] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2022-06-12 23:09:24] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2022-06-12 23:09:25] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 0 ms to minimize.
[2022-06-12 23:09:25] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 0 ms to minimize.
[2022-06-12 23:09:25] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 1 ms to minimize.
[2022-06-12 23:09:25] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 1 ms to minimize.
[2022-06-12 23:09:25] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2022-06-12 23:09:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2553 ms
[2022-06-12 23:09:25] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 35 ms.
[2022-06-12 23:09:27] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 1 ms to minimize.
[2022-06-12 23:09:27] [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-12 23:09:28] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2022-06-12 23:09:28] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 53 ms returned sat
[2022-06-12 23:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:31] [INFO ] [Real]Absence check using state equation in 3622 ms returned sat
[2022-06-12 23:09:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 26 ms returned sat
[2022-06-12 23:09:32] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 144 ms returned sat
[2022-06-12 23:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:34] [INFO ] [Nat]Absence check using state equation in 2273 ms returned sat
[2022-06-12 23:09:34] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 38 ms.
[2022-06-12 23:09:37] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 1 ms to minimize.
[2022-06-12 23:09:37] [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-12 23:09:37] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-06-12 23:09:37] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 27 ms returned sat
[2022-06-12 23:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:37] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-06-12 23:09:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2022-06-12 23:09:37] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 34 ms returned sat
[2022-06-12 23:09:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:37] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2022-06-12 23:09:38] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2022-06-12 23:09:38] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2022-06-12 23:09:38] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2022-06-12 23:09:38] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 1 ms to minimize.
[2022-06-12 23:09:39] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-06-12 23:09:39] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 10 ms to minimize.
[2022-06-12 23:09:39] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2022-06-12 23:09:40] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 1 ms to minimize.
[2022-06-12 23:09:40] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 0 ms to minimize.
[2022-06-12 23:09:40] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2022-06-12 23:09:40] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2022-06-12 23:09:41] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 0 ms to minimize.
[2022-06-12 23:09:42] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2022-06-12 23:09:42] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2022-06-12 23:09:42] [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-12 23:09:42] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2022-06-12 23:09:42] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 27 ms returned sat
[2022-06-12 23:09:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:42] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-06-12 23:09:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-06-12 23:09:43] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 32 ms returned sat
[2022-06-12 23:09:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:43] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2022-06-12 23:09:43] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 1 ms to minimize.
[2022-06-12 23:09:43] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 1 ms to minimize.
[2022-06-12 23:09:44] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2022-06-12 23:09:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 653 ms
[2022-06-12 23:09:44] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 49 ms.
[2022-06-12 23:09:47] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2022-06-12 23:09:47] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2022-06-12 23:09:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2022-06-12 23:09:47] [INFO ] Added : 298 causal constraints over 60 iterations in 3680 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 23:09:47] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2022-06-12 23:09:47] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 31 ms returned sat
[2022-06-12 23:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:48] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2022-06-12 23:09:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 25 ms returned sat
[2022-06-12 23:09:48] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 30 ms returned sat
[2022-06-12 23:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:49] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-06-12 23:09:49] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2022-06-12 23:09:49] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2022-06-12 23:09:49] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-06-12 23:09:49] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2022-06-12 23:09:49] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-06-12 23:09:49] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-06-12 23:09:50] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2022-06-12 23:09:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 878 ms
[2022-06-12 23:09:50] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 41 ms.
[2022-06-12 23:09:53] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2022-06-12 23:09:53] [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 7
[2022-06-12 23:09:53] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-06-12 23:09:53] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 43 ms returned sat
[2022-06-12 23:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:54] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2022-06-12 23:09:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:09:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-06-12 23:09:54] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 136 ms returned sat
[2022-06-12 23:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:09:56] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2022-06-12 23:09:56] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2022-06-12 23:09:56] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2022-06-12 23:09:56] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2022-06-12 23:09:57] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 1 ms to minimize.
[2022-06-12 23:09:57] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 1 ms to minimize.
[2022-06-12 23:09:57] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2022-06-12 23:09:57] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2022-06-12 23:09:58] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 1 ms to minimize.
[2022-06-12 23:09:58] [INFO ] Deduced a trap composed of 20 places in 286 ms of which 3 ms to minimize.
[2022-06-12 23:09:58] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2022-06-12 23:09:59] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 4 ms to minimize.
[2022-06-12 23:09:59] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 1 ms to minimize.
[2022-06-12 23:09:59] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2022-06-12 23:09:59] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2022-06-12 23:09: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
FORMULA DES-PT-50b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 357600 steps, including 3981 resets, run finished after 1226 ms. (steps per millisecond=291 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 366100 steps, including 3891 resets, run finished after 1274 ms. (steps per millisecond=287 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 93 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 468 transition count 413
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 458 transition count 410
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 455 transition count 410
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 29 place count 455 transition count 399
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 444 transition count 399
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 66 place count 429 transition count 384
Iterating global reduction 3 with 15 rules applied. Total rules applied 81 place count 429 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 429 transition count 383
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 428 transition count 383
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 90 place count 421 transition count 376
Iterating global reduction 3 with 7 rules applied. Total rules applied 97 place count 421 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 105 place count 421 transition count 368
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 108 place count 419 transition count 367
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 180 place count 383 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 182 place count 382 transition count 332
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 186 place count 382 transition count 328
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 190 place count 378 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 378 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 192 place count 377 transition count 327
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 377 transition count 327
Applied a total of 193 rules in 299 ms. Remains 377 /479 variables (removed 102) and now considering 327/430 (removed 103) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/479 places, 327/430 transitions.
[2022-06-12 23:10:03] [INFO ] Flatten gal took : 110 ms
[2022-06-12 23:10:03] [INFO ] Flatten gal took : 51 ms
[2022-06-12 23:10:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10871444654893706671.gal : 25 ms
[2022-06-12 23:10:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1316693651868612175.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/ReachabilityCardinality10871444654893706671.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1316693651868612175.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/ReachabilityCardinality10871444654893706671.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1316693651868612175.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1316693651868612175.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 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :14 after 60
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :60 after 82
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :82 after 224
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :224 after 1094
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1094 after 5086
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :5086 after 9774
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :9774 after 236522
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :236522 after 1.29279e+06
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.29279e+06 after 1.29955e+07
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.29955e+07 after 1.62526e+07
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :1.62526e+07 after 1.97539e+08
Detected timeout of ITS tools.
[2022-06-12 23:10:18] [INFO ] Flatten gal took : 39 ms
[2022-06-12 23:10:18] [INFO ] Applying decomposition
[2022-06-12 23:10:18] [INFO ] Flatten gal took : 42 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/graph5476391043396460409.txt, -o, /tmp/graph5476391043396460409.bin, -w, /tmp/graph5476391043396460409.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/graph5476391043396460409.bin, -l, -1, -v, -w, /tmp/graph5476391043396460409.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:10:18] [INFO ] Decomposing Gal with order
[2022-06-12 23:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:10:18] [INFO ] Removed a total of 28 redundant transitions.
[2022-06-12 23:10:18] [INFO ] Flatten gal took : 94 ms
[2022-06-12 23:10:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 13 ms.
[2022-06-12 23:10:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality542673150256460805.gal : 12 ms
[2022-06-12 23:10:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9939205124955880431.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/ReachabilityCardinality542673150256460805.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9939205124955880431.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/ReachabilityCardinality542673150256460805.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9939205124955880431.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9939205124955880431.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 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 102
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :102 after 902
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :902 after 11234
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :11234 after 1.30041e+08
Reachability property DES-PT-50b-ReachabilityFireability-07 is true.
FORMULA DES-PT-50b-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :3.27466e+12 after 3.31911e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6670727083149616540
[2022-06-12 23:10:33] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6670727083149616540
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/ltsmin6670727083149616540]
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/ltsmin6670727083149616540] 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/ltsmin6670727083149616540] 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 11647 resets, run finished after 3106 ms. (steps per millisecond=321 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1856 resets, run finished after 2574 ms. (steps per millisecond=388 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1855 resets, run finished after 2117 ms. (steps per millisecond=472 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1819 resets, run finished after 2184 ms. (steps per millisecond=457 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1886 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2155 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1876 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1889 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 10933173 steps, run timeout after 30001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 10933173 steps, saw 1367984 distinct states, run finished after 30006 ms. (steps per millisecond=364 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 327 rows 377 cols
[2022-06-12 23:11:20] [INFO ] Computed 61 place invariants in 13 ms
[2022-06-12 23:11:20] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-12 23:11:20] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 28 ms returned sat
[2022-06-12 23:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:20] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-06-12 23:11:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:11:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-06-12 23:11:20] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 233 ms returned sat
[2022-06-12 23:11:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:21] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2022-06-12 23:11:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 23:11:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2022-06-12 23:11:21] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2022-06-12 23:11:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2022-06-12 23:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2022-06-12 23:11:21] [INFO ] Computed and/alt/rep : 321/850/321 causal constraints (skipped 5 transitions) in 31 ms.
[2022-06-12 23:11:23] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2022-06-12 23:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-06-12 23:11:23] [INFO ] Added : 193 causal constraints over 39 iterations in 1777 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 23:11:23] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-12 23:11:23] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2022-06-12 23:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:24] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2022-06-12 23:11:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:11:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-06-12 23:11:24] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 183 ms returned sat
[2022-06-12 23:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:25] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2022-06-12 23:11:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-06-12 23:11:25] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-06-12 23:11:25] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-06-12 23:11:26] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-06-12 23:11:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2022-06-12 23:11:26] [INFO ] Computed and/alt/rep : 321/850/321 causal constraints (skipped 5 transitions) in 24 ms.
[2022-06-12 23:11:27] [INFO ] Added : 180 causal constraints over 36 iterations in 1740 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-12 23:11:27] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-12 23:11:27] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 26 ms returned sat
[2022-06-12 23:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:28] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-06-12 23:11:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:11:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-12 23:11:28] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 181 ms returned sat
[2022-06-12 23:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:28] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-12 23:11:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-06-12 23:11:28] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-06-12 23:11:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2022-06-12 23:11:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2022-06-12 23:11:29] [INFO ] Computed and/alt/rep : 321/850/321 causal constraints (skipped 5 transitions) in 23 ms.
[2022-06-12 23:11:30] [INFO ] Added : 234 causal constraints over 47 iterations in 1862 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 23:11:31] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-06-12 23:11:31] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 23 ms returned sat
[2022-06-12 23:11:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:31] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-06-12 23:11:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:11:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-12 23:11:31] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 162 ms returned sat
[2022-06-12 23:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:31] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2022-06-12 23:11:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-12 23:11:32] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2022-06-12 23:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-06-12 23:11:32] [INFO ] Computed and/alt/rep : 321/850/321 causal constraints (skipped 5 transitions) in 20 ms.
[2022-06-12 23:11:33] [INFO ] Added : 234 causal constraints over 47 iterations in 1701 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 23:11:33] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-06-12 23:11:33] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 22 ms returned sat
[2022-06-12 23:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:34] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-06-12 23:11:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:11:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-06-12 23:11:34] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 104 ms returned sat
[2022-06-12 23:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:34] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2022-06-12 23:11:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 23:11:34] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2022-06-12 23:11:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-06-12 23:11:35] [INFO ] Computed and/alt/rep : 321/850/321 causal constraints (skipped 5 transitions) in 22 ms.
[2022-06-12 23:11:36] [INFO ] Added : 235 causal constraints over 47 iterations in 1861 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 23:11:36] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-06-12 23:11:36] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 22 ms returned sat
[2022-06-12 23:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:37] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-06-12 23:11:37] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 23:11:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:11:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-12 23:11:37] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 231 ms returned sat
[2022-06-12 23:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:38] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2022-06-12 23:11:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2022-06-12 23:11:38] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2022-06-12 23:11:38] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2022-06-12 23:11:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2022-06-12 23:11:38] [INFO ] Computed and/alt/rep : 321/850/321 causal constraints (skipped 5 transitions) in 19 ms.
[2022-06-12 23:11:40] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 0 ms to minimize.
[2022-06-12 23:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-12 23:11:40] [INFO ] Added : 241 causal constraints over 49 iterations in 2042 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 23:11:40] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-12 23:11:40] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 24 ms returned sat
[2022-06-12 23:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:41] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-06-12 23:11:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:11:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-12 23:11:41] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 282 ms returned sat
[2022-06-12 23:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:11:43] [INFO ] [Nat]Absence check using state equation in 1755 ms returned sat
[2022-06-12 23:11:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2022-06-12 23:11:43] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:11:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-06-12 23:11:43] [INFO ] Computed and/alt/rep : 321/850/321 causal constraints (skipped 5 transitions) in 25 ms.
[2022-06-12 23:11:46] [INFO ] Added : 273 causal constraints over 57 iterations in 2709 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 208700 steps, including 2702 resets, run finished after 759 ms. (steps per millisecond=274 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 210100 steps, including 2885 resets, run finished after 690 ms. (steps per millisecond=304 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 367000 steps, including 5246 resets, run finished after 1201 ms. (steps per millisecond=305 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 223500 steps, including 3082 resets, run finished after 739 ms. (steps per millisecond=302 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 310600 steps, including 4378 resets, run finished after 1025 ms. (steps per millisecond=303 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 261300 steps, including 3461 resets, run finished after 872 ms. (steps per millisecond=299 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 307300 steps, including 4403 resets, run finished after 1004 ms. (steps per millisecond=306 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 84 out of 377 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 377/377 places, 327/327 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 371 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 371 transition count 320
Applied a total of 13 rules in 57 ms. Remains 371 /377 variables (removed 6) and now considering 320/327 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 371/377 places, 320/327 transitions.
[2022-06-12 23:11:52] [INFO ] Flatten gal took : 34 ms
[2022-06-12 23:11:52] [INFO ] Flatten gal took : 32 ms
[2022-06-12 23:11:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16210274734470271276.gal : 3 ms
[2022-06-12 23:11:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11504525011587439367.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/ReachabilityCardinality16210274734470271276.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11504525011587439367.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/ReachabilityCardinality16210274734470271276.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11504525011587439367.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11504525011587439367.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :12 after 14
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :14 after 161
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :161 after 366
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :366 after 1094
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1094 after 4130
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :4130 after 103682
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :103682 after 1.40719e+06
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1.40719e+06 after 1.04755e+07
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1.04755e+07 after 1.00987e+08
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :1.00987e+08 after 2.23597e+08
Detected timeout of ITS tools.
[2022-06-12 23:12:07] [INFO ] Flatten gal took : 31 ms
[2022-06-12 23:12:07] [INFO ] Applying decomposition
[2022-06-12 23:12:07] [INFO ] Flatten gal took : 31 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/graph12360305366502686318.txt, -o, /tmp/graph12360305366502686318.bin, -w, /tmp/graph12360305366502686318.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/graph12360305366502686318.bin, -l, -1, -v, -w, /tmp/graph12360305366502686318.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:12:07] [INFO ] Decomposing Gal with order
[2022-06-12 23:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:12:07] [INFO ] Removed a total of 27 redundant transitions.
[2022-06-12 23:12:07] [INFO ] Flatten gal took : 49 ms
[2022-06-12 23:12:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 8 ms.
[2022-06-12 23:12:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7361336750108322286.gal : 6 ms
[2022-06-12 23:12:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11800347770880463885.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/ReachabilityCardinality7361336750108322286.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11800347770880463885.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/ReachabilityCardinality7361336750108322286.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11800347770880463885.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11800347770880463885.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 294
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :294 after 7270
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :7270 after 4.06191e+06
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :2.8701e+08 after 2.87063e+08
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2.87063e+08 after 1.36516e+14
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1892797001448615245
[2022-06-12 23:12:22] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1892797001448615245
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/ltsmin1892797001448615245]
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/ltsmin1892797001448615245] 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/ltsmin1892797001448615245] 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 12191 resets, run finished after 3021 ms. (steps per millisecond=331 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1975 resets, run finished after 2560 ms. (steps per millisecond=390 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1958 resets, run finished after 2100 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1929 resets, run finished after 2186 ms. (steps per millisecond=457 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1991 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2286 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2006 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1997 resets, run finished after 2121 ms. (steps per millisecond=471 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 11138723 steps, run timeout after 30001 ms. (steps per millisecond=371 ) properties seen :{}
Probabilistic random walk after 11138723 steps, saw 1431135 distinct states, run finished after 30001 ms. (steps per millisecond=371 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 320 rows 371 cols
[2022-06-12 23:13:08] [INFO ] Computed 61 place invariants in 5 ms
[2022-06-12 23:13:08] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2022-06-12 23:13:09] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2022-06-12 23:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:09] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2022-06-12 23:13:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2022-06-12 23:13:09] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 66 ms returned sat
[2022-06-12 23:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:10] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-06-12 23:13:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-12 23:13:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-06-12 23:13:10] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2022-06-12 23:13:10] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 14 ms to minimize.
[2022-06-12 23:13:10] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2022-06-12 23:13:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 559 ms
[2022-06-12 23:13:10] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 35 ms.
[2022-06-12 23:13:14] [INFO ] Added : 249 causal constraints over 50 iterations in 3448 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 23:13:14] [INFO ] [Real]Absence check using 37 positive place invariants in 26 ms returned sat
[2022-06-12 23:13:14] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2022-06-12 23:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:14] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2022-06-12 23:13:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2022-06-12 23:13:15] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 116 ms returned sat
[2022-06-12 23:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:15] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2022-06-12 23:13:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-06-12 23:13:15] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 29 ms.
[2022-06-12 23:13:17] [INFO ] Added : 174 causal constraints over 35 iterations in 2016 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 23:13:17] [INFO ] [Real]Absence check using 37 positive place invariants in 28 ms returned sat
[2022-06-12 23:13:17] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 35 ms returned sat
[2022-06-12 23:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:18] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-06-12 23:13:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2022-06-12 23:13:18] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 85 ms returned sat
[2022-06-12 23:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:19] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2022-06-12 23:13:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-06-12 23:13:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-06-12 23:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2022-06-12 23:13:19] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 18 ms.
[2022-06-12 23:13:22] [INFO ] Added : 242 causal constraints over 49 iterations in 3345 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-12 23:13:22] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2022-06-12 23:13:22] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2022-06-12 23:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:23] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-06-12 23:13:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 21 ms returned sat
[2022-06-12 23:13:23] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 122 ms returned sat
[2022-06-12 23:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:24] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2022-06-12 23:13:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 23:13:24] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2022-06-12 23:13:24] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:13:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2022-06-12 23:13:24] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 22 ms.
[2022-06-12 23:13:26] [INFO ] Added : 218 causal constraints over 44 iterations in 2180 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 23:13:26] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2022-06-12 23:13:26] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2022-06-12 23:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:26] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-06-12 23:13:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 23 ms returned sat
[2022-06-12 23:13:27] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 83 ms returned sat
[2022-06-12 23:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:27] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2022-06-12 23:13:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-06-12 23:13:27] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2022-06-12 23:13:27] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2022-06-12 23:13:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2022-06-12 23:13:27] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 21 ms.
[2022-06-12 23:13:30] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 1 ms to minimize.
[2022-06-12 23:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2022-06-12 23:13:30] [INFO ] Added : 232 causal constraints over 47 iterations in 2514 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 23:13:30] [INFO ] [Real]Absence check using 37 positive place invariants in 24 ms returned sat
[2022-06-12 23:13:30] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2022-06-12 23:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:30] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-06-12 23:13:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 24 ms returned sat
[2022-06-12 23:13:31] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 105 ms returned sat
[2022-06-12 23:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:31] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2022-06-12 23:13:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-06-12 23:13:31] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2022-06-12 23:13:31] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:13:31] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:13:31] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-06-12 23:13:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 344 ms
[2022-06-12 23:13:31] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 19 ms.
[2022-06-12 23:13:33] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 1 ms to minimize.
[2022-06-12 23:13:33] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 1 ms to minimize.
[2022-06-12 23:13:33] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2022-06-12 23:13:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 494 ms
[2022-06-12 23:13:33] [INFO ] Added : 229 causal constraints over 46 iterations in 2008 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 23:13:34] [INFO ] [Real]Absence check using 37 positive place invariants in 24 ms returned sat
[2022-06-12 23:13:34] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2022-06-12 23:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:34] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2022-06-12 23:13:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:13:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 24 ms returned sat
[2022-06-12 23:13:34] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 156 ms returned sat
[2022-06-12 23:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:13:35] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2022-06-12 23:13:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-06-12 23:13:35] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2022-06-12 23:13:35] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-06-12 23:13:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2022-06-12 23:13:35] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 23 ms.
[2022-06-12 23:13:38] [INFO ] Added : 230 causal constraints over 46 iterations in 2306 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 282300 steps, including 3999 resets, run finished after 1454 ms. (steps per millisecond=194 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 203300 steps, including 3044 resets, run finished after 722 ms. (steps per millisecond=281 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 263200 steps, including 3882 resets, run finished after 901 ms. (steps per millisecond=292 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 224400 steps, including 3222 resets, run finished after 673 ms. (steps per millisecond=333 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 315600 steps, including 4509 resets, run finished after 955 ms. (steps per millisecond=330 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 237800 steps, including 3353 resets, run finished after 724 ms. (steps per millisecond=328 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 326100 steps, including 4790 resets, run finished after 978 ms. (steps per millisecond=333 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 84 out of 371 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 371/371 places, 320/320 transitions.
Applied a total of 0 rules in 13 ms. Remains 371 /371 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 371/371 places, 320/320 transitions.
Starting structural reductions, iteration 0 : 371/371 places, 320/320 transitions.
Applied a total of 0 rules in 14 ms. Remains 371 /371 variables (removed 0) and now considering 320/320 (removed 0) transitions.
// Phase 1: matrix 320 rows 371 cols
[2022-06-12 23:13:44] [INFO ] Computed 61 place invariants in 3 ms
[2022-06-12 23:13:44] [INFO ] Implicit Places using invariants in 227 ms returned [223]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
[2022-06-12 23:13:44] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 320 rows 370 cols
[2022-06-12 23:13:44] [INFO ] Computed 60 place invariants in 4 ms
[2022-06-12 23:13:45] [INFO ] Dead Transitions using invariants and state equation in 232 ms returned []
Starting structural reductions, iteration 1 : 370/371 places, 320/320 transitions.
Applied a total of 0 rules in 23 ms. Remains 370 /370 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2022-06-12 23:13:45] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 320 rows 370 cols
[2022-06-12 23:13:45] [INFO ] Computed 60 place invariants in 15 ms
[2022-06-12 23:13:45] [INFO ] Dead Transitions using invariants and state equation in 498 ms returned []
Finished structural reductions, in 2 iterations. Remains : 370/371 places, 320/320 transitions.
[2022-06-12 23:13:45] [INFO ] Flatten gal took : 37 ms
[2022-06-12 23:13:45] [INFO ] Flatten gal took : 33 ms
[2022-06-12 23:13:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4620846303251009552.gal : 3 ms
[2022-06-12 23:13:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13967686225517293187.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/ReachabilityCardinality4620846303251009552.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13967686225517293187.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/ReachabilityCardinality4620846303251009552.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13967686225517293187.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13967686225517293187.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :12 after 14
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :14 after 158
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :158 after 342
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :342 after 1094
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1094 after 4144
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :4144 after 79202
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :79202 after 986930
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :986930 after 1.05359e+07
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1.05359e+07 after 1.0194e+08
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :1.0194e+08 after 2.24667e+08
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :1.14702e+10 after 4.39133e+11
Detected timeout of ITS tools.
[2022-06-12 23:14:00] [INFO ] Flatten gal took : 18 ms
[2022-06-12 23:14:00] [INFO ] Applying decomposition
[2022-06-12 23:14:00] [INFO ] Flatten gal took : 18 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/graph16053419272345823072.txt, -o, /tmp/graph16053419272345823072.bin, -w, /tmp/graph16053419272345823072.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/graph16053419272345823072.bin, -l, -1, -v, -w, /tmp/graph16053419272345823072.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:14:00] [INFO ] Decomposing Gal with order
[2022-06-12 23:14:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:14:00] [INFO ] Removed a total of 25 redundant transitions.
[2022-06-12 23:14:00] [INFO ] Flatten gal took : 31 ms
[2022-06-12 23:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2022-06-12 23:14:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13467519435322642783.gal : 4 ms
[2022-06-12 23:14:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8721852792474914891.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/ReachabilityCardinality13467519435322642783.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8721852792474914891.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/ReachabilityCardinality13467519435322642783.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8721852792474914891.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8721852792474914891.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 30
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :30 after 878
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :878 after 10370
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :51842 after 3.46104e+08
Invariant property DES-PT-50b-ReachabilityFireability-01 does not hold.
FORMULA DES-PT-50b-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :3.46104e+08 after 1.01615e+13
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.01615e+13 after 1.47918e+13
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.47918e+13 after 2.26804e+13
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.26804e+13 after 3.30012e+13
Invariant property DES-PT-50b-ReachabilityFireability-08 does not hold.
FORMULA DES-PT-50b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-50b-ReachabilityFireability-03 does not hold.
FORMULA DES-PT-50b-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.30012e+13 after 5.46248e+13
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11008177861211642772
[2022-06-12 23:14:15] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11008177861211642772
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/ltsmin11008177861211642772]
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/ltsmin11008177861211642772] 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/ltsmin11008177861211642772] 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 12164 resets, run finished after 2027 ms. (steps per millisecond=493 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1993 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2298 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1992 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2007 resets, run finished after 2021 ms. (steps per millisecond=494 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 12294596 steps, run timeout after 30001 ms. (steps per millisecond=409 ) properties seen :{}
Probabilistic random walk after 12294596 steps, saw 1594125 distinct states, run finished after 30001 ms. (steps per millisecond=409 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 320 rows 370 cols
[2022-06-12 23:14:53] [INFO ] Computed 60 place invariants in 4 ms
[2022-06-12 23:14:53] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-06-12 23:14:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-06-12 23:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:53] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-06-12 23:14:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-06-12 23:14:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 210 ms returned sat
[2022-06-12 23:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:54] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2022-06-12 23:14:54] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2022-06-12 23:14:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-06-12 23:14:55] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 21 ms.
[2022-06-12 23:14:56] [INFO ] Added : 222 causal constraints over 45 iterations in 1656 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 23:14:56] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-06-12 23:14:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-06-12 23:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:57] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-06-12 23:14:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-06-12 23:14:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 108 ms returned sat
[2022-06-12 23:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:57] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2022-06-12 23:14:57] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2022-06-12 23:14:57] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2022-06-12 23:14:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2022-06-12 23:14:57] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 22 ms.
[2022-06-12 23:14:59] [INFO ] Added : 230 causal constraints over 46 iterations in 1789 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 23:14:59] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-06-12 23:14:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2022-06-12 23:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:14:59] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-06-12 23:14:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:14:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-06-12 23:15:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 209 ms returned sat
[2022-06-12 23:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:02] [INFO ] [Nat]Absence check using state equation in 2369 ms returned sat
[2022-06-12 23:15:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2022-06-12 23:15:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:15:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2022-06-12 23:15:02] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 22 ms.
[2022-06-12 23:15:04] [INFO ] Added : 235 causal constraints over 47 iterations in 2379 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 23:15:05] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-06-12 23:15:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2022-06-12 23:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:05] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-06-12 23:15:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:15:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-06-12 23:15:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 363 ms returned sat
[2022-06-12 23:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:15:07] [INFO ] [Nat]Absence check using state equation in 1755 ms returned sat
[2022-06-12 23:15:07] [INFO ] Computed and/alt/rep : 314/839/314 causal constraints (skipped 5 transitions) in 21 ms.
[2022-06-12 23:15:10] [INFO ] Added : 231 causal constraints over 47 iterations in 3024 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 222000 steps, including 3188 resets, run finished after 795 ms. (steps per millisecond=279 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 310400 steps, including 4695 resets, run finished after 652 ms. (steps per millisecond=476 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 235000 steps, including 3305 resets, run finished after 500 ms. (steps per millisecond=470 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 306700 steps, including 4441 resets, run finished after 861 ms. (steps per millisecond=356 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 25 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 320/320 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 370 transition count 318
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 368 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 368 transition count 317
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 367 transition count 317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 365 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 365 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 365 transition count 314
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 61 place count 340 transition count 289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 338 transition count 285
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 338 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 338 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 338 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 337 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 336 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 335 transition count 281
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 335 transition count 278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 79 place count 332 transition count 278
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 332 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 331 transition count 277
Applied a total of 81 rules in 116 ms. Remains 331 /370 variables (removed 39) and now considering 277/320 (removed 43) transitions.
Finished structural reductions, in 1 iterations. Remains : 331/370 places, 277/320 transitions.
[2022-06-12 23:15:13] [INFO ] Flatten gal took : 16 ms
[2022-06-12 23:15:13] [INFO ] Flatten gal took : 16 ms
[2022-06-12 23:15:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5159160011004176013.gal : 2 ms
[2022-06-12 23:15:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6709013765525924596.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/ReachabilityCardinality5159160011004176013.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6709013765525924596.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/ReachabilityCardinality5159160011004176013.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6709013765525924596.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6709013765525924596.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 44
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :44 after 114
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :114 after 248
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :248 after 27942
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :27942 after 46457
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :46457 after 1.41747e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.41747e+06 after 1.60187e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.60187e+06 after 1.27932e+07
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :8.97516e+09 after 9.37815e+09
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :9.37815e+09 after 1.27299e+10
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.27829e+11 after 1.32885e+11
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :6.00478e+11 after 6.18055e+11
Detected timeout of ITS tools.
[2022-06-12 23:15:33] [INFO ] Flatten gal took : 14 ms
[2022-06-12 23:15:33] [INFO ] Applying decomposition
[2022-06-12 23:15:33] [INFO ] Flatten gal took : 14 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/graph5431320610967969431.txt, -o, /tmp/graph5431320610967969431.bin, -w, /tmp/graph5431320610967969431.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/graph5431320610967969431.bin, -l, -1, -v, -w, /tmp/graph5431320610967969431.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:15:33] [INFO ] Decomposing Gal with order
[2022-06-12 23:15:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:15:33] [INFO ] Removed a total of 28 redundant transitions.
[2022-06-12 23:15:33] [INFO ] Flatten gal took : 28 ms
[2022-06-12 23:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 3 ms.
[2022-06-12 23:15:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4635437942782118403.gal : 3 ms
[2022-06-12 23:15:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality636228780390144938.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/ReachabilityCardinality4635437942782118403.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality636228780390144938.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/ReachabilityCardinality4635437942782118403.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality636228780390144938.prop --nowitness
Loading property file /tmp/ReachabilityCardinality636228780390144938.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 21
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :21 after 1071
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3657 after 536179
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :536179 after 2.80815e+09
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.80815e+09 after 6.62603e+09
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6.62603e+09 after 1.1967e+10
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.1967e+10 after 2.03663e+10
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.03663e+10 after 4.07017e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15840312801792168145
[2022-06-12 23:15:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15840312801792168145
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/ltsmin15840312801792168145]
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/ltsmin15840312801792168145] killed by timeout after 2 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/ltsmin15840312801792168145] killed by timeout after 2 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 19008 resets, run finished after 2327 ms. (steps per millisecond=429 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3287 resets, run finished after 1190 ms. (steps per millisecond=840 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4893 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3299 resets, run finished after 877 ms. (steps per millisecond=1140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3213 resets, run finished after 1966 ms. (steps per millisecond=508 ) properties (out of 4) seen :0
Finished probabilistic random walk after 602313 steps, run visited all 4 properties in 1709 ms. (steps per millisecond=352 )
Probabilistic random walk after 602313 steps, saw 134879 distinct states, run finished after 1709 ms. (steps per millisecond=352 ) properties seen :{0=1, 1=1, 2=1, 3=1}
FORMULA DES-PT-50b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-50b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-50b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-50b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
BK_STOP 1655075766612
--------------------
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="DES-PT-50b"
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 DES-PT-50b, 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 r046-smll-165252115900198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 '
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 ;