fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477400390
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.210 3600000.00 300782.00 110.60 FFFTTFFTTFFTTFTF 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.r211-tajo-159033477400390.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477400390
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591303737808

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:48:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 20:48:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:48:59] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2020-06-04 20:48:59] [INFO ] Transformed 7003 places.
[2020-06-04 20:48:59] [INFO ] Transformed 6503 transitions.
[2020-06-04 20:48:59] [INFO ] Found NUPN structural information;
[2020-06-04 20:48:59] [INFO ] Parsed PT model containing 7003 places and 6503 transitions in 574 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 250 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 209 ms. (steps per millisecond=47 ) properties seen :[0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0]
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6503 rows 7003 cols
[2020-06-04 20:49:00] [INFO ] Computed 901 place invariants in 191 ms
[2020-06-04 20:49:05] [INFO ] [Real]Absence check using 901 positive place invariants in 3471 ms returned sat
[2020-06-04 20:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:05] [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 0
[2020-06-04 20:49:09] [INFO ] [Real]Absence check using 901 positive place invariants in 2806 ms returned sat
[2020-06-04 20:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:49:10] [INFO ] [Real]Absence check using state equation in 1183 ms returned (error "Failed to check-sat")
[2020-06-04 20:49:14] [INFO ] [Real]Absence check using 901 positive place invariants in 3145 ms returned sat
[2020-06-04 20:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:49:15] [INFO ] [Real]Absence check using state equation in 1145 ms returned (error "Failed to check-sat")
[2020-06-04 20:49:19] [INFO ] [Real]Absence check using 901 positive place invariants in 2902 ms returned sat
[2020-06-04 20:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:49:20] [INFO ] [Real]Absence check using state equation in 1050 ms returned (error "Failed to check-sat")
[2020-06-04 20:49:24] [INFO ] [Real]Absence check using 901 positive place invariants in 2701 ms returned sat
[2020-06-04 20:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:49:25] [INFO ] [Real]Absence check using state equation in 1283 ms returned (error "Failed to check-sat")
[2020-06-04 20:49:29] [INFO ] [Real]Absence check using 901 positive place invariants in 2813 ms returned sat
[2020-06-04 20:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:49:30] [INFO ] [Real]Absence check using state equation in 1214 ms returned (error "Failed to check-sat")
Support contains 21 out of 7003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Performed 1689 Post agglomeration using F-continuation condition.Transition count delta: 1689
Iterating post reduction 0 with 1689 rules applied. Total rules applied 1689 place count 7003 transition count 4814
Reduce places removed 1689 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 1691 rules applied. Total rules applied 3380 place count 5314 transition count 4812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3381 place count 5313 transition count 4812
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 3381 place count 5313 transition count 4410
Deduced a syphon composed of 402 places in 27 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 4185 place count 4911 transition count 4410
Symmetric choice reduction at 3 with 693 rule applications. Total rules 4878 place count 4911 transition count 4410
Deduced a syphon composed of 693 places in 86 ms
Reduce places removed 693 places and 693 transitions.
Iterating global reduction 3 with 1386 rules applied. Total rules applied 6264 place count 4218 transition count 3717
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 6264 place count 4218 transition count 3424
Deduced a syphon composed of 293 places in 14 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 6850 place count 3925 transition count 3424
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 9 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 10244 place count 2228 transition count 1727
Renaming transitions due to excessive name length > 1024 char.
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 10446 place count 2127 transition count 1793
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10648 place count 2026 transition count 1858
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 89 places in 6 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 10826 place count 1937 transition count 1913
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10827 place count 1937 transition count 1912
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 10831 place count 1937 transition count 1908
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 10835 place count 1933 transition count 1908
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 10935 place count 1933 transition count 1908
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10936 place count 1932 transition count 1907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 10938 place count 1930 transition count 1907
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 10938 place count 1930 transition count 1906
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 10940 place count 1929 transition count 1906
Applied a total of 10940 rules in 3195 ms. Remains 1929 /7003 variables (removed 5074) and now considering 1906/6503 (removed 4597) transitions.
Finished structural reductions, in 1 iterations. Remains : 1929/7003 places, 1906/6503 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 14325 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 559964 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 474736 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 535825 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 534540 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 511484 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1906 rows 1929 cols
[2020-06-04 20:50:13] [INFO ] Computed 899 place invariants in 6 ms
[2020-06-04 20:50:14] [INFO ] [Real]Absence check using 899 positive place invariants in 1055 ms returned sat
[2020-06-04 20:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:50:21] [INFO ] [Real]Absence check using state equation in 7092 ms returned sat
[2020-06-04 20:50:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:50:23] [INFO ] [Nat]Absence check using 899 positive place invariants in 868 ms returned sat
[2020-06-04 20:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:50:31] [INFO ] [Nat]Absence check using state equation in 7840 ms returned sat
[2020-06-04 20:50:31] [INFO ] State equation strengthened by 260 read => feed constraints.
[2020-06-04 20:50:31] [INFO ] [Nat]Added 260 Read/Feed constraints in 128 ms returned sat
[2020-06-04 20:50:31] [INFO ] Deduced a trap composed of 4 places in 251 ms
[2020-06-04 20:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2020-06-04 20:50:31] [INFO ] Computed and/alt/rep : 1898/5131/1898 causal constraints in 188 ms.
[2020-06-04 20:50:51] [INFO ] Added : 580 causal constraints over 116 iterations in 20132 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 86 ms.
[2020-06-04 20:50:53] [INFO ] [Real]Absence check using 899 positive place invariants in 926 ms returned sat
[2020-06-04 20:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:01] [INFO ] [Real]Absence check using state equation in 7800 ms returned sat
[2020-06-04 20:51:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:51:02] [INFO ] [Nat]Absence check using 899 positive place invariants in 971 ms returned sat
[2020-06-04 20:51:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:09] [INFO ] [Nat]Absence check using state equation in 6601 ms returned sat
[2020-06-04 20:51:09] [INFO ] [Nat]Added 260 Read/Feed constraints in 55 ms returned sat
[2020-06-04 20:51:09] [INFO ] Computed and/alt/rep : 1898/5131/1898 causal constraints in 152 ms.
[2020-06-04 20:51:29] [INFO ] Added : 540 causal constraints over 108 iterations in 20208 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 76 ms.
[2020-06-04 20:51:31] [INFO ] [Real]Absence check using 899 positive place invariants in 1021 ms returned sat
[2020-06-04 20:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:38] [INFO ] [Real]Absence check using state equation in 7177 ms returned sat
[2020-06-04 20:51:38] [INFO ] [Real]Added 260 Read/Feed constraints in 34 ms returned sat
[2020-06-04 20:51:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:51:39] [INFO ] [Nat]Absence check using 899 positive place invariants in 861 ms returned sat
[2020-06-04 20:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:46] [INFO ] [Nat]Absence check using state equation in 7255 ms returned sat
[2020-06-04 20:51:47] [INFO ] [Nat]Added 260 Read/Feed constraints in 82 ms returned sat
[2020-06-04 20:51:47] [INFO ] Computed and/alt/rep : 1898/5131/1898 causal constraints in 146 ms.
[2020-06-04 20:52:07] [INFO ] Added : 565 causal constraints over 113 iterations in 20104 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 93 ms.
[2020-06-04 20:52:08] [INFO ] [Real]Absence check using 899 positive place invariants in 859 ms returned sat
[2020-06-04 20:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:15] [INFO ] [Real]Absence check using state equation in 6861 ms returned sat
[2020-06-04 20:52:15] [INFO ] [Real]Added 260 Read/Feed constraints in 65 ms returned sat
[2020-06-04 20:52:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:52:16] [INFO ] [Nat]Absence check using 899 positive place invariants in 909 ms returned sat
[2020-06-04 20:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:24] [INFO ] [Nat]Absence check using state equation in 7928 ms returned sat
[2020-06-04 20:52:24] [INFO ] [Nat]Added 260 Read/Feed constraints in 59 ms returned sat
[2020-06-04 20:52:25] [INFO ] Computed and/alt/rep : 1898/5131/1898 causal constraints in 137 ms.
[2020-06-04 20:52:45] [INFO ] Added : 675 causal constraints over 135 iterations in 20144 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 93 ms.
[2020-06-04 20:52:46] [INFO ] [Real]Absence check using 899 positive place invariants in 926 ms returned sat
[2020-06-04 20:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:52:54] [INFO ] [Real]Absence check using state equation in 7771 ms returned sat
[2020-06-04 20:52:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:52:55] [INFO ] [Nat]Absence check using 899 positive place invariants in 791 ms returned sat
[2020-06-04 20:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:53:02] [INFO ] [Nat]Absence check using state equation in 7297 ms returned sat
[2020-06-04 20:53:02] [INFO ] [Nat]Added 260 Read/Feed constraints in 52 ms returned sat
[2020-06-04 20:53:02] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-06-04 20:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2020-06-04 20:53:03] [INFO ] Computed and/alt/rep : 1898/5131/1898 causal constraints in 91 ms.
[2020-06-04 20:53:23] [INFO ] Added : 595 causal constraints over 119 iterations in 20156 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
Finished Parikh walk after 111881 steps, including 698 resets, run visited all 5 properties in 1713 ms. (steps per millisecond=65 )
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

--------------------
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-159033477400390"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;