Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205100447.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 338K May 5 16:52 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 ShieldIIPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621104574526

Running Version 0
[2021-05-15 18:49:36] [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]
[2021-05-15 18:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 18:49:36] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2021-05-15 18:49:36] [INFO ] Transformed 1403 places.
[2021-05-15 18:49:36] [INFO ] Transformed 1303 transitions.
[2021-05-15 18:49:36] [INFO ] Found NUPN structural information;
[2021-05-15 18:49:36] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 16) seen :4
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2021-05-15 18:49:36] [INFO ] Computed 181 place invariants in 33 ms
[2021-05-15 18:49:37] [INFO ] [Real]Absence check using 181 positive place invariants in 65 ms returned sat
[2021-05-15 18:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:49:37] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2021-05-15 18:49:38] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 6 ms to minimize.
[2021-05-15 18:49:38] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 2 ms to minimize.
[2021-05-15 18:49:38] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 1 ms to minimize.
[2021-05-15 18:49:39] [INFO ] Deduced a trap composed of 19 places in 326 ms of which 1 ms to minimize.
[2021-05-15 18:49:39] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 2 ms to minimize.
[2021-05-15 18:49:39] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 1 ms to minimize.
[2021-05-15 18:49:40] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 1 ms to minimize.
[2021-05-15 18:49:40] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2021-05-15 18:49:40] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2021-05-15 18:49:41] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 2 ms to minimize.
[2021-05-15 18:49:41] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 1 ms to minimize.
[2021-05-15 18:49:41] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 0 ms to minimize.
[2021-05-15 18:49:41] [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
[2021-05-15 18:49:42] [INFO ] [Real]Absence check using 181 positive place invariants in 62 ms returned sat
[2021-05-15 18:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:49:42] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-15 18:49:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:49:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-15 18:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:49:43] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2021-05-15 18:49:43] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 1 ms to minimize.
[2021-05-15 18:49:44] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2021-05-15 18:49:44] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 1 ms to minimize.
[2021-05-15 18:49:44] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 0 ms to minimize.
[2021-05-15 18:49:45] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 1 ms to minimize.
[2021-05-15 18:49:45] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 1 ms to minimize.
[2021-05-15 18:49:45] [INFO ] Deduced a trap composed of 27 places in 377 ms of which 1 ms to minimize.
[2021-05-15 18:49:46] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 1 ms to minimize.
[2021-05-15 18:49:46] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 1 ms to minimize.
[2021-05-15 18:49:46] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 1 ms to minimize.
[2021-05-15 18:49:47] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 1 ms to minimize.
[2021-05-15 18:49:47] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 1 ms to minimize.
[2021-05-15 18:49:47] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 0 ms to minimize.
[2021-05-15 18:49:47] [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
[2021-05-15 18:49:48] [INFO ] [Real]Absence check using 181 positive place invariants in 69 ms returned sat
[2021-05-15 18:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:49:48] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2021-05-15 18:49:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:49:49] [INFO ] [Nat]Absence check using 181 positive place invariants in 65 ms returned sat
[2021-05-15 18:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:49:49] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2021-05-15 18:49:50] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2021-05-15 18:49:50] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 0 ms to minimize.
[2021-05-15 18:49:50] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 1 ms to minimize.
[2021-05-15 18:49:50] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 0 ms to minimize.
[2021-05-15 18:49:51] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 1 ms to minimize.
[2021-05-15 18:49:51] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2021-05-15 18:49:51] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 1 ms to minimize.
[2021-05-15 18:49:52] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 1 ms to minimize.
[2021-05-15 18:49:52] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2021-05-15 18:49:52] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 0 ms to minimize.
[2021-05-15 18:49:52] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 1 ms to minimize.
[2021-05-15 18:49:53] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2021-05-15 18:49:53] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 0 ms to minimize.
[2021-05-15 18:49:53] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2021-05-15 18:49:53] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2021-05-15 18:49:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 18:49:54] [INFO ] [Real]Absence check using 181 positive place invariants in 55 ms returned sat
[2021-05-15 18:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:49:54] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2021-05-15 18:49:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:49:54] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2021-05-15 18:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:49:55] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2021-05-15 18:49:55] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 1 ms to minimize.
[2021-05-15 18:49:56] [INFO ] Deduced a trap composed of 16 places in 374 ms of which 1 ms to minimize.
[2021-05-15 18:49:56] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 1 ms to minimize.
[2021-05-15 18:49:56] [INFO ] Deduced a trap composed of 25 places in 337 ms of which 1 ms to minimize.
[2021-05-15 18:49:57] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 1 ms to minimize.
[2021-05-15 18:49:57] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 1 ms to minimize.
[2021-05-15 18:49:58] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2021-05-15 18:49:58] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2021-05-15 18:49:58] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 1 ms to minimize.
[2021-05-15 18:49:59] [INFO ] Deduced a trap composed of 26 places in 315 ms of which 1 ms to minimize.
[2021-05-15 18:49:59] [INFO ] Deduced a trap composed of 30 places in 327 ms of which 2 ms to minimize.
[2021-05-15 18:50:00] [INFO ] Deduced a trap composed of 14 places in 539 ms of which 1 ms to minimize.
[2021-05-15 18:50: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 3
[2021-05-15 18:50:00] [INFO ] [Real]Absence check using 181 positive place invariants in 75 ms returned sat
[2021-05-15 18:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:01] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2021-05-15 18:50:01] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 1 ms to minimize.
[2021-05-15 18:50:01] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 0 ms to minimize.
[2021-05-15 18:50:02] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2021-05-15 18:50:02] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2021-05-15 18:50:02] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 3 ms to minimize.
[2021-05-15 18:50:02] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2021-05-15 18:50:03] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2021-05-15 18:50:03] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 0 ms to minimize.
[2021-05-15 18:50:03] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2021-05-15 18:50:04] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2021-05-15 18:50:04] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2021-05-15 18:50:04] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 1 ms to minimize.
[2021-05-15 18:50:04] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2021-05-15 18:50:05] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
[2021-05-15 18:50:05] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 0 ms to minimize.
[2021-05-15 18:50:05] [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
[2021-05-15 18:50:05] [INFO ] [Real]Absence check using 181 positive place invariants in 62 ms returned sat
[2021-05-15 18:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:06] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2021-05-15 18:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:50:06] [INFO ] [Nat]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-15 18:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:06] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2021-05-15 18:50:07] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 17 ms to minimize.
[2021-05-15 18:50:07] [INFO ] Deduced a trap composed of 19 places in 415 ms of which 9 ms to minimize.
[2021-05-15 18:50:08] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 1 ms to minimize.
[2021-05-15 18:50:08] [INFO ] Deduced a trap composed of 28 places in 406 ms of which 1 ms to minimize.
[2021-05-15 18:50:09] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 1 ms to minimize.
[2021-05-15 18:50:09] [INFO ] Deduced a trap composed of 27 places in 394 ms of which 1 ms to minimize.
[2021-05-15 18:50:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2734 ms
[2021-05-15 18:50:09] [INFO ] Computed and/alt/rep : 1302/1963/1302 causal constraints (skipped 0 transitions) in 95 ms.
[2021-05-15 18:50:11] [INFO ] Deduced a trap composed of 14 places in 519 ms of which 1 ms to minimize.
[2021-05-15 18:50: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 5
[2021-05-15 18:50:11] [INFO ] [Real]Absence check using 181 positive place invariants in 57 ms returned sat
[2021-05-15 18:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:12] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2021-05-15 18:50:12] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 1 ms to minimize.
[2021-05-15 18:50:13] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2021-05-15 18:50:13] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 1 ms to minimize.
[2021-05-15 18:50:13] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2021-05-15 18:50:14] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 1 ms to minimize.
[2021-05-15 18:50:14] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2021-05-15 18:50:14] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 0 ms to minimize.
[2021-05-15 18:50:15] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 1 ms to minimize.
[2021-05-15 18:50:15] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 0 ms to minimize.
[2021-05-15 18:50:15] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 1 ms to minimize.
[2021-05-15 18:50:16] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 1 ms to minimize.
[2021-05-15 18:50:16] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 1 ms to minimize.
[2021-05-15 18:50:16] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 1 ms to minimize.
1.0Real
^^^^^^^
(error "Invalid token: 1.0Real")
[2021-05-15 18:50:17] [INFO ] Deduced a trap composed of 14 places in 529 ms of which 1 ms to minimize.
[2021-05-15 18:50: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 6
[2021-05-15 18:50:17] [INFO ] [Real]Absence check using 181 positive place invariants in 63 ms returned sat
[2021-05-15 18:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:18] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2021-05-15 18:50:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:50:18] [INFO ] [Nat]Absence check using 181 positive place invariants in 64 ms returned sat
[2021-05-15 18:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:18] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2021-05-15 18:50:19] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 1 ms to minimize.
[2021-05-15 18:50:19] [INFO ] Deduced a trap composed of 20 places in 327 ms of which 1 ms to minimize.
[2021-05-15 18:50:19] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 1 ms to minimize.
[2021-05-15 18:50:20] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 1 ms to minimize.
[2021-05-15 18:50:20] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 1 ms to minimize.
[2021-05-15 18:50:20] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 1 ms to minimize.
[2021-05-15 18:50:21] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 1 ms to minimize.
[2021-05-15 18:50:21] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 1 ms to minimize.
[2021-05-15 18:50:21] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 1 ms to minimize.
[2021-05-15 18:50:22] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 1 ms to minimize.
[2021-05-15 18:50:22] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 4 ms to minimize.
[2021-05-15 18:50:22] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 1 ms to minimize.
[2021-05-15 18:50:23] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 1 ms to minimize.
[2021-05-15 18:50: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 7
[2021-05-15 18:50:23] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-15 18:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:23] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2021-05-15 18:50:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:50:24] [INFO ] [Nat]Absence check using 181 positive place invariants in 63 ms returned sat
[2021-05-15 18:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:25] [INFO ] [Nat]Absence check using state equation in 1607 ms returned sat
[2021-05-15 18:50:26] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 1 ms to minimize.
[2021-05-15 18:50:26] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 0 ms to minimize.
[2021-05-15 18:50:26] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 1 ms to minimize.
[2021-05-15 18:50:27] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
[2021-05-15 18:50:27] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 0 ms to minimize.
[2021-05-15 18:50:27] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2021-05-15 18:50:28] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 1 ms to minimize.
[2021-05-15 18:50:28] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2021-05-15 18:50:28] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 0 ms to minimize.
[2021-05-15 18:50:29] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 1 ms to minimize.
[2021-05-15 18:50:29] [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
[2021-05-15 18:50:29] [INFO ] [Real]Absence check using 181 positive place invariants in 59 ms returned sat
[2021-05-15 18:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:29] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2021-05-15 18:50:30] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 1 ms to minimize.
[2021-05-15 18:50:30] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 1 ms to minimize.
[2021-05-15 18:50:30] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 0 ms to minimize.
[2021-05-15 18:50:31] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 1 ms to minimize.
[2021-05-15 18:50:31] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2021-05-15 18:50:31] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 1 ms to minimize.
[2021-05-15 18:50:32] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 0 ms to minimize.
[2021-05-15 18:50:32] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 0 ms to minimize.
[2021-05-15 18:50:32] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 1 ms to minimize.
[2021-05-15 18:50:33] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 1 ms to minimize.
[2021-05-15 18:50:33] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 6 ms to minimize.
[2021-05-15 18:50:33] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 1 ms to minimize.
[2021-05-15 18:50:34] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 1 ms to minimize.
[2021-05-15 18:50:34] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 1 ms to minimize.
[2021-05-15 18:50:34] [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
[2021-05-15 18:50:34] [INFO ] [Real]Absence check using 181 positive place invariants in 62 ms returned sat
[2021-05-15 18:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:35] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-15 18:50:35] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2021-05-15 18:50:35] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2021-05-15 18:50:36] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 1 ms to minimize.
[2021-05-15 18:50:36] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 0 ms to minimize.
[2021-05-15 18:50:36] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 0 ms to minimize.
[2021-05-15 18:50:36] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 1 ms to minimize.
[2021-05-15 18:50:37] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 0 ms to minimize.
[2021-05-15 18:50:37] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2021-05-15 18:50:37] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 0 ms to minimize.
[2021-05-15 18:50:37] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2021-05-15 18:50:38] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 0 ms to minimize.
[2021-05-15 18:50:38] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2021-05-15 18:50:38] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2021-05-15 18:50:38] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 0 ms to minimize.
[2021-05-15 18:50:39] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 0 ms to minimize.
[2021-05-15 18:50:39] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 0 ms to minimize.
[2021-05-15 18:50:39] [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 10
[2021-05-15 18:50:39] [INFO ] [Real]Absence check using 181 positive place invariants in 59 ms returned sat
[2021-05-15 18:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:50:40] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2021-05-15 18:50:40] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 1 ms to minimize.
[2021-05-15 18:50:40] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 1 ms to minimize.
[2021-05-15 18:50:41] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 1 ms to minimize.
[2021-05-15 18:50:41] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2021-05-15 18:50:41] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 1 ms to minimize.
[2021-05-15 18:50:42] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 1 ms to minimize.
[2021-05-15 18:50:42] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 1 ms to minimize.
[2021-05-15 18:50:42] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2021-05-15 18:50:43] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2021-05-15 18:50:43] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 0 ms to minimize.
[2021-05-15 18:50:43] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 1 ms to minimize.
[2021-05-15 18:50:43] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2021-05-15 18:50:44] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 1 ms to minimize.
[2021-05-15 18:50:44] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2021-05-15 18:50:44] [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 11
Fused 12 Parikh solutions to 1 different solutions.
Support contains 50 out of 1403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 1403 transition count 993
Reduce places removed 310 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 312 rules applied. Total rules applied 622 place count 1093 transition count 991
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 632 place count 1092 transition count 982
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 641 place count 1083 transition count 982
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 641 place count 1083 transition count 899
Deduced a syphon composed of 83 places in 4 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 807 place count 1000 transition count 899
Discarding 130 places :
Symmetric choice reduction at 4 with 130 rule applications. Total rules 937 place count 870 transition count 769
Iterating global reduction 4 with 130 rules applied. Total rules applied 1067 place count 870 transition count 769
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1067 place count 870 transition count 720
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1165 place count 821 transition count 720
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 320
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 4 with 640 rules applied. Total rules applied 1805 place count 501 transition count 400
Renaming transitions due to excessive name length > 1024 char.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1907 place count 450 transition count 422
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1908 place count 450 transition count 421
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1911 place count 450 transition count 418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1914 place count 447 transition count 418
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 1932 place count 447 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1933 place count 446 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1935 place count 444 transition count 417
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1935 place count 444 transition count 416
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1937 place count 443 transition count 416
Applied a total of 1937 rules in 458 ms. Remains 443 /1403 variables (removed 960) and now considering 416/1303 (removed 887) transitions.
Finished structural reductions, in 1 iterations. Remains : 443/1403 places, 416/1303 transitions.
[2021-05-15 18:50:45] [INFO ] Flatten gal took : 79 ms
[2021-05-15 18:50:45] [INFO ] Flatten gal took : 39 ms
[2021-05-15 18:50:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10262652853764511482.gal : 22 ms
[2021-05-15 18:50:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1827308412319957169.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/ReachabilityCardinality10262652853764511482.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1827308412319957169.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/ReachabilityCardinality10262652853764511482.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1827308412319957169.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1827308412319957169.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :7 after 31
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :31 after 220
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :220 after 5836
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-03 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :7.55857e+06 after 1.70068e+07
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-10 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-08 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-01 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1.70068e+07 after 2.30528e+07
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :2.30528e+07 after 2.30535e+07
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2.30535e+07 after 2.30923e+07
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2.30923e+07 after 2.32622e+07
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :2.32622e+07 after 3.39398e+07
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3.39398e+07 after 9.3411e+08
Detected timeout of ITS tools.
[2021-05-15 18:51:00] [INFO ] Flatten gal took : 34 ms
[2021-05-15 18:51:00] [INFO ] Applying decomposition
[2021-05-15 18:51:00] [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/graph8919158316525652697.txt, -o, /tmp/graph8919158316525652697.bin, -w, /tmp/graph8919158316525652697.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/graph8919158316525652697.bin, -l, -1, -v, -w, /tmp/graph8919158316525652697.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:51:00] [INFO ] Decomposing Gal with order
[2021-05-15 18:51:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:51:00] [INFO ] Removed a total of 253 redundant transitions.
[2021-05-15 18:51:00] [INFO ] Flatten gal took : 86 ms
[2021-05-15 18:51:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 17 ms.
[2021-05-15 18:51:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1273021285943844963.gal : 9 ms
[2021-05-15 18:51:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5413804194741576746.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/ReachabilityCardinality1273021285943844963.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5413804194741576746.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/ReachabilityCardinality1273021285943844963.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5413804194741576746.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5413804194741576746.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3 after 17
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :29 after 209963
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-07 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-05 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-04 does not hold.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-02 does not hold.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1.81406e+08 after 3.79691e+21
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-14 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-13 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-09 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.79691e+21 after 1.83913e+35
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10546130113231001346
[2021-05-15 18:51:15] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10546130113231001346
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/ltsmin10546130113231001346]
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/ltsmin10546130113231001346] 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/ltsmin10546130113231001346] 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)
Finished random walk after 448448 steps, including 1 resets, run visited all 1 properties in 2508 ms. (steps per millisecond=178 )
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621104681078

--------------------
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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-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 r216-tall-162098205100447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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