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.r211-tajo-159033477400391.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 itslola
Input is ShieldIIPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477400391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.0K May 14 01:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 01:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 18:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591303935237

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:52:17] [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, -timeout, 3600, -rebuildPNML]
[2020-06-04 20:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:52:17] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2020-06-04 20:52:18] [INFO ] Transformed 7003 places.
[2020-06-04 20:52:18] [INFO ] Transformed 6503 transitions.
[2020-06-04 20:52:18] [INFO ] Found NUPN structural information;
[2020-06-04 20:52:18] [INFO ] Parsed PT model containing 7003 places and 6503 transitions in 595 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 295 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 194 ms. (steps per millisecond=51 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1]
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 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 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6503 rows 7003 cols
[2020-06-04 20:52:19] [INFO ] Computed 901 place invariants in 174 ms
[2020-06-04 20:52:24] [INFO ] [Real]Absence check using 901 positive place invariants in 3878 ms returned sat
[2020-06-04 20:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:24] [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: Broken pipe (>= t1029 0)") while checking expression at index 0
[2020-06-04 20:52:29] [INFO ] [Real]Absence check using 901 positive place invariants in 4128 ms returned sat
[2020-06-04 20:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-06-04 20:52:33] [INFO ] [Real]Absence check using 901 positive place invariants in 3617 ms returned sat
[2020-06-04 20:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52: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: Broken pipe (>= t4103 0)") while checking expression at index 2
[2020-06-04 20:52:38] [INFO ] [Real]Absence check using 901 positive place invariants in 3451 ms returned sat
[2020-06-04 20:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:52:39] [INFO ] [Real]Absence check using state equation in 701 ms returned (error "Failed to check-sat")
[2020-06-04 20:52:43] [INFO ] [Real]Absence check using 901 positive place invariants in 2976 ms returned sat
[2020-06-04 20:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:44] [INFO ] [Real]Absence check using state equation in 1009 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 20:52:48] [INFO ] [Real]Absence check using 901 positive place invariants in 2971 ms returned sat
[2020-06-04 20:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:52:49] [INFO ] [Real]Absence check using state equation in 1130 ms returned (error "Failed to check-sat")
[2020-06-04 20:52:53] [INFO ] [Real]Absence check using 901 positive place invariants in 3199 ms returned sat
[2020-06-04 20:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:52:54] [INFO ] [Real]Absence check using state equation in 754 ms returned (error "Failed to check-sat")
[2020-06-04 20:52:58] [INFO ] [Real]Absence check using 901 positive place invariants in 2941 ms returned sat
[2020-06-04 20:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:52:59] [INFO ] [Real]Absence check using state equation in 910 ms returned unknown
[2020-06-04 20:53:03] [INFO ] [Real]Absence check using 901 positive place invariants in 3164 ms returned sat
[2020-06-04 20:53:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:53:04] [INFO ] [Real]Absence check using state equation in 843 ms returned (error "Failed to check-sat")
[2020-06-04 20:53:08] [INFO ] [Real]Absence check using 901 positive place invariants in 3054 ms returned sat
[2020-06-04 20:53:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:53:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:53:09] [INFO ] [Real]Absence check using state equation in 1181 ms returned (error "Failed to check-sat")
Support contains 59 out of 7003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Performed 1677 Post agglomeration using F-continuation condition.Transition count delta: 1677
Iterating post reduction 0 with 1677 rules applied. Total rules applied 1677 place count 7003 transition count 4826
Reduce places removed 1677 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1679 rules applied. Total rules applied 3356 place count 5326 transition count 4824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3357 place count 5325 transition count 4824
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 3357 place count 5325 transition count 4416
Deduced a syphon composed of 408 places in 22 ms
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 3 with 816 rules applied. Total rules applied 4173 place count 4917 transition count 4416
Symmetric choice reduction at 3 with 688 rule applications. Total rules 4861 place count 4917 transition count 4416
Deduced a syphon composed of 688 places in 158 ms
Reduce places removed 688 places and 688 transitions.
Iterating global reduction 3 with 1376 rules applied. Total rules applied 6237 place count 4229 transition count 3728
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 287 Pre rules applied. Total rules applied 6237 place count 4229 transition count 3441
Deduced a syphon composed of 287 places in 15 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 3 with 574 rules applied. Total rules applied 6811 place count 3942 transition count 3441
Performed 1662 Post agglomeration using F-continuation condition.Transition count delta: 1662
Deduced a syphon composed of 1662 places in 16 ms
Reduce places removed 1662 places and 0 transitions.
Iterating global reduction 3 with 3324 rules applied. Total rules applied 10135 place count 2280 transition count 1779
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10337 place count 2179 transition count 1841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10539 place count 2078 transition count 1907
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 88 places in 6 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 10715 place count 1990 transition count 1960
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10716 place count 1990 transition count 1959
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 10719 place count 1990 transition count 1956
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 10722 place count 1987 transition count 1956
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 5 with 99 rules applied. Total rules applied 10821 place count 1987 transition count 1956
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10822 place count 1986 transition count 1955
Applied a total of 10822 rules in 3855 ms. Remains 1986 /7003 variables (removed 5017) and now considering 1955/6503 (removed 4548) transitions.
Finished structural reductions, in 1 iterations. Remains : 1986/7003 places, 1955/6503 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 15016 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 501866 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 491619 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 486888 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 449119 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 503171 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 490325 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 468120 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 502974 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 477011 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1955 rows 1986 cols
[2020-06-04 20:54:13] [INFO ] Computed 901 place invariants in 6 ms
[2020-06-04 20:54:14] [INFO ] [Real]Absence check using 901 positive place invariants in 795 ms returned sat
[2020-06-04 20:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:54:21] [INFO ] [Real]Absence check using state equation in 7351 ms returned sat
[2020-06-04 20:54:22] [INFO ] State equation strengthened by 70 read => feed constraints.
[2020-06-04 20:54:22] [INFO ] [Real]Added 70 Read/Feed constraints in 56 ms returned sat
[2020-06-04 20:54:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:54:23] [INFO ] [Nat]Absence check using 901 positive place invariants in 715 ms returned sat
[2020-06-04 20:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:54:30] [INFO ] [Nat]Absence check using state equation in 7575 ms returned sat
[2020-06-04 20:54:30] [INFO ] [Nat]Added 70 Read/Feed constraints in 48 ms returned sat
[2020-06-04 20:54:31] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-06-04 20:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2020-06-04 20:54:31] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 180 ms.
[2020-06-04 20:54:51] [INFO ] Added : 605 causal constraints over 121 iterations in 20198 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 112 ms.
[2020-06-04 20:54:53] [INFO ] [Real]Absence check using 901 positive place invariants in 916 ms returned sat
[2020-06-04 20:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:55:01] [INFO ] [Real]Absence check using state equation in 8194 ms returned sat
[2020-06-04 20:55:01] [INFO ] [Real]Added 70 Read/Feed constraints in 47 ms returned sat
[2020-06-04 20:55:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:55:03] [INFO ] [Nat]Absence check using 901 positive place invariants in 987 ms returned sat
[2020-06-04 20:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:55:10] [INFO ] [Nat]Absence check using state equation in 7602 ms returned sat
[2020-06-04 20:55:10] [INFO ] [Nat]Added 70 Read/Feed constraints in 39 ms returned sat
[2020-06-04 20:55:10] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 137 ms.
[2020-06-04 20:55:30] [INFO ] Added : 605 causal constraints over 121 iterations in 20214 ms.(timeout) Result :sat
[2020-06-04 20:55:31] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-04 20:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
Attempting to minimize the solution found.
Minimization took 72 ms.
[2020-06-04 20:55:32] [INFO ] [Real]Absence check using 901 positive place invariants in 822 ms returned sat
[2020-06-04 20:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:55:39] [INFO ] [Real]Absence check using state equation in 7271 ms returned sat
[2020-06-04 20:55:40] [INFO ] [Real]Added 70 Read/Feed constraints in 34 ms returned sat
[2020-06-04 20:55:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:55:41] [INFO ] [Nat]Absence check using 901 positive place invariants in 868 ms returned sat
[2020-06-04 20:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:55:48] [INFO ] [Nat]Absence check using state equation in 7066 ms returned sat
[2020-06-04 20:55:48] [INFO ] [Nat]Added 70 Read/Feed constraints in 22 ms returned sat
[2020-06-04 20:55:48] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 113 ms.
[2020-06-04 20:56:08] [INFO ] Added : 680 causal constraints over 136 iterations in 20188 ms.(timeout) Result :sat
[2020-06-04 20:56:08] [INFO ] Deduced a trap composed of 8 places in 118 ms
[2020-06-04 20:56:09] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-04 20:56:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 649 ms
Attempting to minimize the solution found.
Minimization took 76 ms.
[2020-06-04 20:56:10] [INFO ] [Real]Absence check using 901 positive place invariants in 991 ms returned sat
[2020-06-04 20:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:56:17] [INFO ] [Real]Absence check using state equation in 7094 ms returned sat
[2020-06-04 20:56:17] [INFO ] [Real]Added 70 Read/Feed constraints in 42 ms returned sat
[2020-06-04 20:56:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:56:19] [INFO ] [Nat]Absence check using 901 positive place invariants in 909 ms returned sat
[2020-06-04 20:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:56:26] [INFO ] [Nat]Absence check using state equation in 7406 ms returned sat
[2020-06-04 20:56:26] [INFO ] [Nat]Added 70 Read/Feed constraints in 49 ms returned sat
[2020-06-04 20:56:26] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 109 ms.
[2020-06-04 20:56:46] [INFO ] Added : 655 causal constraints over 131 iterations in 20103 ms.(timeout) Result :sat
[2020-06-04 20:56:47] [INFO ] Deduced a trap composed of 6 places in 226 ms
[2020-06-04 20:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
Attempting to minimize the solution found.
Minimization took 71 ms.
[2020-06-04 20:56:48] [INFO ] [Real]Absence check using 901 positive place invariants in 934 ms returned sat
[2020-06-04 20:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:56:56] [INFO ] [Real]Absence check using state equation in 7329 ms returned sat
[2020-06-04 20:56:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:56:57] [INFO ] [Nat]Absence check using 901 positive place invariants in 966 ms returned sat
[2020-06-04 20:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:57:05] [INFO ] [Nat]Absence check using state equation in 8187 ms returned sat
[2020-06-04 20:57:05] [INFO ] [Nat]Added 70 Read/Feed constraints in 26 ms returned sat
[2020-06-04 20:57:05] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 151 ms.
[2020-06-04 20:57:26] [INFO ] Added : 740 causal constraints over 148 iterations in 20347 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2020-06-04 20:57:27] [INFO ] [Real]Absence check using 901 positive place invariants in 947 ms returned sat
[2020-06-04 20:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:57:36] [INFO ] [Real]Absence check using state equation in 8397 ms returned sat
[2020-06-04 20:57:36] [INFO ] [Real]Added 70 Read/Feed constraints in 28 ms returned sat
[2020-06-04 20:57:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:57:37] [INFO ] [Nat]Absence check using 901 positive place invariants in 912 ms returned sat
[2020-06-04 20:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:57:45] [INFO ] [Nat]Absence check using state equation in 8177 ms returned sat
[2020-06-04 20:57:45] [INFO ] [Nat]Added 70 Read/Feed constraints in 35 ms returned sat
[2020-06-04 20:57:45] [INFO ] Deduced a trap composed of 5 places in 148 ms
[2020-06-04 20:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2020-06-04 20:57:45] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 105 ms.
[2020-06-04 20:58:05] [INFO ] Added : 605 causal constraints over 121 iterations in 20090 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2020-06-04 20:58:07] [INFO ] [Real]Absence check using 901 positive place invariants in 1024 ms returned sat
[2020-06-04 20:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:58:16] [INFO ] [Real]Absence check using state equation in 8676 ms returned sat
[2020-06-04 20:58:16] [INFO ] [Real]Added 70 Read/Feed constraints in 54 ms returned sat
[2020-06-04 20:58:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:58:17] [INFO ] [Nat]Absence check using 901 positive place invariants in 977 ms returned sat
[2020-06-04 20:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:58:25] [INFO ] [Nat]Absence check using state equation in 7575 ms returned sat
[2020-06-04 20:58:25] [INFO ] [Nat]Added 70 Read/Feed constraints in 26 ms returned sat
[2020-06-04 20:58:25] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2020-06-04 20:58:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2020-06-04 20:58:25] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 126 ms.
[2020-06-04 20:58:45] [INFO ] Added : 640 causal constraints over 128 iterations in 20146 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-04 20:58:47] [INFO ] [Real]Absence check using 901 positive place invariants in 979 ms returned sat
[2020-06-04 20:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:58:54] [INFO ] [Real]Absence check using state equation in 7256 ms returned sat
[2020-06-04 20:58:54] [INFO ] [Real]Added 70 Read/Feed constraints in 47 ms returned sat
[2020-06-04 20:58:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:58:55] [INFO ] [Nat]Absence check using 901 positive place invariants in 848 ms returned sat
[2020-06-04 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:59:03] [INFO ] [Nat]Absence check using state equation in 8131 ms returned sat
[2020-06-04 20:59:03] [INFO ] [Nat]Added 70 Read/Feed constraints in 28 ms returned sat
[2020-06-04 20:59:04] [INFO ] Computed and/alt/rep : 1931/3980/1931 causal constraints in 109 ms.
[2020-06-04 20:59:24] [INFO ] Added : 595 causal constraints over 119 iterations in 20119 ms.(timeout) Result :sat
[2020-06-04 20:59:24] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-06-04 20:59:24] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2020-06-04 20:59:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 635 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
Incomplete Parikh walk after 430600 steps, including 964 resets, run finished after 6373 ms. (steps per millisecond=67 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 339500 steps, including 672 resets, run finished after 4349 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 294300 steps, including 1000 resets, run finished after 3800 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 293000 steps, including 728 resets, run finished after 3805 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 295500 steps, including 745 resets, run finished after 3799 ms. (steps per millisecond=77 ) properties seen :[0, 0, 1, 0, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 289400 steps, including 781 resets, run finished after 3697 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 282000 steps, including 517 resets, run finished after 3597 ms. (steps per millisecond=78 ) properties seen :[0, 0, 1, 1] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 293800 steps, including 925 resets, run finished after 4201 ms. (steps per millisecond=69 ) properties seen :[0, 0] could not realise parikh vector
Support contains 15 out of 1986 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1986/1986 places, 1955/1955 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1986 transition count 1949
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1980 transition count 1949
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 12 place count 1980 transition count 1938
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 34 place count 1969 transition count 1938
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 82 place count 1945 transition count 1914
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 102 place count 1935 transition count 1923
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1934 transition count 1922
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 1932 transition count 1922
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 1932 transition count 1921
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 1931 transition count 1921
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 1930 transition count 1920
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 1929 transition count 1919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 1928 transition count 1918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 1927 transition count 1917
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 1926 transition count 1916
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 1925 transition count 1915
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 1924 transition count 1914
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 1923 transition count 1913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 1922 transition count 1912
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 1921 transition count 1911
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 1920 transition count 1910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 1919 transition count 1909
Applied a total of 119 rules in 880 ms. Remains 1919 /1986 variables (removed 67) and now considering 1909/1955 (removed 46) transitions.
Finished structural reductions, in 1 iterations. Remains : 1919/1986 places, 1909/1955 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13030 ms. (steps per millisecond=76 ) properties seen :[0, 0]
Interrupted Best-First random walk after 489564 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0]
Interrupted Best-First random walk after 511537 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 897805 steps, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen :[0, 0]
Probabilistic random walk after 897805 steps, saw 141493 distinct states, run finished after 30003 ms. (steps per millisecond=29 ) properties seen :[0, 0]
// Phase 1: matrix 1909 rows 1919 cols
[2020-06-04 21:00:52] [INFO ] Computed 899 place invariants in 6 ms
[2020-06-04 21:00:53] [INFO ] [Real]Absence check using 899 positive place invariants in 820 ms returned sat
[2020-06-04 21:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:01:00] [INFO ] [Real]Absence check using state equation in 6917 ms returned sat
[2020-06-04 21:01:00] [INFO ] State equation strengthened by 23 read => feed constraints.
[2020-06-04 21:01:00] [INFO ] [Real]Added 23 Read/Feed constraints in 40 ms returned sat
[2020-06-04 21:01:00] [INFO ] Computed and/alt/rep : 1898/3575/1898 causal constraints in 129 ms.
[2020-06-04 21:01:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 21:01:02] [INFO ] [Nat]Absence check using 899 positive place invariants in 868 ms returned sat
[2020-06-04 21:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 21:01:09] [INFO ] [Nat]Absence check using state equation in 6746 ms returned sat
[2020-06-04 21:01:09] [INFO ] [Nat]Added 23 Read/Feed constraints in 48 ms returned sat
[2020-06-04 21:01:09] [INFO ] Computed and/alt/rep : 1898/3575/1898 causal constraints in 147 ms.
[2020-06-04 21:01:29] [INFO ] Added : 595 causal constraints over 119 iterations in 20157 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 72 ms.
[2020-06-04 21:01:30] [INFO ] [Real]Absence check using 899 positive place invariants in 920 ms returned sat
[2020-06-04 21:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:01:38] [INFO ] [Real]Absence check using state equation in 7262 ms returned sat
[2020-06-04 21:01:38] [INFO ] [Real]Added 23 Read/Feed constraints in 25 ms returned sat
[2020-06-04 21:01:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 21:01:39] [INFO ] [Nat]Absence check using 899 positive place invariants in 706 ms returned sat
[2020-06-04 21:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 21:01:47] [INFO ] [Nat]Absence check using state equation in 8019 ms returned sat
[2020-06-04 21:01:47] [INFO ] [Nat]Added 23 Read/Feed constraints in 49 ms returned sat
[2020-06-04 21:01:47] [INFO ] Computed and/alt/rep : 1898/3575/1898 causal constraints in 143 ms.
[2020-06-04 21:02:07] [INFO ] Added : 610 causal constraints over 122 iterations in 20135 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 111 ms.
Incomplete Parikh walk after 287500 steps, including 982 resets, run finished after 4285 ms. (steps per millisecond=67 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 260000 steps, including 736 resets, run finished after 3332 ms. (steps per millisecond=78 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 1919 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1919/1919 places, 1909/1909 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1919 transition count 1907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1917 transition count 1907
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1917 transition count 1906
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1916 transition count 1906
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1913 transition count 1903
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 1911 transition count 1905
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 1911 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 1910 transition count 1904
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 1910 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 1909 transition count 1903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 1908 transition count 1902
Applied a total of 21 rules in 315 ms. Remains 1908 /1919 variables (removed 11) and now considering 1902/1909 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1908/1919 places, 1902/1909 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13061 ms. (steps per millisecond=76 ) properties seen :[0]
Interrupted Best-First random walk after 474408 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0]
Interrupted probabilistic random walk after 886170 steps, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen :[0]
Probabilistic random walk after 886170 steps, saw 143981 distinct states, run finished after 30002 ms. (steps per millisecond=29 ) properties seen :[0]
// Phase 1: matrix 1902 rows 1908 cols
[2020-06-04 21:03:03] [INFO ] Computed 899 place invariants in 17 ms
[2020-06-04 21:03:04] [INFO ] [Real]Absence check using 899 positive place invariants in 834 ms returned sat
[2020-06-04 21:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:03:11] [INFO ] [Real]Absence check using state equation in 6754 ms returned sat
[2020-06-04 21:03:11] [INFO ] State equation strengthened by 19 read => feed constraints.
[2020-06-04 21:03:11] [INFO ] [Real]Added 19 Read/Feed constraints in 28 ms returned sat
[2020-06-04 21:03:11] [INFO ] Deduced a trap composed of 3 places in 123 ms
[2020-06-04 21:03:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2020-06-04 21:03:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 21:03:13] [INFO ] [Nat]Absence check using 899 positive place invariants in 686 ms returned sat
[2020-06-04 21:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 21:03:20] [INFO ] [Nat]Absence check using state equation in 7251 ms returned sat
[2020-06-04 21:03:20] [INFO ] [Nat]Added 19 Read/Feed constraints in 48 ms returned sat
[2020-06-04 21:03:20] [INFO ] Deduced a trap composed of 3 places in 144 ms
[2020-06-04 21:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2020-06-04 21:03:20] [INFO ] Computed and/alt/rep : 1893/3528/1893 causal constraints in 101 ms.
[2020-06-04 21:03:40] [INFO ] Added : 870 causal constraints over 174 iterations in 20359 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 87 ms.
Incomplete Parikh walk after 266600 steps, including 1000 resets, run finished after 4163 ms. (steps per millisecond=64 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 1908 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1908/1908 places, 1902/1902 transitions.
Applied a total of 0 rules in 38 ms. Remains 1908 /1908 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1908/1908 places, 1902/1902 transitions.
Starting structural reductions, iteration 0 : 1908/1908 places, 1902/1902 transitions.
Applied a total of 0 rules in 38 ms. Remains 1908 /1908 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1908 cols
[2020-06-04 21:03:45] [INFO ] Computed 899 place invariants in 5 ms
[2020-06-04 21:03:54] [INFO ] Implicit Places using invariants in 8797 ms returned [1897]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8812 ms to find 1 implicit places.
[2020-06-04 21:03:54] [INFO ] Redundant transitions in 357 ms returned []
// Phase 1: matrix 1902 rows 1907 cols
[2020-06-04 21:03:54] [INFO ] Computed 898 place invariants in 6 ms
[2020-06-04 21:04:02] [INFO ] Dead Transitions using invariants and state equation in 8142 ms returned []
Starting structural reductions, iteration 1 : 1907/1908 places, 1902/1902 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1907 transition count 1902
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1906 transition count 1901
Applied a total of 3 rules in 82 ms. Remains 1906 /1907 variables (removed 1) and now considering 1901/1902 (removed 1) transitions.
// Phase 1: matrix 1901 rows 1906 cols
[2020-06-04 21:04:02] [INFO ] Computed 898 place invariants in 5 ms
[2020-06-04 21:04:12] [INFO ] Implicit Places using invariants in 9107 ms returned []
// Phase 1: matrix 1901 rows 1906 cols
[2020-06-04 21:04:12] [INFO ] Computed 898 place invariants in 30 ms
[2020-06-04 21:04:19] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-04 21:04:49] [INFO ] Performed 1875/1906 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-04 21:04:50] [INFO ] Implicit Places using invariants and state equation in 38168 ms returned []
Implicit Place search using SMT with State Equation took 47292 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1906/1908 places, 1901/1902 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12020 ms. (steps per millisecond=83 ) properties seen :[0]
Interrupted Best-First random walk after 538996 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen :[0]
Interrupted probabilistic random walk after 989706 steps, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :[0]
Probabilistic random walk after 989706 steps, saw 162093 distinct states, run finished after 30001 ms. (steps per millisecond=32 ) properties seen :[0]
// Phase 1: matrix 1901 rows 1906 cols
[2020-06-04 21:05:37] [INFO ] Computed 898 place invariants in 4 ms
[2020-06-04 21:05:38] [INFO ] [Real]Absence check using 898 positive place invariants in 1023 ms returned sat
[2020-06-04 21:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:05:45] [INFO ] [Real]Absence check using state equation in 6830 ms returned sat
[2020-06-04 21:05:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-04 21:05:45] [INFO ] [Real]Added 18 Read/Feed constraints in 41 ms returned sat
[2020-06-04 21:05:45] [INFO ] Computed and/alt/rep : 1892/3522/1892 causal constraints in 145 ms.
[2020-06-04 21:05:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 21:05:47] [INFO ] [Nat]Absence check using 898 positive place invariants in 960 ms returned sat
[2020-06-04 21:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 21:05:54] [INFO ] [Nat]Absence check using state equation in 7072 ms returned sat
[2020-06-04 21:05:54] [INFO ] [Nat]Added 18 Read/Feed constraints in 22 ms returned sat
[2020-06-04 21:05:54] [INFO ] Computed and/alt/rep : 1892/3522/1892 causal constraints in 141 ms.
[2020-06-04 21:06:14] [INFO ] Added : 855 causal constraints over 171 iterations in 20077 ms.(timeout) Result :sat
[2020-06-04 21:06:14] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-06-04 21:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
Attempting to minimize the solution found.
Minimization took 83 ms.
Incomplete Parikh walk after 303900 steps, including 1000 resets, run finished after 4321 ms. (steps per millisecond=70 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 1906 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1906/1906 places, 1901/1901 transitions.
Applied a total of 0 rules in 39 ms. Remains 1906 /1906 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1906/1906 places, 1901/1901 transitions.
Starting structural reductions, iteration 0 : 1906/1906 places, 1901/1901 transitions.
Applied a total of 0 rules in 37 ms. Remains 1906 /1906 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
// Phase 1: matrix 1901 rows 1906 cols
[2020-06-04 21:06:19] [INFO ] Computed 898 place invariants in 4 ms
[2020-06-04 21:06:29] [INFO ] Implicit Places using invariants in 9664 ms returned []
// Phase 1: matrix 1901 rows 1906 cols
[2020-06-04 21:06:29] [INFO ] Computed 898 place invariants in 9 ms
[2020-06-04 21:06:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-04 21:07:07] [INFO ] Performed 1768/1906 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-04 21:07:10] [INFO ] Implicit Places using invariants and state equation in 41006 ms returned []
Implicit Place search using SMT with State Equation took 50672 ms to find 0 implicit places.
[2020-06-04 21:07:10] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 1901 rows 1906 cols
[2020-06-04 21:07:10] [INFO ] Computed 898 place invariants in 8 ms
[2020-06-04 21:07:20] [INFO ] Dead Transitions using invariants and state equation in 10436 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1906/1906 places, 1901/1901 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1385 ms. (steps per millisecond=72 ) properties seen :[0]
// Phase 1: matrix 1901 rows 1906 cols
[2020-06-04 21:07:22] [INFO ] Computed 898 place invariants in 4 ms
[2020-06-04 21:07:23] [INFO ] [Real]Absence check using 898 positive place invariants in 818 ms returned sat
[2020-06-04 21:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:07:31] [INFO ] [Real]Absence check using state equation in 7787 ms returned sat
[2020-06-04 21:07:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-04 21:07:31] [INFO ] [Real]Added 18 Read/Feed constraints in 39 ms returned sat
[2020-06-04 21:07:31] [INFO ] Computed and/alt/rep : 1892/3522/1892 causal constraints in 121 ms.
[2020-06-04 21:07:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 21:07:32] [INFO ] [Nat]Absence check using 898 positive place invariants in 930 ms returned sat
[2020-06-04 21:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 21:07:40] [INFO ] [Nat]Absence check using state equation in 7845 ms returned sat
[2020-06-04 21:07:40] [INFO ] [Nat]Added 18 Read/Feed constraints in 17 ms returned sat
[2020-06-04 21:07:40] [INFO ] Computed and/alt/rep : 1892/3522/1892 causal constraints in 98 ms.
[2020-06-04 21:07:51] [INFO ] Added : 360 causal constraints over 72 iterations in 10897 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 209 times.
Drop transitions removed 209 transitions
Iterating global reduction 0 with 209 rules applied. Total rules applied 209 place count 1906 transition count 1901
Partial Post-agglomeration rule applied 282 times.
Drop transitions removed 282 transitions
Iterating global reduction 0 with 282 rules applied. Total rules applied 491 place count 1906 transition count 1901
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 493 place count 1906 transition count 1899
Applied a total of 493 rules in 309 ms. Remains 1906 /1906 variables (removed 0) and now considering 1899/1901 (removed 2) transitions.
// Phase 1: matrix 1899 rows 1906 cols
[2020-06-04 21:07:52] [INFO ] Computed 898 place invariants in 6 ms
[2020-06-04 21:07:53] [INFO ] [Real]Absence check using 898 positive place invariants in 1040 ms returned sat
[2020-06-04 21:07:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:08:01] [INFO ] [Real]Absence check using state equation in 8065 ms returned sat
[2020-06-04 21:08:01] [INFO ] State equation strengthened by 203 read => feed constraints.
[2020-06-04 21:08:01] [INFO ] [Real]Added 203 Read/Feed constraints in 69 ms returned sat
[2020-06-04 21:08:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 21:08:02] [INFO ] [Nat]Absence check using 898 positive place invariants in 907 ms returned sat
[2020-06-04 21:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 21:08:10] [INFO ] [Nat]Absence check using state equation in 8064 ms returned sat
[2020-06-04 21:08:11] [INFO ] [Nat]Added 203 Read/Feed constraints in 42 ms returned sat
[2020-06-04 21:08:11] [INFO ] Deduced a trap composed of 8 places in 37 ms
[2020-06-04 21:08:11] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-06-04 21:08:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2020-06-04 21:08:11] [INFO ] Computed and/alt/rep : 1890/4755/1890 causal constraints in 146 ms.
[2020-06-04 21:08:31] [INFO ] Added : 670 causal constraints over 134 iterations in 20106 ms.(timeout) Result :sat
[2020-06-04 21:08:31] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-06-04 21:08:31] [INFO ] Deduced a trap composed of 5 places in 53 ms
[2020-06-04 21:08:31] [INFO ] Deduced a trap composed of 6 places in 41 ms
[2020-06-04 21:08:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 720 ms
Attempting to minimize the solution found.
Minimization took 76 ms.
[2020-06-04 21:08:32] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-04 21:08:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
[2020-06-04 21:08:32] [INFO ] Flatten gal took : 279 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPt-PT-100B @ 3570 seconds

FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for ReachabilityFireability @ ShieldIIPt-PT-100B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 21:08:33 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 41504,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1081) AND (1 <= p1088) AND (1 <= p1091) AND (1 <= p1437) AND ((p384 <= 0) OR (p1391 <= 0)) AND ((p62 <= 0) OR (p766 <= 0)))))",
"processed_size": 141,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 9465,
"conflict_clusters": 612,
"places": 1906,
"places_significant": 1008,
"singleton_clusters": 0,
"transitions": 1901
},
"result":
{
"edges": 39,
"markings": 32,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3807/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 60992
lola: finding significant places
lola: 1906 places, 1901 transitions, 1008 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p1081 <= 1)
lola: LP says that atomic proposition is always true: (p1088 <= 1)
lola: LP says that atomic proposition is always true: (p1091 <= 1)
lola: LP says that atomic proposition is always true: (p1437 <= 1)
lola: LP says that atomic proposition is always true: (p384 <= 1)
lola: LP says that atomic proposition is always true: (p1391 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p766 <= 1)
lola: E (F (((1 <= p1081) AND (1 <= p1088) AND (1 <= p1091) AND (1 <= p1437) AND ((p384 <= 0) OR (p1391 <= 0)) AND ((p62 <= 0) OR (p766 <= 0)))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p1081) AND (1 <= p1088) AND (1 <= p1091) AND (1 <= p1437) AND ((p384 <= 0) OR (p1391 <= 0)) AND ((p62 <= 0) OR (p766 <= 0)))))
lola: processed formula length: 141
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1081) AND (1 <= p1088) AND (1 <= p1091) AND (1 <= p1437) AND ((p384 <= 0) OR (p1391 <= 0)) AND ((p62 <= 0) OR (p766 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: local time limit reached - aborting
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 32 markings, 39 edges
lola: memory consumption: 41504 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is ShieldIIPt-PT-100B, 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 r211-tajo-159033477400391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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