fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902545900247
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DES-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15757.770 134835.00 186117.00 185.50 TFFFFFTTFTFTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902545900247.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 DES-PT-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 2.8K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 43K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1589535564917

[2020-05-15 09:39:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 09:39:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 09:39:28] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2020-05-15 09:39:28] [INFO ] Transformed 155 places.
[2020-05-15 09:39:28] [INFO ] Transformed 112 transitions.
[2020-05-15 09:39:28] [INFO ] Found NUPN structural information;
[2020-05-15 09:39:28] [INFO ] Parsed PT model containing 155 places and 112 transitions in 195 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 215 resets, run finished after 184 ms. (steps per millisecond=54 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1]
FORMULA DES-PT-10a-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-10a-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 97 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 98 rows 155 cols
[2020-05-15 09:39:29] [INFO ] Computed 59 place invariants in 23 ms
[2020-05-15 09:39:29] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned unsat
[2020-05-15 09:39:29] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-05-15 09:39:29] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 32 ms returned sat
[2020-05-15 09:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:29] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2020-05-15 09:39:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-15 09:39:30] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 199 ms returned sat
[2020-05-15 09:39:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:30] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2020-05-15 09:39:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 09:39:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 09:39:30] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 27 ms.
[2020-05-15 09:39:31] [INFO ] Added : 90 causal constraints over 19 iterations in 679 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-15 09:39:31] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-05-15 09:39:31] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 19 ms returned sat
[2020-05-15 09:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:31] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2020-05-15 09:39:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-05-15 09:39:31] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 110 ms returned sat
[2020-05-15 09:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:32] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-15 09:39:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-05-15 09:39:32] [INFO ] Deduced a trap composed of 9 places in 58 ms
[2020-05-15 09:39:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2020-05-15 09:39:32] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 19 ms.
[2020-05-15 09:39:32] [INFO ] Added : 74 causal constraints over 16 iterations in 403 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-15 09:39:32] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-05-15 09:39:32] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 16 ms returned sat
[2020-05-15 09:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:32] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-05-15 09:39:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-05-15 09:39:33] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 112 ms returned sat
[2020-05-15 09:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:33] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-15 09:39:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 09:39:33] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 24 ms.
[2020-05-15 09:39:33] [INFO ] Added : 79 causal constraints over 16 iterations in 457 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-15 09:39:33] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-05-15 09:39:33] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2020-05-15 09:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:33] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2020-05-15 09:39:34] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-05-15 09:39:34] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 26 ms returned sat
[2020-05-15 09:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:34] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2020-05-15 09:39:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2020-05-15 09:39:34] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 93 ms returned sat
[2020-05-15 09:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:34] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2020-05-15 09:39:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 09:39:34] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 20 ms.
[2020-05-15 09:39:35] [INFO ] Added : 77 causal constraints over 16 iterations in 500 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-15 09:39:35] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-05-15 09:39:35] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2020-05-15 09:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:35] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2020-05-15 09:39:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 48 ms returned sat
[2020-05-15 09:39:36] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 206 ms returned sat
[2020-05-15 09:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:36] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-05-15 09:39:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 09:39:36] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 11 ms.
[2020-05-15 09:39:37] [INFO ] Added : 85 causal constraints over 18 iterations in 538 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-05-15 09:39:37] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-05-15 09:39:37] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 31 ms returned sat
[2020-05-15 09:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:37] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2020-05-15 09:39:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 48 ms returned sat
[2020-05-15 09:39:37] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 55 ms returned sat
[2020-05-15 09:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:38] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2020-05-15 09:39:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 09:39:38] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 11 ms.
[2020-05-15 09:39:38] [INFO ] Added : 86 causal constraints over 18 iterations in 550 ms. Result :sat
[2020-05-15 09:39:38] [INFO ] Deduced a trap composed of 13 places in 60 ms
[2020-05-15 09:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-15 09:39:38] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-05-15 09:39:38] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 28 ms returned sat
[2020-05-15 09:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:39] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-05-15 09:39:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2020-05-15 09:39:39] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 53 ms returned sat
[2020-05-15 09:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:39] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2020-05-15 09:39:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 09:39:39] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 18 ms.
[2020-05-15 09:39:40] [INFO ] Added : 85 causal constraints over 17 iterations in 455 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-05-15 09:39:40] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned unsat
FORMULA DES-PT-10a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-10a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-10a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 24700 steps, including 410 resets, run finished after 203 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 54400 steps, including 1026 resets, run finished after 285 ms. (steps per millisecond=190 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 32500 steps, including 328 resets, run finished after 144 ms. (steps per millisecond=225 ) properties seen :[0, 1, 1, 1, 1, 0, 0] could not realise parikh vector
FORMULA DES-PT-10a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-10a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-10a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-10a-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 27500 steps, including 443 resets, run finished after 123 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 33600 steps, including 598 resets, run finished after 149 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 22800 steps, including 338 resets, run finished after 104 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 43400 steps, including 1101 resets, run finished after 178 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 26 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 98/98 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 97
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 155 transition count 97
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 154 transition count 96
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 154 transition count 96
Applied a total of 7 rules in 97 ms. Remains 154 /155 variables (removed 1) and now considering 96/98 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/155 places, 96/98 transitions.
Incomplete random walk after 1000000 steps, including 18383 resets, run finished after 4380 ms. (steps per millisecond=228 ) properties seen :[1, 0, 0]
FORMULA DES-PT-10a-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 7121 resets, run finished after 2492 ms. (steps per millisecond=401 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3609 resets, run finished after 2745 ms. (steps per millisecond=364 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 154 cols
[2020-05-15 09:39:51] [INFO ] Computed 60 place invariants in 25 ms
[2020-05-15 09:39:51] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-05-15 09:39:51] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 22 ms returned sat
[2020-05-15 09:39:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:51] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-05-15 09:39:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 09:39:51] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 62 ms returned sat
[2020-05-15 09:39:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:52] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2020-05-15 09:39:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 09:39:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-05-15 09:39:52] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 20 ms.
[2020-05-15 09:39:52] [INFO ] Added : 93 causal constraints over 20 iterations in 530 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-05-15 09:39:52] [INFO ] [Real]Absence check using 34 positive place invariants in 61 ms returned sat
[2020-05-15 09:39:52] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 30 ms returned sat
[2020-05-15 09:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:53] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2020-05-15 09:39:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:39:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 09:39:53] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 32 ms returned sat
[2020-05-15 09:39:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:39:53] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2020-05-15 09:39:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-05-15 09:39:53] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 19 ms.
[2020-05-15 09:39:54] [INFO ] Added : 84 causal constraints over 17 iterations in 685 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 24200 steps, including 307 resets, run finished after 110 ms. (steps per millisecond=220 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 59200 steps, including 1065 resets, run finished after 227 ms. (steps per millisecond=260 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 154 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 12 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/154 places, 96/96 transitions.
Incomplete random walk after 1000000 steps, including 18460 resets, run finished after 3686 ms. (steps per millisecond=271 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7106 resets, run finished after 2240 ms. (steps per millisecond=446 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3529 resets, run finished after 2685 ms. (steps per millisecond=372 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9477825 steps, run timeout after 30001 ms. (steps per millisecond=315 ) properties seen :[0, 0]
Probabilistic random walk after 9477825 steps, saw 1134780 distinct states, run finished after 30003 ms. (steps per millisecond=315 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 154 cols
[2020-05-15 09:40:33] [INFO ] Computed 60 place invariants in 5 ms
[2020-05-15 09:40:33] [INFO ] [Real]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-05-15 09:40:33] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 35 ms returned sat
[2020-05-15 09:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:40:33] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-15 09:40:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:40:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 09:40:34] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 46 ms returned sat
[2020-05-15 09:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:40:34] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-05-15 09:40:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 09:40:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-05-15 09:40:34] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 10 ms.
[2020-05-15 09:40:34] [INFO ] Added : 93 causal constraints over 20 iterations in 516 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-05-15 09:40:35] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-05-15 09:40:35] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 30 ms returned sat
[2020-05-15 09:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:40:35] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-05-15 09:40:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:40:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 09:40:35] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 33 ms returned sat
[2020-05-15 09:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:40:35] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-15 09:40:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-05-15 09:40:35] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 19 ms.
[2020-05-15 09:40:36] [INFO ] Added : 84 causal constraints over 17 iterations in 578 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 24200 steps, including 302 resets, run finished after 116 ms. (steps per millisecond=208 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 59200 steps, including 1072 resets, run finished after 223 ms. (steps per millisecond=265 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 154 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 12 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/154 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 12 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 154 cols
[2020-05-15 09:40:36] [INFO ] Computed 60 place invariants in 5 ms
[2020-05-15 09:40:37] [INFO ] Implicit Places using invariants in 418 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 422 ms to find 1 implicit places.
[2020-05-15 09:40:37] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:40:37] [INFO ] Computed 59 place invariants in 4 ms
[2020-05-15 09:40:37] [INFO ] Dead Transitions using invariants and state equation in 310 ms returned []
Starting structural reductions, iteration 1 : 153/154 places, 96/96 transitions.
Applied a total of 0 rules in 15 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2020-05-15 09:40:37] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:40:37] [INFO ] Computed 59 place invariants in 5 ms
[2020-05-15 09:40:37] [INFO ] Dead Transitions using invariants and state equation in 251 ms returned []
Finished structural reductions, in 2 iterations. Remains : 153/154 places, 96/96 transitions.
Incomplete random walk after 1000000 steps, including 18434 resets, run finished after 3533 ms. (steps per millisecond=283 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7119 resets, run finished after 2270 ms. (steps per millisecond=440 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3536 resets, run finished after 2786 ms. (steps per millisecond=358 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9576210 steps, run timeout after 30001 ms. (steps per millisecond=319 ) properties seen :[0, 0]
Probabilistic random walk after 9576210 steps, saw 1145239 distinct states, run finished after 30001 ms. (steps per millisecond=319 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:16] [INFO ] Computed 59 place invariants in 3 ms
[2020-05-15 09:41:16] [INFO ] [Real]Absence check using 33 positive place invariants in 58 ms returned sat
[2020-05-15 09:41:16] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 73 ms returned sat
[2020-05-15 09:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:17] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2020-05-15 09:41:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:41:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 97 ms returned sat
[2020-05-15 09:41:17] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 99 ms returned sat
[2020-05-15 09:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:18] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2020-05-15 09:41:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 09:41:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 09:41:18] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 35 ms.
[2020-05-15 09:41:19] [INFO ] Added : 92 causal constraints over 19 iterations in 625 ms. Result :sat
[2020-05-15 09:41:19] [INFO ] Deduced a trap composed of 12 places in 542 ms
[2020-05-15 09:41:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
Attempting to minimize the solution found.
Minimization took 103 ms.
[2020-05-15 09:41:20] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2020-05-15 09:41:20] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 29 ms returned sat
[2020-05-15 09:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:20] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2020-05-15 09:41:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:41:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-15 09:41:20] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 115 ms returned sat
[2020-05-15 09:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:21] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2020-05-15 09:41:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-15 09:41:21] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 20 ms.
[2020-05-15 09:41:21] [INFO ] Added : 86 causal constraints over 18 iterations in 634 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 41100 steps, including 588 resets, run finished after 216 ms. (steps per millisecond=190 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 57000 steps, including 733 resets, run finished after 196 ms. (steps per millisecond=290 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 96/96 transitions.
Applied a total of 0 rules in 23 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 153/153 places, 96/96 transitions.
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:22] [INFO ] Computed 59 place invariants in 12 ms
[2020-05-15 09:41:23] [INFO ] Implicit Places using invariants in 749 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:23] [INFO ] Computed 59 place invariants in 5 ms
[2020-05-15 09:41:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 09:41:23] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2020-05-15 09:41:23] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:23] [INFO ] Computed 59 place invariants in 5 ms
[2020-05-15 09:41:24] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 96/96 transitions.
Incomplete random walk after 100000 steps, including 1854 resets, run finished after 404 ms. (steps per millisecond=247 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:24] [INFO ] Computed 59 place invariants in 3 ms
[2020-05-15 09:41:24] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2020-05-15 09:41:24] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 20 ms returned sat
[2020-05-15 09:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:24] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-05-15 09:41:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:41:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2020-05-15 09:41:25] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 48 ms returned sat
[2020-05-15 09:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:25] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-05-15 09:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 09:41:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 09:41:25] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 17 ms.
[2020-05-15 09:41:26] [INFO ] Added : 92 causal constraints over 19 iterations in 599 ms. Result :sat
[2020-05-15 09:41:26] [INFO ] Deduced a trap composed of 12 places in 55 ms
[2020-05-15 09:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2020-05-15 09:41:26] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2020-05-15 09:41:26] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 27 ms returned sat
[2020-05-15 09:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:26] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2020-05-15 09:41:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:41:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2020-05-15 09:41:27] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 92 ms returned sat
[2020-05-15 09:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:27] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2020-05-15 09:41:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-15 09:41:27] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 29 ms.
[2020-05-15 09:41:28] [INFO ] Added : 86 causal constraints over 18 iterations in 593 ms. Result :sat
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:28] [INFO ] Computed 59 place invariants in 4 ms
[2020-05-15 09:41:28] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2020-05-15 09:41:28] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 21 ms returned sat
[2020-05-15 09:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:28] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-05-15 09:41:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:41:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2020-05-15 09:41:28] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 55 ms returned sat
[2020-05-15 09:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:29] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2020-05-15 09:41:29] [INFO ] Computed and/alt/rep : 95/390/95 causal constraints in 17 ms.
[2020-05-15 09:41:29] [INFO ] Added : 92 causal constraints over 19 iterations in 658 ms. Result :sat
[2020-05-15 09:41:30] [INFO ] Deduced a trap composed of 13 places in 52 ms
[2020-05-15 09:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-15 09:41:30] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2020-05-15 09:41:30] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 54 ms returned sat
[2020-05-15 09:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:30] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-05-15 09:41:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:41:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 57 ms returned sat
[2020-05-15 09:41:30] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 108 ms returned sat
[2020-05-15 09:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:41:31] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2020-05-15 09:41:31] [INFO ] Computed and/alt/rep : 95/390/95 causal constraints in 47 ms.
[2020-05-15 09:41:32] [INFO ] Added : 88 causal constraints over 18 iterations in 611 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-05-15 09:41:32] [INFO ] Flatten gal took : 151 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 09:41:33] [INFO ] Applying decomposition
[2020-05-15 09:41:33] [INFO ] Flatten gal took : 33 ms
[2020-05-15 09:41:33] [INFO ] Flatten gal took : 93 ms
[2020-05-15 09:41:33] [INFO ] Input system was already deterministic with 96 transitions.
[2020-05-15 09:41:33] [INFO ] Input system was already deterministic with 96 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph13668394505732673011.txt, -o, /tmp/graph13668394505732673011.bin, -w, /tmp/graph13668394505732673011.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13668394505732673011.bin, -l, -1, -v, -w, /tmp/graph13668394505732673011.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 09:41:33] [INFO ] Ran tautology test, simplified 0 / 2 in 337 ms.
[2020-05-15 09:41:33] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-12(UNSAT) depth K=0 took 57 ms
[2020-05-15 09:41:33] [INFO ] Decomposing Gal with order
[2020-05-15 09:41:33] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-13(UNSAT) depth K=0 took 10 ms
[2020-05-15 09:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 09:41:33] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-12(UNSAT) depth K=1 took 10 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:33] [INFO ] Computed 59 place invariants in 3 ms
inv : p0 + p122 + p123 + p130 + p131 = 1
inv : p0 + p45 + p46 + p47 = 1
inv : p0 + p134 + p135 + p136 + p137 + p138 + p141 + p142 = 1
inv : p0 + p82 + p95 - p99 + p111 + p115 - p127 = 1
inv : p0 + p124 + p125 + p130 + p131 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p92 + p95 - p109 + p111 + p125 - p127 = 1
inv : p0 + p80 + p95 - p97 + p111 + p113 - p127 = 1
inv : p0 + p104 + p105 = 1
inv : -3*p0 - 20*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 + 20*p11 + 2*p12 + 4*p13 + 6*p14 + 8*p15 + 10*p16 + 12*p17 + 14*p18 + 16*p19 + 18*p20 + p73 + p75 + p79 + p135 + p139 + p141 + p142 - p144 - p145 - p149 - 2*p150 - p152 - p154 = -3
inv : p0 + p120 + p121 + p130 + p131 = 1
inv : p83 - p95 + p99 - p111 - p115 + p127 = 0
inv : p0 + p43 + p44 = 1
inv : p0 + p66 + p67 = 1
inv : p0 + p68 + p69 = 1
inv : p87 - p95 + p103 - p111 - p119 + p127 = 0
inv : p0 + p145 + p146 + p147 + p149 = 1
inv : p0 + p90 + p95 - p107 + p111 + p123 - p127 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p116 + p117 + p130 + p131 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p150 + p151 + p152 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p106 + p107 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p74 + p75 = 1
inv : p0 - 10*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 + 10*p31 + p32 + 2*p33 + 3*p34 + 4*p35 + 5*p36 + 6*p37 + 7*p38 + 8*p39 + 9*p40 + p47 + p49 - p54 + p61 + p62 + p68 + p73 - p129 + p131 + p133 - p134 - p138 - p142 = 1
inv : p0 + p126 + p127 + p130 + p131 = 1
inv : p85 - p95 + p101 - p111 - p117 + p127 = 0
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p110 + p111 = 1
inv : p0 + p100 + p101 = 1
inv : p0 + p70 + p71 = 1
inv : p0 + p112 + p113 + p130 + p131 = 1
inv : p58 + p59 - p60 - p61 = 0
inv : p0 + p72 + p73 = 1
inv : 10*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 - 10*p31 - p32 - 2*p33 - 3*p34 - 4*p35 - 5*p36 - 6*p37 - 7*p38 - 8*p39 - 9*p40 - p47 + p48 + p54 - p61 - p62 - p68 - p73 + p129 - p131 - p133 + p134 + p138 + p142 = 0
inv : p0 + p88 + p95 - p105 + p111 + p121 - p127 = 1
inv : p0 + p86 + p95 - p103 + p111 + p119 - p127 = 1
inv : -p141 - p142 + p143 + p144 = 0
inv : -20*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 + 10*p11 + p12 + 2*p13 + 3*p14 + 4*p15 + 5*p16 + 6*p17 + 7*p18 + 8*p19 + 9*p20 + 10*p31 + p32 + 2*p33 + 3*p34 + 4*p35 + 5*p36 + 6*p37 + 7*p38 + 8*p39 + 9*p40 + p47 + p51 - p54 + p61 + p62 + p68 + p73 + p75 + p79 - p129 + p131 + p133 + p135 + p137 + p141 - p145 - p150 - p152 = 0
inv : p89 - p95 + p105 - p111 - p121 + p127 = 0
inv : p0 + p108 + p109 = 1
inv : p0 + p98 + p99 = 1
inv : p0 + p150 + p153 + p154 = 1
inv : p0 + p78 + p79 = 1
inv : p93 - p95 + p109 - p111 - p125 + p127 = 0
inv : p0 + p102 + p103 = 1
inv : p81 - p95 + p97 - p111 - p113 + p127 = 0
inv : p0 + p118 + p119 + p130 + p131 = 1
inv : 3*p0 + 20*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 - 20*p11 - 2*p12 - 4*p13 - 6*p14 - 8*p15 - 10*p16 - 12*p17 - 14*p18 - 16*p19 - 18*p20 - p73 - p75 - p79 - p135 - p137 - p138 + p140 - p141 - p142 + p144 + p145 + p149 + 2*p150 + p152 + p154 = 3
inv : -2*p0 - 10*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 + 10*p11 + p12 + 2*p13 + 3*p14 + 4*p15 + 5*p16 + 6*p17 + 7*p18 + 8*p19 + 9*p20 + p73 + p77 + p95 + p111 - p127 - p130 + p133 + p135 + p137 + p141 - p150 - p152 = -2
inv : p0 + p114 + p115 + p130 + p131 = 1
inv : 3*p0 + 10*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 - 10*p11 - p12 - 2*p13 - 3*p14 - 4*p15 - 5*p16 - 6*p17 - 7*p18 - 8*p19 - 9*p20 - p73 + p76 - p95 - p111 + p127 + p130 - p133 - p135 - p137 - p141 + p150 + p152 = 3
inv : p91 - p95 + p107 - p111 - p123 + p127 = 0
inv : p0 + 20*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 - 10*p11 - p12 - 2*p13 - 3*p14 - 4*p15 - 5*p16 - 6*p17 - 7*p18 - 8*p19 - 9*p20 - 10*p31 - p32 - 2*p33 - 3*p34 - 4*p35 - 5*p36 - 6*p37 - 7*p38 - 8*p39 - 9*p40 - p47 + p50 + p54 - p61 - p62 - p68 - p73 - p75 - p79 + p129 - p131 - p133 - p135 - p137 - p141 + p145 + p150 + p152 = 1
inv : -p62 - p63 + p64 + p65 = 0
inv : p128 + p129 - p130 - p131 = 0
inv : p0 + p84 + p95 - p101 + p111 + p117 - p127 = 1
Total of 59 invariants.
[2020-05-15 09:41:33] [INFO ] Computed 59 place invariants in 13 ms
[2020-05-15 09:41:33] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-13(UNSAT) depth K=1 took 94 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 96 rows 153 cols
[2020-05-15 09:41:33] [INFO ] Computed 59 place invariants in 2 ms
inv : p0 + p122 + p123 + p130 + p131 = 1
inv : p0 + p45 + p46 + p47 = 1
inv : p0 + p134 + p135 + p136 + p137 + p138 + p141 + p142 = 1
inv : p0 + p82 + p95 - p99 + p111 + p115 - p127 = 1
inv : p0 + p124 + p125 + p130 + p131 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p92 + p95 - p109 + p111 + p125 - p127 = 1
inv : p0 + p80 + p95 - p97 + p111 + p113 - p127 = 1
inv : p0 + p104 + p105 = 1
inv : -3*p0 - 20*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 + 20*p11 + 2*p12 + 4*p13 + 6*p14 + 8*p15 + 10*p16 + 12*p17 + 14*p18 + 16*p19 + 18*p20 + p73 + p75 + p79 + p135 + p139 + p141 + p142 - p144 - p145 - p149 - 2*p150 - p152 - p154 = -3
inv : p0 + p120 + p121 + p130 + p131 = 1
inv : p83 - p95 + p99 - p111 - p115 + p127 = 0
inv : p0 + p43 + p44 = 1
inv : p0 + p66 + p67 = 1
inv : p0 + p68 + p69 = 1
inv : p87 - p95 + p103 - p111 - p119 + p127 = 0
inv : p0 + p145 + p146 + p147 + p149 = 1
inv : p0 + p90 + p95 - p107 + p111 + p123 - p127 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p116 + p117 + p130 + p131 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p150 + p151 + p152 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p106 + p107 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p74 + p75 = 1
inv : p0 - 10*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 + 10*p31 + p32 + 2*p33 + 3*p34 + 4*p35 + 5*p36 + 6*p37 + 7*p38 + 8*p39 + 9*p40 + p47 + p49 - p54 + p61 + p62 + p68 + p73 - p129 + p131 + p133 - p134 - p138 - p142 = 1
inv : p0 + p126 + p127 + p130 + p131 = 1
inv : p85 - p95 + p101 - p111 - p117 + p127 = 0
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p110 + p111 = 1
inv : p0 + p100 + p101 = 1
inv : p0 + p70 + p71 = 1
inv : p0 + p112 + p113 + p130 + p131 = 1
inv : p58 + p59 - p60 - p61 = 0
inv : p0 + p72 + p73 = 1
inv : 10*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 - 10*p31 - p32 - 2*p33 - 3*p34 - 4*p35 - 5*p36 - 6*p37 - 7*p38 - 8*p39 - 9*p40 - p47 + p48 + p54 - p61 - p62 - p68 - p73 + p129 - p131 - p133 + p134 + p138 + p142 = 0
inv : p0 + p88 + p95 - p105 + p111 + p121 - p127 = 1
inv : p0 + p86 + p95 - p103 + p111 + p119 - p127 = 1
inv : -p141 - p142 + p143 + p144 = 0
inv : -20*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 + 10*p11 + p12 + 2*p13 + 3*p14 + 4*p15 + 5*p16 + 6*p17 + 7*p18 + 8*p19 + 9*p20 + 10*p31 + p32 + 2*p33 + 3*p34 + 4*p35 + 5*p36 + 6*p37 + 7*p38 + 8*p39 + 9*p40 + p47 + p51 - p54 + p61 + p62 + p68 + p73 + p75 + p79 - p129 + p131 + p133 + p135 + p137 + p141 - p145 - p150 - p152 = 0
inv : p89 - p95 + p105 - p111 - p121 + p127 = 0
inv : p0 + p108 + p109 = 1
inv : p0 + p98 + p99 = 1
inv : p0 + p150 + p153 + p154 = 1
inv : p0 + p78 + p79 = 1
inv : p93 - p95 + p109 - p111 - p125 + p127 = 0
inv : p0 + p102 + p103 = 1
inv : p81 - p95 + p97 - p111 - p113 + p127 = 0
inv : p0 + p118 + p119 + p130 + p131 = 1
inv : 3*p0 + 20*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 - 20*p11 - 2*p12 - 4*p13 - 6*p14 - 8*p15 - 10*p16 - 12*p17 - 14*p18 - 16*p19 - 18*p20 - p73 - p75 - p79 - p135 - p137 - p138 + p140 - p141 - p142 + p144 + p145 + p149 + 2*p150 + p152 + p154 = 3
inv : -2*p0 - 10*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 + 10*p11 + p12 + 2*p13 + 3*p14 + 4*p15 + 5*p16 + 6*p17 + 7*p18 + 8*p19 + 9*p20 + p73 + p77 + p95 + p111 - p127 - p130 + p133 + p135 + p137 + p141 - p150 - p152 = -2
inv : p0 + p114 + p115 + p130 + p131 = 1
inv : 3*p0 + 10*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 - 10*p11 - p12 - 2*p13 - 3*p14 - 4*p15 - 5*p16 - 6*p17 - 7*p18 - 8*p19 - 9*p20 - p73 + p76 - p95 - p111 + p127 + p130 - p133 - p135 - p137 - p141 + p150 + p152 = 3
inv : p91 - p95 + p107 - p111 - p123 + p127 = 0
inv : p0 + 20*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 - 10*p11 - p12 - 2*p13 - 3*p14 - 4*p15 - 5*p16 - 6*p17 - 7*p18 - 8*p19 - 9*p20 - 10*p31 - p32 - 2*p33 - 3*p34 - 4*p35 - 5*p36 - 6*p37 - 7*p38 - 8*p39 - 9*p40 - p47 + p50 + p54 - p61 - p62 - p68 - p73 - p75 - p79 + p129 - p131 - p133 - p135 - p137 - p141 + p145 + p150 + p152 = 1
inv : -p62 - p63 + p64 + p65 = 0
inv : p128 + p129 - p130 - p131 = 0
inv : p0 + p84 + p95 - p101 + p111 + p117 - p127 = 1
Total of 59 invariants.
[2020-05-15 09:41:33] [INFO ] Computed 59 place invariants in 18 ms
[2020-05-15 09:41:33] [INFO ] Removed a total of 20 redundant transitions.
[2020-05-15 09:41:33] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-12(UNSAT) depth K=2 took 122 ms
[2020-05-15 09:41:33] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-13(UNSAT) depth K=2 took 7 ms
[2020-05-15 09:41:33] [INFO ] Flatten gal took : 219 ms
[2020-05-15 09:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 32 ms.
[2020-05-15 09:41:33] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-12(UNSAT) depth K=3 took 123 ms
[2020-05-15 09:41:33] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 18 ms
[2020-05-15 09:41:34] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

[2020-05-15 09:41:34] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-13(UNSAT) depth K=3 took 110 ms
its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : DES-PT-10a-ReachabilityFireability-12 with value :((((i1.u2.p33==1)&&(i1.u2.p45==1))&&((i10.u30.p106!=1)||(i10.u38.p122!=1)))&&((((((i0.i1.u5.p53!=1)||(i0.i1.u8.p63!=1))||(i0.i1.u10.p65!=1))||(i0.i0.u0.p42!=1))||(i0.i1.u7.p59!=1))||(i0.i1.u9.p61!=1)))
Read [reachable] property : DES-PT-10a-ReachabilityFireability-13 with value :((((u14.p5==1)&&(u14.p73==1))&&(u14.p75==1))||((((((((((((i12.u4.p51==1)&&(i12.u46.p145==1))&&(i1.u2.p46==1))&&(i1.u12.p68==1))&&(i0.i1.u5.p53==1))&&(i0.i1.u8.p63==1))&&(i0.i1.u10.p65==1))&&(u14.p9==1))&&(u14.p73==1))&&(u14.p75==1))&&((i1.u2.p35!=1)||(i1.u2.p45!=1)))&&((u13.p21!=1)||(u13.p70!=1))))
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
built 26 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-15 09:41:34] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-12(UNSAT) depth K=4 took 498 ms
[2020-05-15 09:41:34] [INFO ] Proved 153 variables to be positive in 996 ms
[2020-05-15 09:41:34] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2020-05-15 09:41:34] [INFO ] Computation of disable matrix completed :0/96 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 09:41:34] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 09:41:34] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2020-05-15 09:41:34] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 2048
[2020-05-15 09:41:35] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-13(UNSAT) depth K=4 took 479 ms
SDD proceeding with computation, new max is 4096
[2020-05-15 09:41:35] [INFO ] Proved 153 variables to be positive in 1596 ms
[2020-05-15 09:41:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-10a-ReachabilityFireability-12
[2020-05-15 09:41:35] [INFO ] KInduction solution for property DES-PT-10a-ReachabilityFireability-12(SAT) depth K=0 took 23 ms
[2020-05-15 09:41:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-10a-ReachabilityFireability-13
[2020-05-15 09:41:35] [INFO ] KInduction solution for property DES-PT-10a-ReachabilityFireability-13(SAT) depth K=0 took 17 ms
[2020-05-15 09:41:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-10a-ReachabilityFireability-12
[2020-05-15 09:41:35] [INFO ] KInduction solution for property DES-PT-10a-ReachabilityFireability-12(SAT) depth K=1 took 50 ms
[2020-05-15 09:41:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-10a-ReachabilityFireability-13
[2020-05-15 09:41:35] [INFO ] KInduction solution for property DES-PT-10a-ReachabilityFireability-13(SAT) depth K=1 took 31 ms
[2020-05-15 09:41:36] [INFO ] Computing symmetric co enabling matrix : 96 transitions.
Reachability property DES-PT-10a-ReachabilityFireability-13 is true.
FORMULA DES-PT-10a-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 8192
[2020-05-15 09:41:36] [INFO ] BMC solution for property DES-PT-10a-ReachabilityFireability-12(UNSAT) depth K=5 took 1478 ms
[2020-05-15 09:41:37] [INFO ] Computation of co-enabling matrix(2/96) took 1802 ms. Total solver calls (SAT/UNSAT): 151(129/22)
[2020-05-15 09:41:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-10a-ReachabilityFireability-12
[2020-05-15 09:41:38] [INFO ] KInduction solution for property DES-PT-10a-ReachabilityFireability-12(SAT) depth K=2 took 2529 ms
Reachability property DES-PT-10a-ReachabilityFireability-12 is true.
FORMULA DES-PT-10a-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.79671e+11,4.42849,61596,4777,517,125382,2161,287,227033,142,6632,0
Total reachable state count : 579671002809

Verifying 2 reachability properties.
Reachability property DES-PT-10a-ReachabilityFireability-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-10a-ReachabilityFireability-12,36,4.46846,61344,60,58,125382,2161,345,227033,153,6632,210
Reachability property DES-PT-10a-ReachabilityFireability-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-10a-ReachabilityFireability-13,96,4.47782,61344,63,64,125382,2161,446,227033,181,6632,396
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-15 09:41:39] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 09:41:39] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-10a-ReachabilityFireability-12 SMT depth 6
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-15 09:41:39] [INFO ] During BMC, SMT solver timed out at depth 6
[2020-05-15 09:41:39] [INFO ] BMC solving timed out (3600000 secs) at depth 6
[2020-05-15 09:41:39] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 09:41:39] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-10a-ReachabilityFireability-12 K-induction depth 3
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-15 09:41:39] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
[2020-05-15 09:41:39] [WARNING] Script execution failed on command (assert (= (+ (* 3 (select s0 0)) (* 20 (select s0 1)) (* 2 (select s0 2)) (* 4 (select s0 3)) (* 6 (select s0 4)) (* 8 (select s0 5)) (* 10 (select s0 6)) (* 12 (select s0 7)) (* 14 (select s0 8)) (* 16 (select s0 9)) (* 18 (select s0 10)) (select s0 143) (select s0 144) (select s0 147) (* 2 (select s0 148)) (select s0 150) (select s0 152) -3) (+ (* 20 (select s0 11)) (* 2 (select s0 12)) (* 4 (select s0 13)) (* 6 (select s0 14)) (* 8 (select s0 15)) (* 10 (select s0 16)) (* 12 (select s0 17)) (* 14 (select s0 18)) (* 16 (select s0 19)) (* 18 (select s0 20)) (select s0 72) (select s0 74) (select s0 78) (select s0 134) (select s0 138) (select s0 140) (select s0 141)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= (+ (* 3 (select s0 0)) (* 20 (select s0 1)) (* 2 (select s0 2)) (* 4 (select s0 3)) (* 6 (select s0 4)) (* 8 (select s0 5)) (* 10 (select s0 6)) (* 12 (select s0 7)) (* 14 (select s0 8)) (* 16 (select s0 9)) (* 18 (select s0 10)) (select s0 143) (select s0 144) (select s0 147) (* 2 (select s0 148)) (select s0 150) (select s0 152) -3) (+ (* 20 (select s0 11)) (* 2 (select s0 12)) (* 4 (select s0 13)) (* 6 (select s0 14)) (* 8 (select s0 15)) (* 10 (select s0 16)) (* 12 (select s0 17)) (* 14 (select s0 18)) (* 16 (select s0 19)) (* 18 (select s0 20)) (select s0 72) (select s0 74) (select s0 78) (select s0 134) (select s0 138) (select s0 140) (select s0 141)))")
[(declare-fun s0 () (Array Int Int)), (assert (= (+ (* 3 (select s0 0)) (* 20 (select s0 1)) (* 2 (select s0 2)) (* 4 (select s0 3)) (* 6 (select s0 4)) (* 8 (select s0 5)) (* 10 (select s0 6)) (* 12 (select s0 7)) (* 14 (select s0 8)) (* 16 (select s0 9)) (* 18 (select s0 10)) (select s0 143) (select s0 144) (select s0 147) (* 2 (select s0 148)) (select s0 150) (select s0 152) -3) (+ (* 20 (select s0 11)) (* 2 (select s0 12)) (* 4 (select s0 13)) (* 6 (select s0 14)) (* 8 (select s0 15)) (* 10 (select s0 16)) (* 12 (select s0 17)) (* 14 (select s0 18)) (* 16 (select s0 19)) (* 18 (select s0 20)) (select s0 72) (select s0 74) (select s0 78) (select s0 134) (select s0 138) (select s0 140) (select s0 141)))), (assert (= 1 (+ (select s0 0) (select s0 73) (select s0 74)))), (assert (= (+ (* 10 (select s0 1)) (select s0 2) (* 2 (select s0 3)) (* 3 (select s0 4)) (* 4 (select s0 5)) (* 5 (select s0 6)) (* 6 (select s0 7)) (* 7 (select s0 8)) (* 8 (select s0 9)) (* 9 (select s0 10)) (select s0 53) (select s0 128) (select s0 133) (select s0 137) (select s0 141) 1) (+ (select s0 0) (* 10 (select s0 31)) (select s0 32) (* 2 (select s0 33)) (* 3 (select s0 34)) (* 4 (select s0 35)) (* 5 (select s0 36)) (* 6 (select s0 37)) (* 7 (select s0 38)) (* 8 (select s0 39)) (* 9 (select s0 40)) (select s0 47) (select s0 49) (select s0 60) (select s0 61) (select s0 67) (select s0 72) (select s0 130) (select s0 132)))), (assert (= 1 (+ (select s0 0) (select s0 71) (select s0 72)))), (assert (= (+ (* 10 (select s0 31)) (select s0 32) (* 2 (select s0 33)) (* 3 (select s0 34)) (* 4 (select s0 35)) (* 5 (select s0 36)) (* 6 (select s0 37)) (* 7 (select s0 38)) (* 8 (select s0 39)) (* 9 (select s0 40)) (select s0 47) (select s0 60) (select s0 61) (select s0 67) (select s0 72) (select s0 130) (select s0 132) 0) (+ (* 10 (select s0 1)) (select s0 2) (* 2 (select s0 3)) (* 3 (select s0 4)) (* 4 (select s0 5)) (* 5 (select s0 6)) (* 6 (select s0 7)) (* 7 (select s0 8)) (* 8 (select s0 9)) (* 9 (select s0 10)) (select s0 48) (select s0 53) (select s0 128) (select s0 133) (select s0 137) (select s0 141)))), (assert (= (+ (* 20 (select s0 1)) (* 2 (select s0 2)) (* 4 (select s0 3)) (* 6 (select s0 4)) (* 8 (select s0 5)) (* 10 (select s0 6)) (* 12 (select s0 7)) (* 14 (select s0 8)) (* 16 (select s0 9)) (* 18 (select s0 10)) (select s0 53) (select s0 128) (select s0 144) (select s0 148) (select s0 150) 0) (+ (* 10 (select s0 11)) (select s0 12) (* 2 (select s0 13)) (* 3 (select s0 14)) (* 4 (select s0 15)) (* 5 (select s0 16)) (* 6 (select s0 17)) (* 7 (select s0 18)) (* 8 (select s0 19)) (* 9 (select s0 20)) (* 10 (select s0 31)) (select s0 32) (* 2 (select s0 33)) (* 3 (select s0 34)) (* 4 (select s0 35)) (* 5 (select s0 36)) (* 6 (select s0 37)) (* 7 (select s0 38)) (* 8 (select s0 39)) (* 9 (select s0 40)) (select s0 47) (select s0 51) (select s0 60) (select s0 61) (select s0 67) (select s0 72) (select s0 74) (select s0 78) (select s0 130) (select s0 132) (select s0 134) (select s0 136) (select s0 140)))), (assert (= (+ (* 20 (select s0 11)) (* 2 (select s0 12)) (* 4 (select s0 13)) (* 6 (select s0 14)) (* 8 (select s0 15)) (* 10 (select s0 16)) (* 12 (select s0 17)) (* 14 (select s0 18)) (* 16 (select s0 19)) (* 18 (select s0 20)) (select s0 72) (select s0 74) (select s0 78) (select s0 134) (select s0 136) (select s0 137) (select s0 140) (select s0 141) 3) (+ (* 3 (select s0 0)) (* 20 (select s0 1)) (* 2 (select s0 2)) (* 4 (select s0 3)) (* 6 (select s0 4)) (* 8 (select s0 5)) (* 10 (select s0 6)) (* 12 (select s0 7)) (* 14 (select s0 8)) (* 16 (select s0 9)) (* 18 (select s0 10)) (select s0 139) (select s0 143) (select s0 144) (select s0 147) (* 2 (select s0 148)) (select s0 150) (select s0 152)))), (assert (= (+ (* 2 (select s0 0)) (* 10 (select s0 1)) (select s0 2) (* 2 (select s0 3)) (* 3 (select s0 4)) (* 4 (select s0 5)) (* 5 (select s0 6)) (* 6 (select s0 7)) (* 7 (select s0 8)) (* 8 (select s0 9)) (* 9 (select s0 10)) (select s0 126) (select s0 129) (select s0 148) (select s0 150) -2) (+ (* 10 (select s0 11)) (select s0 12) (* 2 (select s0 13)) (* 3 (select s0 14)) (* 4 (select s0 15)) (* 5 (select s0 16)) (* 6 (select s0 17)) (* 7 (select s0 18)) (* 8 (select s0 19)) (* 9 (select s0 20)) (select s0 72) (select s0 76) (select s0 94) (select s0 110) (select s0 132) (select s0 134) (select s0 136) (select s0 140)))), (assert (= (+ (* 10 (select s0 11)) (select s0 12) (* 2 (select s0 13)) (* 3 (select s0 14)) (* 4 (select s0 15)) (* 5 (select s0 16)) (* 6 (select s0 17)) (* 7 (select s0 18)) (* 8 (select s0 19)) (* 9 (select s0 20)) (select s0 72) (select s0 94) (select s0 110) (select s0 132) (select s0 134) (select s0 136) (select s0 140) 3) (+ (* 3 (select s0 0)) (* 10 (select s0 1)) (select s0 2) (* 2 (select s0 3)) (* 3 (select s0 4)) (* 4 (select s0 5)) (* 5 (select s0 6)) (* 6 (select s0 7)) (* 7 (select s0 8)) (* 8 (select s0 9)) (* 9 (select s0 10)) (select s0 75) (select s0 126) (select s0 129) (select s0 148) (select s0 150)))), (assert (= (+ (* 10 (select s0 11)) (select s0 12) (* 2 (select s0 13)) (* 3 (select s0 14)) (* 4 (select s0 15)) (* 5 (select s0 16)) (* 6 (select s0 17)) (* 7 (select s0 18)) (* 8 (select s0 19)) (* 9 (select s0 20)) (* 10 (select s0 31)) (select s0 32) (* 2 (select s0 33)) (* 3 (select s0 34)) (* 4 (select s0 35)) (* 5 (select s0 36)) (* 6 (select s0 37)) (* 7 (select s0 38)) (* 8 (select s0 39)) (* 9 (select s0 40)) (select s0 47) (select s0 60) (select s0 61) (select s0 67) (select s0 72) (select s0 74) (select s0 78) (select s0 130) (select s0 132) (select s0 134) (select s0 136) (select s0 140) 1) (+ (select s0 0) (* 20 (select s0 1)) (* 2 (select s0 2)) (* 4 (select s0 3)) (* 6 (select s0 4)) (* 8 (select s0 5)) (* 10 (select s0 6)) (* 12 (select s0 7)) (* 14 (select s0 8)) (* 16 (select s0 9)) (* 18 (select s0 10)) (select s0 50) (select s0 53) (select s0 128) (select s0 144) (select s0 148) (select s0 150)))), (assert (and (and (>= (select s0 2) 1) (>= (select s0 72) 1)) (>= (select s0 74) 1))), (assert (>= (select s0 0) 0)), (assert (>= (select s0 1) 0)), (assert (>= (select s0 2) 0)), (assert (>= (select s0 3) 0)), (assert (>= (select s0 4) 0)), (assert (>= (select s0 5) 0)), (assert (>= (select s0 6) 0)), (assert (>= (select s0 7) 0)), (assert (>= (select s0 8) 0)), (assert (>= (select s0 9) 0)), (assert (>= (select s0 10) 0)), (assert (>= (select s0 11) 0)), (assert (>= (select s0 12) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 14) 0)), (assert (>= (select s0 15) 0)), (assert (>= (select s0 16) 0)), (assert (>= (select s0 17) 0)), (assert (>= (select s0 18) 0)), (assert (>= (select s0 19) 0)), (assert (>= (select s0 20) 0)), (assert (>= (select s0 31) 0)), (assert (>= (select s0 32) 0)), (assert (>= (select s0 33) 0)), (assert (>= (select s0 34) 0)), (assert (>= (select s0 35) 0)), (assert (>= (select s0 36) 0)), (assert (>= (select s0 37) 0)), (assert (>= (select s0 38) 0)), (assert (>= (select s0 39) 0)), (assert (>= (select s0 40) 0)), (assert (>= (select s0 47) 0)), (assert (>= (select s0 48) 0)), (assert (>= (select s0 49) 0)), (assert (>= (select s0 50) 0)), (assert (>= (select s0 51) 0)), (assert (>= (select s0 53) 0)), (assert (>= (select s0 60) 0)), (assert (>= (select s0 61) 0)), (assert (>= (select s0 67) 0)), (assert (>= (select s0 71) 0)), (assert (>= (select s0 72) 0)), (assert (>= (select s0 73) 0)), (assert (>= (select s0 74) 0)), (assert (>= (select s0 75) 0)), (assert (>= (select s0 76) 0)), (assert (>= (select s0 78) 0)), (assert (>= (select s0 94) 0)), (assert (>= (select s0 110) 0)), (assert (>= (select s0 126) 0)), (assert (>= (select s0 128) 0)), (assert (>= (select s0 129) 0)), (assert (>= (select s0 130) 0)), (assert (>= (select s0 132) 0)), (assert (>= (select s0 133) 0)), (assert (>= (select s0 134) 0)), (assert (>= (select s0 136) 0)), (assert (>= (select s0 137) 0)), (assert (>= (select s0 138) 0)), (assert (>= (select s0 139) 0)), (assert (>= (select s0 140) 0)), (assert (>= (select s0 141) 0)), (assert (>= (select s0 143) 0)), (assert (>= (select s0 144) 0)), (assert (>= (select s0 147) 0)), (assert (>= (select s0 148) 0)), (assert (>= (select s0 150) 0)), (assert (>= (select s0 152) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@54e1f982
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@54e1f982
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 09:41:39] [INFO ] Built C files in 6227ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589535699752

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10a"
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"

# 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 DES-PT-10a, 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 r051-ebro-158902545900247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a 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 ;