fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r216-tall-162098205600799
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldPPPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
750.144 95805.00 89842.00 17623.20 TTTTTTTFFTTTTFTT normal

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-162098205600799.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 ShieldPPPt-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-162098205600799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.2K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 376K 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 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 1621178754786

Running Version 0
[2021-05-16 15:26:06] [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-16 15:26:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:26:06] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2021-05-16 15:26:06] [INFO ] Transformed 1563 places.
[2021-05-16 15:26:06] [INFO ] Transformed 1423 transitions.
[2021-05-16 15:26:06] [INFO ] Found NUPN structural information;
[2021-05-16 15:26:06] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 399 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 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :10
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2021-05-16 15:26:06] [INFO ] Computed 221 place invariants in 32 ms
[2021-05-16 15:26:07] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2021-05-16 15:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:07] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2021-05-16 15:26:08] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 6 ms to minimize.
[2021-05-16 15:26:08] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 2 ms to minimize.
[2021-05-16 15:26:09] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 2 ms to minimize.
[2021-05-16 15:26:09] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 1 ms to minimize.
[2021-05-16 15:26:10] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 1 ms to minimize.
[2021-05-16 15:26:10] [INFO ] Deduced a trap composed of 26 places in 330 ms of which 0 ms to minimize.
[2021-05-16 15:26:10] [INFO ] Deduced a trap composed of 30 places in 337 ms of which 1 ms to minimize.
[2021-05-16 15:26:11] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 1 ms to minimize.
[2021-05-16 15:26:11] [INFO ] Deduced a trap composed of 29 places in 361 ms of which 1 ms to minimize.
[2021-05-16 15:26:12] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 1 ms to minimize.
[2021-05-16 15:26:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-16 15:26:12] [INFO ] [Real]Absence check using 221 positive place invariants in 71 ms returned sat
[2021-05-16 15:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:12] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2021-05-16 15:26:13] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2021-05-16 15:26:13] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2021-05-16 15:26:13] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 0 ms to minimize.
[2021-05-16 15:26:14] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 1 ms to minimize.
[2021-05-16 15:26:14] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 1 ms to minimize.
[2021-05-16 15:26:14] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 2 ms to minimize.
[2021-05-16 15:26:15] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 0 ms to minimize.
[2021-05-16 15:26:15] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 1 ms to minimize.
[2021-05-16 15:26:15] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 1 ms to minimize.
[2021-05-16 15:26:16] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 0 ms to minimize.
[2021-05-16 15:26:16] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 1 ms to minimize.
[2021-05-16 15:26:16] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 1 ms to minimize.
[2021-05-16 15:26:16] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 0 ms to minimize.
[2021-05-16 15:26:17] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 1 ms to minimize.
[2021-05-16 15:26: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 1
[2021-05-16 15:26:17] [INFO ] [Real]Absence check using 221 positive place invariants in 68 ms returned sat
[2021-05-16 15:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:18] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2021-05-16 15:26:18] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 1 ms to minimize.
[2021-05-16 15:26:18] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 1 ms to minimize.
[2021-05-16 15:26:19] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 1 ms to minimize.
[2021-05-16 15:26:19] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 1 ms to minimize.
[2021-05-16 15:26:19] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 0 ms to minimize.
[2021-05-16 15:26:20] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 1 ms to minimize.
[2021-05-16 15:26:20] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 0 ms to minimize.
[2021-05-16 15:26:20] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 1 ms to minimize.
[2021-05-16 15:26:21] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 5 ms to minimize.
[2021-05-16 15:26:21] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 4 ms to minimize.
[2021-05-16 15:26:21] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 1 ms to minimize.
[2021-05-16 15:26:22] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 1 ms to minimize.
[2021-05-16 15:26:22] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 1 ms to minimize.
[2021-05-16 15:26:22] [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-16 15:26:22] [INFO ] [Real]Absence check using 221 positive place invariants in 81 ms returned sat
[2021-05-16 15:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:23] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2021-05-16 15:26:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:26:23] [INFO ] [Nat]Absence check using 221 positive place invariants in 73 ms returned sat
[2021-05-16 15:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:24] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2021-05-16 15:26:24] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 1 ms to minimize.
[2021-05-16 15:26:25] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2021-05-16 15:26:25] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 1 ms to minimize.
[2021-05-16 15:26:25] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 1 ms to minimize.
[2021-05-16 15:26:25] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 1 ms to minimize.
[2021-05-16 15:26:26] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 0 ms to minimize.
[2021-05-16 15:26:26] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2021-05-16 15:26:26] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 1 ms to minimize.
[2021-05-16 15:26:27] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 0 ms to minimize.
[2021-05-16 15:26:27] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2021-05-16 15:26:27] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 1 ms to minimize.
[2021-05-16 15:26:28] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 0 ms to minimize.
[2021-05-16 15:26:28] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 0 ms to minimize.
[2021-05-16 15:26:28] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 1 ms to minimize.
[2021-05-16 15:26:28] [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-16 15:26:28] [INFO ] [Real]Absence check using 221 positive place invariants in 73 ms returned sat
[2021-05-16 15:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:29] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2021-05-16 15:26:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:26:29] [INFO ] [Nat]Absence check using 221 positive place invariants in 67 ms returned sat
[2021-05-16 15:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:30] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2021-05-16 15:26:30] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 1 ms to minimize.
[2021-05-16 15:26:30] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 1 ms to minimize.
[2021-05-16 15:26:31] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 1 ms to minimize.
[2021-05-16 15:26:31] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2021-05-16 15:26:31] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 7 ms to minimize.
[2021-05-16 15:26:31] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 0 ms to minimize.
[2021-05-16 15:26:32] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 1 ms to minimize.
[2021-05-16 15:26:32] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2021-05-16 15:26:32] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2021-05-16 15:26:33] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 0 ms to minimize.
[2021-05-16 15:26:33] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 0 ms to minimize.
[2021-05-16 15:26:33] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 0 ms to minimize.
[2021-05-16 15:26:33] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 1 ms to minimize.
[2021-05-16 15:26:33] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2021-05-16 15:26:34] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2021-05-16 15:26:34] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2021-05-16 15:26:34] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2021-05-16 15:26: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 4
[2021-05-16 15:26:34] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2021-05-16 15:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:26:35] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2021-05-16 15:26:35] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 1 ms to minimize.
[2021-05-16 15:26:36] [INFO ] Deduced a trap composed of 23 places in 325 ms of which 1 ms to minimize.
[2021-05-16 15:26:36] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 1 ms to minimize.
[2021-05-16 15:26:36] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 1 ms to minimize.
[2021-05-16 15:26:37] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 1 ms to minimize.
[2021-05-16 15:26:37] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 0 ms to minimize.
[2021-05-16 15:26:38] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 1 ms to minimize.
[2021-05-16 15:26:38] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 1 ms to minimize.
[2021-05-16 15:26:38] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 1 ms to minimize.
[2021-05-16 15:26:39] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 1 ms to minimize.
[2021-05-16 15:26:39] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 1 ms to minimize.
[2021-05-16 15:26:39] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 1 ms to minimize.
[2021-05-16 15:26:40] [INFO ] Deduced a trap composed of 14 places in 512 ms of which 1 ms to minimize.
[2021-05-16 15:26:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
Fused 6 Parikh solutions to 1 different solutions.
Support contains 38 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 1563 transition count 1076
Reduce places removed 347 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 349 rules applied. Total rules applied 696 place count 1216 transition count 1074
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 708 place count 1215 transition count 1063
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 719 place count 1204 transition count 1063
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 86 Pre rules applied. Total rules applied 719 place count 1204 transition count 977
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 891 place count 1118 transition count 977
Discarding 134 places :
Symmetric choice reduction at 4 with 134 rule applications. Total rules 1025 place count 984 transition count 843
Iterating global reduction 4 with 134 rules applied. Total rules applied 1159 place count 984 transition count 843
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1159 place count 984 transition count 788
Deduced a syphon composed of 55 places in 4 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1269 place count 929 transition count 788
Performed 325 Post agglomeration using F-continuation condition.Transition count delta: 325
Deduced a syphon composed of 325 places in 2 ms
Reduce places removed 325 places and 0 transitions.
Iterating global reduction 4 with 650 rules applied. Total rules applied 1919 place count 604 transition count 463
Renaming transitions due to excessive name length > 1024 char.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 2025 place count 551 transition count 463
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 2080 place count 551 transition count 463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2081 place count 550 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2082 place count 549 transition count 462
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2082 place count 549 transition count 460
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2086 place count 547 transition count 460
Applied a total of 2086 rules in 431 ms. Remains 547 /1563 variables (removed 1016) and now considering 460/1423 (removed 963) transitions.
Finished structural reductions, in 1 iterations. Remains : 547/1563 places, 460/1423 transitions.
[2021-05-16 15:26:40] [INFO ] Flatten gal took : 77 ms
[2021-05-16 15:26:40] [INFO ] Flatten gal took : 38 ms
[2021-05-16 15:26:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6761125109536083451.gal : 19 ms
[2021-05-16 15:26:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13680518530626003201.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/ReachabilityCardinality6761125109536083451.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13680518530626003201.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/ReachabilityCardinality6761125109536083451.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13680518530626003201.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13680518530626003201.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :27 after 108
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :108 after 324
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :324 after 5832
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-14 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :5832 after 359799
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :359799 after 363599
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :363599 after 529615
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :529615 after 2.97802e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2.97802e+06 after 2.91925e+07
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :2.91925e+07 after 6.39941e+09
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :6.39941e+09 after 1.0833e+13
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.0833e+13 after 1.3615e+17
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-09 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2021-05-16 15:26:55] [INFO ] Flatten gal took : 32 ms
[2021-05-16 15:26:55] [INFO ] Applying decomposition
[2021-05-16 15:26:55] [INFO ] Flatten gal took : 32 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/graph13118566082887731513.txt, -o, /tmp/graph13118566082887731513.bin, -w, /tmp/graph13118566082887731513.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/graph13118566082887731513.bin, -l, -1, -v, -w, /tmp/graph13118566082887731513.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:26:56] [INFO ] Decomposing Gal with order
[2021-05-16 15:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:26:56] [INFO ] Removed a total of 261 redundant transitions.
[2021-05-16 15:26:56] [INFO ] Flatten gal took : 89 ms
[2021-05-16 15:26:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 11 ms.
[2021-05-16 15:26:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5818263391898316103.gal : 9 ms
[2021-05-16 15:26:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14670005530281448185.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/ReachabilityCardinality5818263391898316103.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14670005530281448185.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/ReachabilityCardinality5818263391898316103.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14670005530281448185.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14670005530281448185.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 324
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2.86722e+10 after 3.58385e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8871895435900920188
[2021-05-16 15:27:11] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8871895435900920188
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/ltsmin8871895435900920188]
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/ltsmin8871895435900920188] 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/ltsmin8871895435900920188] 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 5437 ms. (steps per millisecond=183 ) properties (out of 4) seen :2
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2787 ms. (steps per millisecond=358 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2953 ms. (steps per millisecond=338 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 460 rows 547 cols
[2021-05-16 15:27:25] [INFO ] Computed 220 place invariants in 2 ms
[2021-05-16 15:27:25] [INFO ] [Real]Absence check using 220 positive place invariants in 32 ms returned sat
[2021-05-16 15:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:27:25] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-16 15:27:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:27:25] [INFO ] [Nat]Absence check using 220 positive place invariants in 34 ms returned sat
[2021-05-16 15:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:27:25] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-16 15:27:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-16 15:27:25] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:27:25] [INFO ] Computed and/alt/rep : 445/1098/445 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-16 15:27:29] [INFO ] Added : 414 causal constraints over 84 iterations in 3401 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
Finished Parikh walk after 10441 steps, including 32 resets, run visited all 1 properties in 75 ms. (steps per millisecond=139 )
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621178850591

--------------------
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="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 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 r216-tall-162098205600799"
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 ;