Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r233-tall-165286037300240.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 ShieldPPPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037300240
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 376K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655073924029

Running Version 0
[2022-06-12 22:45:25] [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 22:45:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:45:25] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2022-06-12 22:45:25] [INFO ] Transformed 1563 places.
[2022-06-12 22:45:25] [INFO ] Transformed 1423 transitions.
[2022-06-12 22:45:25] [INFO ] Found NUPN structural information;
[2022-06-12 22:45:25] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 335 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 16) seen :5
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :1
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2022-06-12 22:45:26] [INFO ] Computed 221 place invariants in 34 ms
[2022-06-12 22:45:26] [INFO ] [Real]Absence check using 221 positive place invariants in 81 ms returned sat
[2022-06-12 22:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:27] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2022-06-12 22:45:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:27] [INFO ] [Nat]Absence check using 221 positive place invariants in 77 ms returned sat
[2022-06-12 22:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:28] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2022-06-12 22:45:28] [INFO ] Deduced a trap composed of 18 places in 368 ms of which 5 ms to minimize.
[2022-06-12 22:45:29] [INFO ] Deduced a trap composed of 18 places in 344 ms of which 2 ms to minimize.
[2022-06-12 22:45:29] [INFO ] Deduced a trap composed of 22 places in 326 ms of which 1 ms to minimize.
[2022-06-12 22:45:29] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 1 ms to minimize.
[2022-06-12 22:45:30] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 0 ms to minimize.
[2022-06-12 22:45:30] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2022-06-12 22:45:30] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 1 ms to minimize.
[2022-06-12 22:45:31] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 1 ms to minimize.
[2022-06-12 22:45:31] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2022-06-12 22:45:31] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
[2022-06-12 22:45:32] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
[2022-06-12 22:45:32] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 0 ms to minimize.
[2022-06-12 22:45:32] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2022-06-12 22:45:32] [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 22:45:33] [INFO ] [Real]Absence check using 221 positive place invariants in 104 ms returned sat
[2022-06-12 22:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:33] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2022-06-12 22:45:34] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 1 ms to minimize.
[2022-06-12 22:45:34] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 1 ms to minimize.
[2022-06-12 22:45:34] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 0 ms to minimize.
[2022-06-12 22:45:35] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 1 ms to minimize.
[2022-06-12 22:45:35] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 1 ms to minimize.
[2022-06-12 22:45:35] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2022-06-12 22:45:36] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 0 ms to minimize.
[2022-06-12 22:45:36] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 1 ms to minimize.
[2022-06-12 22:45:36] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2022-06-12 22:45:37] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 1 ms to minimize.
[2022-06-12 22:45:37] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 0 ms to minimize.
[2022-06-12 22:45:37] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 0 ms to minimize.
[2022-06-12 22:45:37] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 0 ms to minimize.
[2022-06-12 22:45: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 1
[2022-06-12 22:45:38] [INFO ] [Real]Absence check using 221 positive place invariants in 81 ms returned sat
[2022-06-12 22:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:38] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2022-06-12 22:45:39] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 1 ms to minimize.
[2022-06-12 22:45:39] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 1 ms to minimize.
[2022-06-12 22:45:39] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2022-06-12 22:45:40] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 1 ms to minimize.
[2022-06-12 22:45:40] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2022-06-12 22:45:40] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 1 ms to minimize.
[2022-06-12 22:45:41] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2022-06-12 22:45:41] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 0 ms to minimize.
[2022-06-12 22:45:41] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 0 ms to minimize.
[2022-06-12 22:45:41] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 0 ms to minimize.
[2022-06-12 22:45:42] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 0 ms to minimize.
[2022-06-12 22:45:42] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 0 ms to minimize.
[2022-06-12 22:45:42] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 1 ms to minimize.
[2022-06-12 22:45:43] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 0 ms to minimize.
[2022-06-12 22:45:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 22:45:43] [INFO ] [Real]Absence check using 221 positive place invariants in 74 ms returned sat
[2022-06-12 22:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:43] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2022-06-12 22:45:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:44] [INFO ] [Nat]Absence check using 221 positive place invariants in 82 ms returned sat
[2022-06-12 22:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:44] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2022-06-12 22:45:45] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2022-06-12 22:45:45] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 1 ms to minimize.
[2022-06-12 22:45:45] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 2 ms to minimize.
[2022-06-12 22:45:46] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 1 ms to minimize.
[2022-06-12 22:45:46] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 0 ms to minimize.
[2022-06-12 22:45:46] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2022-06-12 22:45:46] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 1 ms to minimize.
[2022-06-12 22:45:47] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 1 ms to minimize.
[2022-06-12 22:45:47] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2022-06-12 22:45:47] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2022-06-12 22:45:47] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 2 ms to minimize.
[2022-06-12 22:45:48] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 1 ms to minimize.
[2022-06-12 22:45:48] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2022-06-12 22:45:48] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 1 ms to minimize.
[2022-06-12 22:45:48] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 0 ms to minimize.
[2022-06-12 22:45:49] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 8 ms to minimize.
[2022-06-12 22:45:49] [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 22:45:49] [INFO ] [Real]Absence check using 221 positive place invariants in 74 ms returned sat
[2022-06-12 22:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:49] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2022-06-12 22:45:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:50] [INFO ] [Nat]Absence check using 221 positive place invariants in 74 ms returned sat
[2022-06-12 22:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:50] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2022-06-12 22:45:51] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 1 ms to minimize.
[2022-06-12 22:45:51] [INFO ] Deduced a trap composed of 20 places in 327 ms of which 1 ms to minimize.
[2022-06-12 22:45:51] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 1 ms to minimize.
[2022-06-12 22:45:52] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 1 ms to minimize.
[2022-06-12 22:45:52] [INFO ] Deduced a trap composed of 18 places in 289 ms of which 1 ms to minimize.
[2022-06-12 22:45:52] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 1 ms to minimize.
[2022-06-12 22:45:53] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 1 ms to minimize.
[2022-06-12 22:45:53] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2022-06-12 22:45:53] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 1 ms to minimize.
[2022-06-12 22:45:54] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 1 ms to minimize.
[2022-06-12 22:45:54] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 0 ms to minimize.
[2022-06-12 22:45:54] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2022-06-12 22:45:55] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 0 ms to minimize.
[2022-06-12 22:45:55] [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 22:45:55] [INFO ] [Real]Absence check using 221 positive place invariants in 71 ms returned sat
[2022-06-12 22:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:55] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-06-12 22:45:56] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 1 ms to minimize.
[2022-06-12 22:45:56] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 1 ms to minimize.
[2022-06-12 22:45:56] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 1 ms to minimize.
[2022-06-12 22:45:57] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 1 ms to minimize.
[2022-06-12 22:45:57] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 0 ms to minimize.
[2022-06-12 22:45:57] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 1 ms to minimize.
[2022-06-12 22:45:58] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 1 ms to minimize.
[2022-06-12 22:45:58] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 1 ms to minimize.
[2022-06-12 22:45:58] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 0 ms to minimize.
[2022-06-12 22:45:59] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 1 ms to minimize.
[2022-06-12 22:45:59] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 1 ms to minimize.
[2022-06-12 22:45:59] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 1 ms to minimize.
[2022-06-12 22:45:59] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 1 ms to minimize.
[2022-06-12 22:46:00] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 0 ms to minimize.
[2022-06-12 22:46:00] [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 22:46:00] [INFO ] [Real]Absence check using 221 positive place invariants in 87 ms returned sat
[2022-06-12 22:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:01] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2022-06-12 22:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:01] [INFO ] [Nat]Absence check using 221 positive place invariants in 91 ms returned sat
[2022-06-12 22:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:02] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2022-06-12 22:46:03] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 1 ms to minimize.
[2022-06-12 22:46:03] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 1 ms to minimize.
[2022-06-12 22:46:03] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 1 ms to minimize.
[2022-06-12 22:46:04] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 1 ms to minimize.
[2022-06-12 22:46:04] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2022-06-12 22:46:04] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 1 ms to minimize.
[2022-06-12 22:46:05] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 3 ms to minimize.
[2022-06-12 22:46:05] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2022-06-12 22:46:05] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 1 ms to minimize.
[2022-06-12 22:46:06] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 1 ms to minimize.
[2022-06-12 22:46:06] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 0 ms to minimize.
[2022-06-12 22:46:06] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 1 ms to minimize.
[2022-06-12 22:46:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 22:46:06] [INFO ] [Real]Absence check using 221 positive place invariants in 88 ms returned sat
[2022-06-12 22:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:07] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2022-06-12 22:46:07] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 1 ms to minimize.
[2022-06-12 22:46:08] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 1 ms to minimize.
[2022-06-12 22:46:08] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2022-06-12 22:46:08] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2022-06-12 22:46:09] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2022-06-12 22:46:09] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 1 ms to minimize.
[2022-06-12 22:46:09] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 1 ms to minimize.
[2022-06-12 22:46:09] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2022-06-12 22:46:10] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2022-06-12 22:46:10] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 0 ms to minimize.
[2022-06-12 22:46:10] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 0 ms to minimize.
[2022-06-12 22:46:11] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 0 ms to minimize.
[2022-06-12 22:46:11] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 0 ms to minimize.
[2022-06-12 22:46:11] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2022-06-12 22:46:11] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 1 ms to minimize.
[2022-06-12 22:46:11] [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 22:46:12] [INFO ] [Real]Absence check using 221 positive place invariants in 89 ms returned sat
[2022-06-12 22:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:13] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2022-06-12 22:46:13] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 1 ms to minimize.
[2022-06-12 22:46:14] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2022-06-12 22:46:14] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 1 ms to minimize.
[2022-06-12 22:46:14] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 1 ms to minimize.
[2022-06-12 22:46:15] [INFO ] Deduced a trap composed of 24 places in 325 ms of which 1 ms to minimize.
[2022-06-12 22:46:15] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 1 ms to minimize.
[2022-06-12 22:46:15] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 1 ms to minimize.
[2022-06-12 22:46:16] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 1 ms to minimize.
[2022-06-12 22:46:16] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 0 ms to minimize.
[2022-06-12 22:46:16] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 0 ms to minimize.
[2022-06-12 22:46:17] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 1 ms to minimize.
[2022-06-12 22:46:17] [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
[2022-06-12 22:46:17] [INFO ] [Real]Absence check using 221 positive place invariants in 89 ms returned sat
[2022-06-12 22:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:18] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2022-06-12 22:46:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:46:18] [INFO ] [Nat]Absence check using 221 positive place invariants in 89 ms returned sat
[2022-06-12 22:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:46:19] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2022-06-12 22:46:20] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 1 ms to minimize.
[2022-06-12 22:46:20] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 1 ms to minimize.
[2022-06-12 22:46:20] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 1 ms to minimize.
[2022-06-12 22:46:21] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 1 ms to minimize.
[2022-06-12 22:46:21] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 1 ms to minimize.
[2022-06-12 22:46:21] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2022-06-12 22:46:22] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2022-06-12 22:46:22] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 1 ms to minimize.
[2022-06-12 22:46:22] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 1 ms to minimize.
[2022-06-12 22:46:22] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 1 ms to minimize.
[2022-06-12 22:46:23] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 1 ms to minimize.
[2022-06-12 22:46:23] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 0 ms to minimize.
[2022-06-12 22:46:23] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2022-06-12 22:46:23] [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 9
Fused 10 Parikh solutions to 1 different solutions.
Support contains 124 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1563 transition count 1146
Reduce places removed 277 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 556 place count 1286 transition count 1144
Reduce places removed 1 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 39 rules applied. Total rules applied 595 place count 1285 transition count 1106
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 633 place count 1247 transition count 1106
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 633 place count 1247 transition count 1010
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 825 place count 1151 transition count 1010
Discarding 126 places :
Symmetric choice reduction at 4 with 126 rule applications. Total rules 951 place count 1025 transition count 884
Iterating global reduction 4 with 126 rules applied. Total rules applied 1077 place count 1025 transition count 884
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1077 place count 1025 transition count 846
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1153 place count 987 transition count 846
Performed 281 Post agglomeration using F-continuation condition.Transition count delta: 281
Deduced a syphon composed of 281 places in 2 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 4 with 562 rules applied. Total rules applied 1715 place count 706 transition count 565
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1793 place count 667 transition count 565
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1798 place count 667 transition count 560
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1803 place count 662 transition count 560
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 5 with 46 rules applied. Total rules applied 1849 place count 662 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1850 place count 661 transition count 559
Applied a total of 1850 rules in 565 ms. Remains 661 /1563 variables (removed 902) and now considering 559/1423 (removed 864) transitions.
Finished structural reductions, in 1 iterations. Remains : 661/1563 places, 559/1423 transitions.
[2022-06-12 22:46:24] [INFO ] Flatten gal took : 103 ms
[2022-06-12 22:46:24] [INFO ] Flatten gal took : 40 ms
[2022-06-12 22:46:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6241278271107466779.gal : 26 ms
[2022-06-12 22:46:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15038909424665587953.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/ReachabilityCardinality6241278271107466779.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15038909424665587953.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/ReachabilityCardinality6241278271107466779.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15038909424665587953.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15038909424665587953.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 74
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :74 after 1154
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :1154 after 23042
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :23042 after 7.74144e+06
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :7.74144e+06 after 9.27041e+12
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :9.27041e+12 after 1.34058e+17
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-02 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1.34058e+17 after 1.34058e+17
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1.34058e+17 after 1.34058e+17
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-13 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-01 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property ShieldPPPt-PT-020B-ReachabilityFireability-00 does not hold.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.34058e+17 after 1.34058e+17
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.34058e+17 after 1.34058e+17
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.34058e+17 after 1.34059e+17
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-05 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.34059e+17 after 1.38659e+17
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.38659e+17 after 1.49762e+17
Detected timeout of ITS tools.
[2022-06-12 22:46:39] [INFO ] Flatten gal took : 38 ms
[2022-06-12 22:46:39] [INFO ] Applying decomposition
[2022-06-12 22:46:39] [INFO ] Flatten gal took : 36 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/graph5690602037565077017.txt, -o, /tmp/graph5690602037565077017.bin, -w, /tmp/graph5690602037565077017.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/graph5690602037565077017.bin, -l, -1, -v, -w, /tmp/graph5690602037565077017.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:46:40] [INFO ] Decomposing Gal with order
[2022-06-12 22:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:46:40] [INFO ] Removed a total of 216 redundant transitions.
[2022-06-12 22:46:40] [INFO ] Flatten gal took : 146 ms
[2022-06-12 22:46:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 57 ms.
[2022-06-12 22:46:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10657454743145406646.gal : 14 ms
[2022-06-12 22:46:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5530462586653757693.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/ReachabilityCardinality10657454743145406646.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5530462586653757693.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/ReachabilityCardinality10657454743145406646.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5530462586653757693.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5530462586653757693.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 11
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :11 after 1209
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1209 after 2.12508e+08
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :2.12508e+08 after 1.15667e+13
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.15667e+13 after 1.54503e+23
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18129628659070239256
[2022-06-12 22:46:55] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18129628659070239256
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/ltsmin18129628659070239256]
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/ltsmin18129628659070239256] 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/ltsmin18129628659070239256] 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 2 resets, run finished after 4705 ms. (steps per millisecond=212 ) properties (out of 5) seen :2
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3297 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3342 ms. (steps per millisecond=299 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6 resets, run finished after 4002 ms. (steps per millisecond=249 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 559 rows 661 cols
[2022-06-12 22:47:11] [INFO ] Computed 221 place invariants in 5 ms
[2022-06-12 22:47:12] [INFO ] [Real]Absence check using 221 positive place invariants in 58 ms returned sat
[2022-06-12 22:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:47:12] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2022-06-12 22:47:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:47:12] [INFO ] [Nat]Absence check using 221 positive place invariants in 41 ms returned sat
[2022-06-12 22:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:47:12] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-06-12 22:47:12] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-12 22:47:12] [INFO ] [Nat]Added 73 Read/Feed constraints in 20 ms returned sat
[2022-06-12 22:47:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2022-06-12 22:47:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:47:12] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:47:12] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2022-06-12 22:47:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 325 ms
[2022-06-12 22:47:13] [INFO ] Computed and/alt/rep : 557/1684/557 causal constraints (skipped 0 transitions) in 30 ms.
[2022-06-12 22:47:21] [INFO ] Added : 556 causal constraints over 115 iterations in 8980 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-06-12 22:47:22] [INFO ] [Real]Absence check using 221 positive place invariants in 43 ms returned sat
[2022-06-12 22:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:47:22] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-06-12 22:47:22] [INFO ] [Real]Added 73 Read/Feed constraints in 13 ms returned sat
[2022-06-12 22:47:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:47:22] [INFO ] [Nat]Absence check using 221 positive place invariants in 43 ms returned sat
[2022-06-12 22:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:47:22] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-06-12 22:47:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2022-06-12 22:47:22] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-12 22:47:22] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2022-06-12 22:47:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-06-12 22:47:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2022-06-12 22:47:23] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2022-06-12 22:47:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2022-06-12 22:47:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2022-06-12 22:47:23] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-06-12 22:47:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 457 ms
[2022-06-12 22:47:23] [INFO ] Computed and/alt/rep : 557/1684/557 causal constraints (skipped 0 transitions) in 30 ms.
[2022-06-12 22:47:34] [INFO ] Added : 479 causal constraints over 96 iterations in 11580 ms. Result :unknown
[2022-06-12 22:47:35] [INFO ] [Real]Absence check using 221 positive place invariants in 44 ms returned sat
[2022-06-12 22:47:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:47:35] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2022-06-12 22:47:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:47:35] [INFO ] [Nat]Absence check using 221 positive place invariants in 45 ms returned sat
[2022-06-12 22:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:47:35] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2022-06-12 22:47:35] [INFO ] [Nat]Added 73 Read/Feed constraints in 20 ms returned sat
[2022-06-12 22:47:35] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-06-12 22:47:35] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-12 22:47:35] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2022-06-12 22:47:35] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2022-06-12 22:47:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 254 ms
[2022-06-12 22:47:35] [INFO ] Computed and/alt/rep : 557/1684/557 causal constraints (skipped 0 transitions) in 31 ms.
[2022-06-12 22:47:41] [INFO ] Added : 482 causal constraints over 100 iterations in 6048 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
Incomplete Parikh walk after 115000 steps, including 937 resets, run finished after 556 ms. (steps per millisecond=206 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92200 steps, including 850 resets, run finished after 416 ms. (steps per millisecond=221 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 81000 steps, including 267 resets, run finished after 386 ms. (steps per millisecond=209 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 68 out of 661 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 661/661 places, 559/559 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 661 transition count 546
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 648 transition count 545
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 647 transition count 545
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 28 place count 647 transition count 538
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 640 transition count 538
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 638 transition count 536
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 638 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 122 place count 600 transition count 498
Renaming transitions due to excessive name length > 1024 char.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 597 transition count 498
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 135 place count 597 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 596 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 595 transition count 497
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 137 place count 595 transition count 495
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 593 transition count 495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 592 transition count 494
Applied a total of 142 rules in 164 ms. Remains 592 /661 variables (removed 69) and now considering 494/559 (removed 65) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/661 places, 494/559 transitions.
[2022-06-12 22:47:43] [INFO ] Flatten gal took : 25 ms
[2022-06-12 22:47:43] [INFO ] Flatten gal took : 37 ms
[2022-06-12 22:47:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2619344634385086612.gal : 4 ms
[2022-06-12 22:47:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4177810558009015277.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/ReachabilityCardinality2619344634385086612.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4177810558009015277.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/ReachabilityCardinality2619344634385086612.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4177810558009015277.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4177810558009015277.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 60
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :60 after 360
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :360 after 60480
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60480 after 3.48365e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.48365e+08 after 2.21958e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.21958e+10 after 2.21964e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.21964e+10 after 2.22108e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.22108e+10 after 3.09216e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.09216e+10 after 1.48744e+14
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.48744e+14 after 1.23542e+18
Detected timeout of ITS tools.
[2022-06-12 22:47:58] [INFO ] Flatten gal took : 29 ms
[2022-06-12 22:47:58] [INFO ] Applying decomposition
[2022-06-12 22:47:58] [INFO ] Flatten gal took : 25 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/graph9662036827598450967.txt, -o, /tmp/graph9662036827598450967.bin, -w, /tmp/graph9662036827598450967.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/graph9662036827598450967.bin, -l, -1, -v, -w, /tmp/graph9662036827598450967.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:47:58] [INFO ] Decomposing Gal with order
[2022-06-12 22:47:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:47:58] [INFO ] Removed a total of 226 redundant transitions.
[2022-06-12 22:47:58] [INFO ] Flatten gal took : 86 ms
[2022-06-12 22:47:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 23 ms.
[2022-06-12 22:47:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9661065310968996111.gal : 7 ms
[2022-06-12 22:47:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13617054443172005009.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/ReachabilityCardinality9661065310968996111.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13617054443172005009.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/ReachabilityCardinality9661065310968996111.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13617054443172005009.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13617054443172005009.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 120
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :120 after 360
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :360 after 1.93536e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.93536e+06 after 3.48365e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15226781931359650299
[2022-06-12 22:48:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15226781931359650299
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/ltsmin15226781931359650299]
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/ltsmin15226781931359650299] 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/ltsmin15226781931359650299] 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 2 resets, run finished after 4809 ms. (steps per millisecond=207 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3393 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3408 ms. (steps per millisecond=293 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4483268 steps, run timeout after 30001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 4483268 steps, saw 3253283 distinct states, run finished after 30006 ms. (steps per millisecond=149 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 494 rows 592 cols
[2022-06-12 22:48:56] [INFO ] Computed 220 place invariants in 3 ms
[2022-06-12 22:48:56] [INFO ] [Real]Absence check using 220 positive place invariants in 43 ms returned sat
[2022-06-12 22:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:57] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-06-12 22:48:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:48:57] [INFO ] [Nat]Absence check using 220 positive place invariants in 54 ms returned sat
[2022-06-12 22:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:48:57] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2022-06-12 22:48:57] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-12 22:48:57] [INFO ] [Nat]Added 34 Read/Feed constraints in 10 ms returned sat
[2022-06-12 22:48:57] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2022-06-12 22:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2022-06-12 22:48:57] [INFO ] Computed and/alt/rep : 469/1225/469 causal constraints (skipped 0 transitions) in 29 ms.
[2022-06-12 22:49:01] [INFO ] Added : 413 causal constraints over 83 iterations in 3995 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 22:49:01] [INFO ] [Real]Absence check using 220 positive place invariants in 40 ms returned sat
[2022-06-12 22:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:01] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2022-06-12 22:49:01] [INFO ] [Real]Added 34 Read/Feed constraints in 10 ms returned sat
[2022-06-12 22:49:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:49:01] [INFO ] [Nat]Absence check using 220 positive place invariants in 39 ms returned sat
[2022-06-12 22:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:49:02] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-06-12 22:49:02] [INFO ] [Nat]Added 34 Read/Feed constraints in 13 ms returned sat
[2022-06-12 22:49:02] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-06-12 22:49:02] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-06-12 22:49:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2022-06-12 22:49:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:49:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2022-06-12 22:49:02] [INFO ] Computed and/alt/rep : 469/1225/469 causal constraints (skipped 0 transitions) in 24 ms.
[2022-06-12 22:49:12] [INFO ] Added : 415 causal constraints over 85 iterations in 9684 ms. Result :unknown
Incomplete Parikh walk after 49700 steps, including 205 resets, run finished after 256 ms. (steps per millisecond=194 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 52900 steps, including 418 resets, run finished after 246 ms. (steps per millisecond=215 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 35 out of 592 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 592/592 places, 494/494 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 592 transition count 487
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 585 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 584 transition count 486
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 16 place count 584 transition count 475
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 38 place count 573 transition count 475
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 572 transition count 474
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 572 transition count 474
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 60 place count 562 transition count 464
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 72 place count 556 transition count 463
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 556 transition count 463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 555 transition count 462
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 554 transition count 461
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 553 transition count 460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 552 transition count 459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 551 transition count 458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 550 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 549 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 548 transition count 455
Applied a total of 81 rules in 187 ms. Remains 548 /592 variables (removed 44) and now considering 455/494 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 548/592 places, 455/494 transitions.
[2022-06-12 22:49:12] [INFO ] Flatten gal took : 22 ms
[2022-06-12 22:49:12] [INFO ] Flatten gal took : 21 ms
[2022-06-12 22:49:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12247417337565398155.gal : 3 ms
[2022-06-12 22:49:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11025159844095837787.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/ReachabilityCardinality12247417337565398155.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11025159844095837787.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/ReachabilityCardinality12247417337565398155.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11025159844095837787.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11025159844095837787.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 2880
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2880 after 336030
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :336030 after 343167
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :343167 after 1.65372e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.65372e+06 after 2.17397e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.17397e+08 after 1.8281e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.8281e+10 after 8.47294e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.47294e+13 after 2.51592e+17
Detected timeout of ITS tools.
[2022-06-12 22:49:27] [INFO ] Flatten gal took : 22 ms
[2022-06-12 22:49:27] [INFO ] Applying decomposition
[2022-06-12 22:49:27] [INFO ] Flatten gal took : 20 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/graph12934776302420068403.txt, -o, /tmp/graph12934776302420068403.bin, -w, /tmp/graph12934776302420068403.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/graph12934776302420068403.bin, -l, -1, -v, -w, /tmp/graph12934776302420068403.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:49:28] [INFO ] Decomposing Gal with order
[2022-06-12 22:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:49:28] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-12 22:49:28] [INFO ] Flatten gal took : 38 ms
[2022-06-12 22:49:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2022-06-12 22:49:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7655161475856914564.gal : 6 ms
[2022-06-12 22:49:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9719750646301868221.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/ReachabilityCardinality7655161475856914564.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9719750646301868221.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/ReachabilityCardinality7655161475856914564.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9719750646301868221.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9719750646301868221.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 120
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11466436939550946357
[2022-06-12 22:49:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11466436939550946357
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/ltsmin11466436939550946357]
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/ltsmin11466436939550946357] 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/ltsmin11466436939550946357] 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 2 resets, run finished after 4501 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3505 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5078244 steps, run timeout after 30001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 5078244 steps, saw 3725952 distinct states, run finished after 30002 ms. (steps per millisecond=169 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 455 rows 548 cols
[2022-06-12 22:50:22] [INFO ] Computed 220 place invariants in 2 ms
[2022-06-12 22:50:22] [INFO ] [Real]Absence check using 220 positive place invariants in 37 ms returned sat
[2022-06-12 22:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:50:22] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-06-12 22:50:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:50:22] [INFO ] [Nat]Absence check using 220 positive place invariants in 37 ms returned sat
[2022-06-12 22:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:50:22] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-06-12 22:50:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-12 22:50:22] [INFO ] [Nat]Added 25 Read/Feed constraints in 8 ms returned sat
[2022-06-12 22:50:22] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2022-06-12 22:50:22] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-06-12 22:50:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-06-12 22:50:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2022-06-12 22:50:22] [INFO ] Computed and/alt/rep : 442/1123/442 causal constraints (skipped 0 transitions) in 23 ms.
[2022-06-12 22:50:31] [INFO ] Added : 370 causal constraints over 74 iterations in 8870 ms. Result :unknown
Incomplete Parikh walk after 94900 steps, including 1000 resets, run finished after 489 ms. (steps per millisecond=194 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 35 out of 548 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 548/548 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 548 /548 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 548/548 places, 455/455 transitions.
Starting structural reductions, iteration 0 : 548/548 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 548 /548 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 548 cols
[2022-06-12 22:50:32] [INFO ] Computed 220 place invariants in 3 ms
[2022-06-12 22:50:32] [INFO ] Implicit Places using invariants in 309 ms returned [531, 535]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 311 ms to find 2 implicit places.
[2022-06-12 22:50:32] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 455 rows 546 cols
[2022-06-12 22:50:32] [INFO ] Computed 218 place invariants in 2 ms
[2022-06-12 22:50:32] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Starting structural reductions, iteration 1 : 546/548 places, 455/455 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 544 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 544 transition count 453
Applied a total of 4 rules in 31 ms. Remains 544 /546 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:50:32] [INFO ] Computed 218 place invariants in 3 ms
[2022-06-12 22:50:33] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:50:33] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-12 22:50:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-12 22:50:33] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 544/548 places, 453/455 transitions.
[2022-06-12 22:50:33] [INFO ] Flatten gal took : 18 ms
[2022-06-12 22:50:33] [INFO ] Flatten gal took : 17 ms
[2022-06-12 22:50:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9765374193675711112.gal : 2 ms
[2022-06-12 22:50:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18174593733697318574.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/ReachabilityCardinality9765374193675711112.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18174593733697318574.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/ReachabilityCardinality9765374193675711112.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18174593733697318574.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18174593733697318574.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 2880
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2880 after 336870
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :336870 after 344007
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :344007 after 1.65456e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.65456e+06 after 2.17398e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.17398e+08 after 1.8281e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.8281e+10 after 8.47421e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.47421e+13 after 2.52201e+17
Detected timeout of ITS tools.
[2022-06-12 22:50:53] [INFO ] Flatten gal took : 17 ms
[2022-06-12 22:50:53] [INFO ] Applying decomposition
[2022-06-12 22:50:53] [INFO ] Flatten gal took : 17 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/graph2050643520815742587.txt, -o, /tmp/graph2050643520815742587.bin, -w, /tmp/graph2050643520815742587.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/graph2050643520815742587.bin, -l, -1, -v, -w, /tmp/graph2050643520815742587.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:50:53] [INFO ] Decomposing Gal with order
[2022-06-12 22:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:50:54] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-12 22:50:54] [INFO ] Flatten gal took : 29 ms
[2022-06-12 22:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 4 ms.
[2022-06-12 22:50:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6092587341295730683.gal : 3 ms
[2022-06-12 22:50:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5144625491786743298.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/ReachabilityCardinality6092587341295730683.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5144625491786743298.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/ReachabilityCardinality6092587341295730683.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5144625491786743298.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5144625491786743298.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 1920
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14245818311725768905
[2022-06-12 22:51:14] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14245818311725768905
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/ltsmin14245818311725768905]
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/ltsmin14245818311725768905] 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/ltsmin14245818311725768905] 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 2 resets, run finished after 4441 ms. (steps per millisecond=225 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3304 ms. (steps per millisecond=302 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5099657 steps, run timeout after 30001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 5099657 steps, saw 3791018 distinct states, run finished after 30002 ms. (steps per millisecond=169 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:51:53] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-12 22:51:53] [INFO ] [Real]Absence check using 218 positive place invariants in 38 ms returned sat
[2022-06-12 22:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:51:54] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-06-12 22:51:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:51:54] [INFO ] [Nat]Absence check using 218 positive place invariants in 35 ms returned sat
[2022-06-12 22:51:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:51:54] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2022-06-12 22:51:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-12 22:51:54] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2022-06-12 22:51:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-06-12 22:51:54] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2022-06-12 22:51:54] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-06-12 22:51:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2022-06-12 22:51:54] [INFO ] Computed and/alt/rep : 440/1111/440 causal constraints (skipped 0 transitions) in 28 ms.
[2022-06-12 22:52:03] [INFO ] Added : 360 causal constraints over 72 iterations in 9049 ms. Result :unknown
Incomplete Parikh walk after 90200 steps, including 1009 resets, run finished after 385 ms. (steps per millisecond=234 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 35 out of 544 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 544/544 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 544 /544 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 544/544 places, 453/453 transitions.
Starting structural reductions, iteration 0 : 544/544 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 544 /544 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:52:04] [INFO ] Computed 218 place invariants in 4 ms
[2022-06-12 22:52:04] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:52:04] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-12 22:52:04] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-12 22:52:05] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2022-06-12 22:52:05] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:52:05] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-12 22:52:05] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
Finished structural reductions, in 1 iterations. Remains : 544/544 places, 453/453 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=190 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:52:05] [INFO ] Computed 218 place invariants in 4 ms
[2022-06-12 22:52:05] [INFO ] [Real]Absence check using 218 positive place invariants in 36 ms returned sat
[2022-06-12 22:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:52:06] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2022-06-12 22:52:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:52:06] [INFO ] [Nat]Absence check using 218 positive place invariants in 38 ms returned sat
[2022-06-12 22:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:52:06] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2022-06-12 22:52:06] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-12 22:52:06] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2022-06-12 22:52:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-06-12 22:52:06] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2022-06-12 22:52:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-06-12 22:52:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2022-06-12 22:52:06] [INFO ] Computed and/alt/rep : 440/1111/440 causal constraints (skipped 0 transitions) in 21 ms.
[2022-06-12 22:52:15] [INFO ] Added : 360 causal constraints over 72 iterations in 8894 ms. Result :unknown
[2022-06-12 22:52:15] [INFO ] Flatten gal took : 17 ms
[2022-06-12 22:52:15] [INFO ] Flatten gal took : 18 ms
[2022-06-12 22:52:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2303746920928433781.gal : 2 ms
[2022-06-12 22:52:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17770203338534759852.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/ReachabilityCardinality2303746920928433781.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17770203338534759852.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/ReachabilityCardinality2303746920928433781.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17770203338534759852.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17770203338534759852.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 2880
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2880 after 336870
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :336870 after 344007
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :344007 after 1.65456e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.65456e+06 after 2.17398e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.17398e+08 after 1.8281e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.8281e+10 after 8.47421e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.47421e+13 after 2.52201e+17
Detected timeout of ITS tools.
[2022-06-12 22:52:40] [INFO ] Flatten gal took : 16 ms
[2022-06-12 22:52:40] [INFO ] Applying decomposition
[2022-06-12 22:52:40] [INFO ] Flatten gal took : 16 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/graph18274673861976847918.txt, -o, /tmp/graph18274673861976847918.bin, -w, /tmp/graph18274673861976847918.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/graph18274673861976847918.bin, -l, -1, -v, -w, /tmp/graph18274673861976847918.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:52:40] [INFO ] Decomposing Gal with order
[2022-06-12 22:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:52:40] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-12 22:52:40] [INFO ] Flatten gal took : 29 ms
[2022-06-12 22:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 4 ms.
[2022-06-12 22:52:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13034372816676882162.gal : 4 ms
[2022-06-12 22:52:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15473210527969188461.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/ReachabilityCardinality13034372816676882162.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15473210527969188461.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/ReachabilityCardinality13034372816676882162.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15473210527969188461.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15473210527969188461.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 960
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9217179205560108238
[2022-06-12 22:53:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9217179205560108238
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/ltsmin9217179205560108238]
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/ltsmin9217179205560108238] 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/ltsmin9217179205560108238] 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)
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 544 transition count 453
Applied a total of 97 rules in 19 ms. Remains 544 /544 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:53:07] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-12 22:53:07] [INFO ] [Real]Absence check using 218 positive place invariants in 70 ms returned sat
[2022-06-12 22:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:53:08] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-06-12 22:53:08] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-06-12 22:53:08] [INFO ] [Real]Added 86 Read/Feed constraints in 14 ms returned sat
[2022-06-12 22:53:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:53:08] [INFO ] [Nat]Absence check using 218 positive place invariants in 38 ms returned sat
[2022-06-12 22:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:53:08] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-06-12 22:53:08] [INFO ] [Nat]Added 86 Read/Feed constraints in 14 ms returned sat
[2022-06-12 22:53:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-06-12 22:53:08] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2022-06-12 22:53:08] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2022-06-12 22:53:08] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2022-06-12 22:53:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 210 ms
[2022-06-12 22:53:08] [INFO ] Computed and/alt/rep : 442/1358/442 causal constraints (skipped 0 transitions) in 21 ms.
[2022-06-12 22:53:19] [INFO ] Added : 419 causal constraints over 85 iterations in 10397 ms. Result :unknown
[2022-06-12 22:53:19] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
[2022-06-12 22:53:19] [INFO ] Applying decomposition
[2022-06-12 22:53:19] [INFO ] Flatten gal took : 24 ms
Built C files in :
/tmp/ltsmin7192568438872635345
[2022-06-12 22:53:19] [INFO ] Computing symmetric may disable matrix : 453 transitions.
[2022-06-12 22:53:19] [INFO ] Input system was already deterministic with 453 transitions.
[2022-06-12 22:53:19] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:53:19] [INFO ] Computing symmetric may enable matrix : 453 transitions.
[2022-06-12 22:53:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:53:19] [INFO ] Flatten gal took : 61 ms
[2022-06-12 22:53:19] [INFO ] Computing Do-Not-Accords matrix : 453 transitions.
[2022-06-12 22:53:19] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:53:19] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7192568438872635345
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/ltsmin7192568438872635345]
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/graph16389806969562929454.txt, -o, /tmp/graph16389806969562929454.bin, -w, /tmp/graph16389806969562929454.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/graph16389806969562929454.bin, -l, -1, -v, -w, /tmp/graph16389806969562929454.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:53:19] [INFO ] Decomposing Gal with order
[2022-06-12 22:53:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:53:19] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-12 22:53:19] [INFO ] Flatten gal took : 44 ms
[2022-06-12 22:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 4 ms.
[2022-06-12 22:53:19] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9054046162505277089.gal : 4 ms
[2022-06-12 22:53:19] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15116254872197047496.prop : 22 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/ReachabilityFireability9054046162505277089.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability15116254872197047496.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/ReachabilityFireability9054046162505277089.gal -t CGAL -reachable-file /tmp/ReachabilityFireability15116254872197047496.prop --nowitness
Loading property file /tmp/ReachabilityFireability15116254872197047496.prop.
[2022-06-12 22:53:19] [INFO ] Ran tautology test, simplified 0 / 1 in 457 ms.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 1920
[2022-06-12 22:53:19] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=0 took 42 ms
[2022-06-12 22:53:19] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=1 took 14 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 453 rows 544 cols
[2022-06-12 22:53:19] [INFO ] Computed 218 place invariants in 2 ms
inv : p312 + p317 = 1
inv : p741 + p744 + p745 = 1
inv : p433 + p436 + p437 = 1
inv : p118 + p123 + p124 = 1
inv : p158 + p163 = 1
inv : p342 + p347 + p348 = 1
inv : p378 + p382 = 1
inv : p475 + p478 + p480 + p483 = 1
inv : p426 + p429 + p430 = 1
inv : p734 + p737 + p738 = 1
inv : p349 + p354 + p355 = 1
inv : p609 + p613 = 1
inv : p125 + p130 + p131 = 1
inv : p639 + p641 + p644 + p664 + p667 + p668 = 1
inv : p455 + p459 = 1
inv : p1479 + p1484 = 1
inv : p639 + p641 + p644 + p657 + p660 + p661 = 1
inv : p1005 + p1006 + p1010 = 1
inv : p940 + p945 = 1
inv : p1434 + p1439 + p1440 = 1
inv : p419 + p422 + p423 = 1
inv : p177 + p179 + p221 + p224 + p228 + p230 = 1
inv : p111 + p116 + p117 = 1
inv : p1335 + p1336 + p1350 + p1353 + p1354 = 1
inv : p797 + p798 + p818 + p823 + p824 = 1
inv : p875 + p881 + p884 + p885 = 1
inv : p983 + p988 = 1
inv : p797 + p798 + p800 + p804 + p809 + p810 = 1
inv : p48 + p53 + p54 = 1
inv : p177 + p179 + p202 + p205 + p206 = 1
inv : p727 + p730 + p731 = 1
inv : p1029 + p1030 + p1032 + p1034 = 1
inv : p177 + p179 + p188 + p193 + p194 = 1
inv : p972 + p977 + p978 = 1
inv : p1387 + p1390 + p1392 + p1395 = 1
inv : p797 + p798 + p800 + p804 + p807 + p808 = 1
inv : p487 + p488 + p493 + p495 = 1
inv : p356 + p359 + p360 = 1
inv : p1013 + p1018 = 1
inv : p1467 + p1472 = 1
inv : p1335 + p1336 + p1357 + p1360 + p1361 = 1
inv : p994 + p998 = 1
inv : p177 + p179 + p202 + p207 + p208 = 1
inv : p639 + p641 + p644 + p650 + p655 + p656 = 1
inv : p965 + p970 + p971 = 1
inv : p639 + p641 + p693 + p697 = 1
inv : p1233 + p1238 + p1239 + p1241 = 1
inv : p324 + p326 + p327 + p329 = 1
inv : p875 + p895 + p898 + p899 = 1
inv : p786 + p791 = 1
inv : p1417 + p1419 = 1
inv : p487 + p488 + p510 + p515 + p516 = 1
inv : p1302 + p1306 = 1
inv : p1427 + p1432 + p1433 = 1
inv : p741 + p746 + p747 = 1
inv : p177 + p179 + p195 + p198 + p199 = 1
inv : p444 + p449 = 1
inv : p620 + p625 = 1
inv : p81 + p86 = 1
inv : p1148 + p1152 = 1
inv : p1516 + p1517 = 1
inv : p147 + p151 = 1
inv : p262 + p264 = 1
inv : p1056 + p1060 + p1064 = 1
inv : p487 + p488 + p496 + p501 + p502 = 1
inv : p1494 + p1496 = 1
inv : p1533 + p1537 = 1
inv : p763 + p767 = 1
inv : p1280 + p1283 + p1284 = 1
inv : p596 + p598 = 1
inv : p487 + p488 + p503 + p508 + p509 = 1
inv : p639 + p709 + p714 = 1
inv : p1313 + p1318 = 1
inv : p639 + p641 + p686 + p690 = 1
inv : p928 + p933 = 1
inv : p797 + p798 + p800 + p801 + p803 = 1
inv : p29 + p31 + p33 = 1
inv : p1335 + p1379 + p1383 = 1
inv : p580 + p583 + p584 = 1
inv : p875 + p881 + p886 + p887 = 1
inv : p93 + p98 = 1
inv : p1196 + p1201 + p1202 = 1
inv : p433 + p438 + p439 = 1
inv : p466 + p471 = 1
inv : p342 + p345 + p346 = 1
inv : p1105 + p1112 + p1117 + p1118 = 1
inv : p1266 + p1269 + p1270 = 1
inv : p272 + p275 + p276 = 1
inv : p367 + p372 = 1
inv : p906 + p911 = 1
inv : p487 + p488 + p532 + p536 = 1
inv : p132 + p136 = 1
inv : p177 + p179 + p185 + p187 = 1
inv : p177 + p179 + p195 + p200 + p201 = 1
inv : p1225 + p1229 = 1
inv : p177 + p247 + p252 = 1
inv : p29 + p34 + p37 + p38 = 1
inv : p177 + p179 + p188 + p191 + p192 = 1
inv : p1335 + p1336 + p1364 + p1368 = 1
inv : p1402 + p1407 = 1
inv : p958 + p959 + p961 + p962 = 1
inv : p1420 + p1425 + p1426 = 1
inv : p279 + p282 + p283 = 1
inv : p587 + p590 + p591 = 1
inv : p356 + p361 + p362 = 1
inv : p29 + p41 + p46 + p47 = 1
inv : p487 + p488 + p496 + p499 + p500 = 1
inv : p752 + p757 = 1
inv : p1189 + p1194 + p1195 = 1
inv : p724 + p726 = 1
inv : p1091 + p1094 + p1096 + p1099 = 1
inv : p1273 + p1276 + p1277 = 1
inv : p349 + p352 + p353 = 1
inv : p1280 + p1285 + p1286 = 1
inv : p1068 + p1071 = 1
inv : p848 + p850 + p851 + p853 + p856 = 1
inv : p279 + p284 + p285 = 1
inv : p1203 + p1206 + p1207 = 1
inv : p580 + p585 + p586 = 1
inv : p1105 + p1119 + p1122 + p1123 = 1
inv : p1186 + p1188 = 1
inv : p1335 + p1336 + p1340 + p1342 = 1
inv : p917 + p921 = 1
inv : p1105 + p1126 + p1129 + p1130 = 1
inv : p1321 + p1325 = 1
inv : p272 + p277 + p278 = 1
inv : p1248 + p1253 = 1
inv : p587 + p592 + p593 = 1
inv : p1196 + p1199 + p1200 = 1
inv : p1273 + p1278 + p1279 = 1
inv : p177 + p179 + p209 + p213 = 1
inv : p860 + p863 + p865 + p868 = 1
inv : p108 + p110 = 1
inv : p1544 + p1549 = 1
inv : p958 + p959 + p963 + p964 = 1
inv : p639 + p641 + p675 + p680 = 1
inv : p1189 + p1192 + p1193 = 1
inv : p401 + p406 = 1
inv : p1029 + p1030 + p1042 + p1045 + p1046 = 1
inv : p487 + p488 + p510 + p513 + p514 = 1
inv : p29 + p41 + p44 + p45 = 1
inv : p20 + p22 = 1
inv : p1029 + p1030 + p1035 + p1040 + p1041 = 1
inv : p965 + p968 + p969 = 1
inv : p339 + p341 = 1
inv : p1266 + p1271 + p1272 = 1
inv : p416 + p418 = 1
inv : p287 + p288 + p295 = 1
inv : p1214 + p1219 = 1
inv : p48 + p51 + p52 = 1
inv : p1420 + p1423 + p1424 = 1
inv : p29 + p34 + p39 + p40 = 1
inv : p487 + p488 + p503 + p506 + p507 = 1
inv : p1497 + p1502 = 1
inv : p797 + p798 + p818 + p821 + p822 = 1
inv : p1556 + p1561 = 1
inv : p1105 + p1112 + p1115 + p1116 = 1
inv : p1029 + p1049 + p1052 + p1053 = 1
inv : p1105 + p1119 + p1124 + p1125 = 1
inv : p797 + p829 + p834 = 1
inv : p1105 + p1133 + p1137 + p1142 = 1
inv : p1434 + p1437 + p1438 = 1
inv : p1105 + p1126 + p1131 + p1132 = 1
inv : p1335 + p1336 + p1343 + p1348 + p1349 = 1
inv : p1427 + p1430 + p1431 = 1
inv : p573 + p576 + p577 = 1
inv : p875 + p888 + p893 + p894 = 1
inv : p170 + p175 = 1
inv : p1203 + p1208 + p1209 = 1
inv : p111 + p114 + p115 = 1
inv : p265 + p268 + p269 = 1
inv : p1082 + p1087 = 1
inv : p1335 + p1336 + p1350 + p1355 + p1356 = 1
inv : p1263 + p1265 = 1
inv : p1335 + p1336 + p1357 + p1362 + p1363 = 1
inv : p70 + p74 = 1
inv : p426 + p431 + p432 = 1
inv : p639 + p641 + p644 + p664 + p669 + p670 = 1
inv : p1442 + p1445 + p1448 + p1450 = 1
inv : p570 + p571 + p572 = 1
inv : p1504 + p1509 = 1
inv : p1167 + p1171 = 1
inv : p875 + p878 + p880 = 1
inv : p734 + p739 + p740 = 1
inv : p125 + p128 + p129 = 1
inv : p797 + p798 + p811 + p814 + p815 = 1
inv : p55 + p59 = 1
inv : p1291 + p1296 = 1
inv : p487 + p488 + p518 + p521 + p526 = 1
inv : p639 + p641 + p644 + p657 + p662 + p663 = 1
inv : p771 + p774 + p775 + p777 + p779 = 1
inv : p797 + p798 + p811 + p816 + p817 = 1
inv : p1159 + p1164 = 1
inv : p1456 + p1460 = 1
inv : p177 + p179 + p235 + p240 = 1
inv : p840 + p841 + p844 = 1
inv : p1029 + p1030 + p1035 + p1038 + p1039 = 1
inv : p552 + p555 + p558 + p560 = 1
inv : p1029 + p1030 + p1042 + p1047 + p1048 = 1
inv : p1029 + p1049 + p1054 + p1055 = 1
inv : p487 + p540 + p543 + p545 + p548 = 1
inv : p1105 + p1109 + p1111 = 1
inv : p727 + p732 + p733 = 1
inv : p632 + p637 = 1
inv : p1514 + p1515 = 1
inv : p955 + p957 = 1
inv : p1335 + p1336 + p1343 + p1346 + p1347 = 1
inv : p389 + p394 = 1
inv : p875 + p888 + p891 + p892 = 1
inv : p118 + p121 + p122 = 1
inv : p265 + p270 + p271 = 1
inv : p639 + p641 + p644 + p647 + p649 = 1
inv : p304 + p305 = 1
inv : p639 + p641 + p644 + p650 + p653 + p654 = 1
inv : p573 + p578 + p579 = 1
inv : p875 + p895 + p900 + p901 = 1
inv : p419 + p424 + p425 = 1
inv : p972 + p975 + p976 = 1
Total of 218 invariants.
[2022-06-12 22:53:19] [INFO ] Computed 218 place invariants in 23 ms
[2022-06-12 22:53:20] [INFO ] Proved 544 variables to be positive in 958 ms
[2022-06-12 22:53:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-12 22:53:20] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=0 took 86 ms
[2022-06-12 22:53:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-12 22:53:21] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=1 took 160 ms
[2022-06-12 22:53:21] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=2 took 1853 ms
Compilation finished in 3848 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7192568438872635345]
Link finished in 178 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPtPT020BReachabilityFireability14==true], workingDir=/tmp/ltsmin7192568438872635345]
[2022-06-12 22:53:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-12 22:53:24] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=2 took 3618 ms
[2022-06-12 22:55:43] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=3 took 141678 ms
[2022-06-12 22:55:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-12 22:55:52] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=3 took 147758 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9.34613e+09 after 3.54257e+43
[2022-06-12 23:04:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-12 23:04:11] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=4 took 498582 ms
[2022-06-12 23:08:46] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=4 took 783207 ms
[2022-06-12 23:10:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-12 23:10:12] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=5 took 361670 ms
Detected timeout of ITS tools.
[2022-06-12 23:15:57] [INFO ] Applying decomposition
[2022-06-12 23:15:57] [INFO ] Flatten gal took : 65 ms
[2022-06-12 23:15:57] [INFO ] Decomposing Gal with order
[2022-06-12 23:15:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:15:57] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-12 23:15:57] [INFO ] Flatten gal took : 103 ms
[2022-06-12 23:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 5 ms.
[2022-06-12 23:15:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15508442063734109030.gal : 5 ms
[2022-06-12 23:15:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7834287162050270152.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/ReachabilityFireability15508442063734109030.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability7834287162050270152.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/ReachabilityFireability15508442063734109030.gal -t CGAL -reachable-file /tmp/ReachabilityFireability7834287162050270152.prop --nowitness
Loading property file /tmp/ReachabilityFireability7834287162050270152.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 960
[2022-06-12 23:22:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-12 23:22:26] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=6 took 733802 ms
Detected timeout of ITS tools.
[2022-06-12 23:38:35] [INFO ] Flatten gal took : 49 ms
[2022-06-12 23:38:35] [INFO ] Input system was already deterministic with 453 transitions.
[2022-06-12 23:38:35] [INFO ] Transformed 544 places.
[2022-06-12 23:38:35] [INFO ] Transformed 453 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 23:38:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability558291852645026131.gal : 2 ms
[2022-06-12 23:38:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8833449896842495775.prop : 9 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/ReachabilityFireability558291852645026131.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability8833449896842495775.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability558291852645026131.gal -t CGAL -reachable-file /tmp/ReachabilityFireability8833449896842495775.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability8833449896842495775.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 33
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :33 after 41
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :41 after 114
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :114 after 1280
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1280 after 13440
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13440 after 185472
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185472 after 1.30147e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.30147e+08 after 5.98142e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.98142e+11 after 2.99357e+16
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.99357e+16 after 1.35931e+23
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.35931e+23 after 5.43049e+30

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-020B"
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 ShieldPPPt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037300240"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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