About the Execution of ITS-LoLa for Philosophers-PT-010000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15798.890 | 3600000.00 | 1716164.00 | 7744.10 | ??FF?T???TFFTF?T | 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.r176-tajo-158987871500190.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 Philosophers-PT-010000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871500190
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172M
-rw-r--r-- 1 mcc users 2.8M Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0M Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0M Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 22M Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7M Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21M Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6M Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2M Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.1M Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 2.6M Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 42M Apr 27 15:14 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 Philosophers-PT-010000-ReachabilityCardinality-00
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-01
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-02
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-03
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-04
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-05
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-06
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-07
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-08
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-09
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-10
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-11
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-12
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-13
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-14
FORMULA_NAME Philosophers-PT-010000-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591133922144
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:38:43] [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-02 21:38:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:38:44] [INFO ] Load time of PNML (sax parser for PT used): 1043 ms
[2020-06-02 21:38:44] [INFO ] Transformed 50000 places.
[2020-06-02 21:38:45] [INFO ] Transformed 50000 transitions.
[2020-06-02 21:38:45] [INFO ] Parsed PT model containing 50000 places and 50000 transitions in 1273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 79905 ms.
Working with output stream class java.io.PrintStream
Interrupted random walk after 3273 steps, including 0 resets, run timeout after 30007 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0]
FORMULA Philosophers-PT-010000-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-010000-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-010000-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5374 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5244 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5160 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6146 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8647 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 6067 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6640 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2165 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2478 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2548 ms. (steps per millisecond=3 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2222 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2394 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3117 ms. (steps per millisecond=3 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 21:41:36] [INFO ] Computed 20000 place invariants in 3485 ms
[2020-06-02 21:41:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:41:41] [INFO ] [Real]Absence check using 20000 positive place invariants in 580 ms returned (error "Failed to check-sat")
[2020-06-02 21:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:41:42] [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-02 21:41:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:41:47] [INFO ] [Real]Absence check using 20000 positive place invariants in 1725 ms returned (error "Failed to check-sat")
[2020-06-02 21:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:41:47] [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-02 21:41:50] [INFO ] [Real]Absence check using 20000 positive place invariants in 220 ms returned unsat
[2020-06-02 21:41:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:41:55] [INFO ] [Real]Absence check using 20000 positive place invariants in 1534 ms returned (error "Failed to check-sat")
[2020-06-02 21:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:41:55] [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 3
[2020-06-02 21:41:59] [INFO ] [Real]Absence check using 20000 positive place invariants in 77 ms returned unsat
[2020-06-02 21:42:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:04] [INFO ] [Real]Absence check using 20000 positive place invariants in 1862 ms returned (error "Failed to check-sat")
[2020-06-02 21:42:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:42:04] [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 5
[2020-06-02 21:42:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:09] [INFO ] [Real]Absence check using 20000 positive place invariants in 480 ms returned (error "Failed to check-sat")
[2020-06-02 21:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:42:09] [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 6
[2020-06-02 21:42:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:14] [INFO ] [Real]Absence check using 20000 positive place invariants in 1364 ms returned (error "Failed to check-sat")
[2020-06-02 21:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:42:14] [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 7
[2020-06-02 21:42:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:19] [INFO ] [Real]Absence check using 20000 positive place invariants in 1367 ms returned (error "Failed to check-sat")
[2020-06-02 21:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:42:19] [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 8
[2020-06-02 21:42:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:24] [INFO ] [Real]Absence check using 20000 positive place invariants in 692 ms returned (error "Failed to check-sat")
[2020-06-02 21:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:42:24] [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 9
[2020-06-02 21:42:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:29] [INFO ] [Real]Absence check using 20000 positive place invariants in 1359 ms returned unknown
[2020-06-02 21:42:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:34] [INFO ] [Real]Absence check using 20000 positive place invariants in 1507 ms returned (error "Failed to check-sat")
[2020-06-02 21:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:42:35] [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 11
[2020-06-02 21:42:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:42:40] [INFO ] [Real]Absence check using 20000 positive place invariants in 628 ms returned (error "Failed to check-sat")
[2020-06-02 21:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:42:40] [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 12
FORMULA Philosophers-PT-010000-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-PT-010000-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 50000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 497 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Interrupted random walk after 4772 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5705 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5691 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6535 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5864 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7290 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 23002 steps, including 0 resets, run timeout after 5203 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5221 ms. (steps per millisecond=3 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5120 ms. (steps per millisecond=3 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 23002 steps, including 0 resets, run timeout after 5265 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA Philosophers-PT-010000-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 22002 steps, including 0 resets, run timeout after 5229 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 19001 steps, including 0 resets, run timeout after 5313 ms. (steps per millisecond=3 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 21:44:16] [INFO ] Computed 20000 place invariants in 3391 ms
[2020-06-02 21:44:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:44:35] [INFO ] [Real]Absence check using 20000 positive place invariants in 14886 ms returned unknown
[2020-06-02 21:44:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:44:54] [INFO ] [Real]Absence check using 20000 positive place invariants in 15289 ms returned unknown
[2020-06-02 21:45:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:45:13] [INFO ] [Real]Absence check using 20000 positive place invariants in 14381 ms returned unknown
[2020-06-02 21:45:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:45:32] [INFO ] [Real]Absence check using 20000 positive place invariants in 14818 ms returned unknown
[2020-06-02 21:45:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:45:50] [INFO ] [Real]Absence check using 20000 positive place invariants in 14239 ms returned unknown
[2020-06-02 21:46:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:46:07] [INFO ] [Real]Absence check using 20000 positive place invariants in 13739 ms returned unknown
[2020-06-02 21:46:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:46:25] [INFO ] [Real]Absence check using 20000 positive place invariants in 13755 ms returned unknown
[2020-06-02 21:46:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:46:42] [INFO ] [Real]Absence check using 20000 positive place invariants in 13999 ms returned unknown
[2020-06-02 21:46:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:47:01] [INFO ] [Real]Absence check using 20000 positive place invariants in 14172 ms returned unknown
[2020-06-02 21:47:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:47:19] [INFO ] [Real]Absence check using 20000 positive place invariants in 14055 ms returned unknown
Support contains 50000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 400 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Interrupted random walk after 4655 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA Philosophers-PT-010000-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5935 ms. (steps per millisecond=1 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5256 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6869 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5417 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7247 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5077 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5149 ms. (steps per millisecond=3 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 22002 steps, including 0 resets, run timeout after 5024 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5168 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 21:48:44] [INFO ] Computed 20000 place invariants in 3391 ms
[2020-06-02 21:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:49:03] [INFO ] [Real]Absence check using 20000 positive place invariants in 15290 ms returned unknown
[2020-06-02 21:49:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:49:22] [INFO ] [Real]Absence check using 20000 positive place invariants in 14976 ms returned unknown
[2020-06-02 21:49:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:49:42] [INFO ] [Real]Absence check using 20000 positive place invariants in 15521 ms returned unknown
[2020-06-02 21:49:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:50:00] [INFO ] [Real]Absence check using 20000 positive place invariants in 14638 ms returned unknown
[2020-06-02 21:50:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:50:18] [INFO ] [Real]Absence check using 20000 positive place invariants in 14397 ms returned unknown
[2020-06-02 21:50:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:50:35] [INFO ] [Real]Absence check using 20000 positive place invariants in 13764 ms returned unknown
[2020-06-02 21:50:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:50:52] [INFO ] [Real]Absence check using 20000 positive place invariants in 14046 ms returned unknown
[2020-06-02 21:51:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:51:10] [INFO ] [Real]Absence check using 20000 positive place invariants in 13903 ms returned unknown
[2020-06-02 21:51:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:51:28] [INFO ] [Real]Absence check using 20000 positive place invariants in 14016 ms returned unknown
Support contains 50000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 381 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Interrupted random walk after 4911 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA Philosophers-PT-010000-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5262 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5145 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6064 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5908 ms. (steps per millisecond=1 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6548 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 23002 steps, including 0 resets, run timeout after 5145 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 22002 steps, including 0 resets, run timeout after 5081 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0]
FORMULA Philosophers-PT-010000-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 23002 steps, including 0 resets, run timeout after 5079 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 21:52:46] [INFO ] Computed 20000 place invariants in 3441 ms
[2020-06-02 21:53:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:53:04] [INFO ] [Real]Absence check using 20000 positive place invariants in 14198 ms returned unknown
[2020-06-02 21:53:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:53:24] [INFO ] [Real]Absence check using 20000 positive place invariants in 15037 ms returned unknown
[2020-06-02 21:53:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:53:44] [INFO ] [Real]Absence check using 20000 positive place invariants in 15433 ms returned unknown
[2020-06-02 21:53:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:54:03] [INFO ] [Real]Absence check using 20000 positive place invariants in 15013 ms returned unknown
[2020-06-02 21:54:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:54:21] [INFO ] [Real]Absence check using 20000 positive place invariants in 14299 ms returned unknown
[2020-06-02 21:54:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:54:39] [INFO ] [Real]Absence check using 20000 positive place invariants in 14821 ms returned unknown
[2020-06-02 21:54:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:54:56] [INFO ] [Real]Absence check using 20000 positive place invariants in 13984 ms returned unknown
Support contains 50000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 275 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Interrupted random walk after 4710 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5121 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5971 ms. (steps per millisecond=1 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6032 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5874 ms. (steps per millisecond=1 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6580 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 23002 steps, including 0 resets, run timeout after 5069 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 23002 steps, including 0 resets, run timeout after 5085 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 6000 steps, saw 1 distinct states, run finished after 35317 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 21:56:45] [INFO ] Computed 20000 place invariants in 3387 ms
[2020-06-02 21:56:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:57:03] [INFO ] [Real]Absence check using 20000 positive place invariants in 14413 ms returned unknown
[2020-06-02 21:57:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:57:22] [INFO ] [Real]Absence check using 20000 positive place invariants in 14401 ms returned unknown
[2020-06-02 21:57:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:57:41] [INFO ] [Real]Absence check using 20000 positive place invariants in 14667 ms returned unknown
[2020-06-02 21:57:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:58:00] [INFO ] [Real]Absence check using 20000 positive place invariants in 15310 ms returned unknown
[2020-06-02 21:58:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:58:18] [INFO ] [Real]Absence check using 20000 positive place invariants in 13999 ms returned unknown
[2020-06-02 21:58:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:58:36] [INFO ] [Real]Absence check using 20000 positive place invariants in 13928 ms returned unknown
[2020-06-02 21:58:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:58:55] [INFO ] [Real]Absence check using 20000 positive place invariants in 14740 ms returned unknown
Support contains 50000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 269 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 288 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 21:58:59] [INFO ] Computed 20000 place invariants in 3478 ms
[2020-06-02 21:59:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:59:03] [INFO ] Implicit Places using invariants in 7868 ms returned []
Implicit Place search using SMT only with invariants took 7869 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 21:59:07] [INFO ] Computed 20000 place invariants in 3639 ms
[2020-06-02 21:59:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:59:41] [INFO ] Performed 314/50000 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-06-02 22:00:07] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= s2912 1) (>= s12697 1))") after 63682 ms
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Interrupted random walk after 4514 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 22:00:41] [INFO ] Computed 20000 place invariants in 3416 ms
[2020-06-02 22:00:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:01:00] [INFO ] [Real]Absence check using 20000 positive place invariants in 14496 ms returned unknown
[2020-06-02 22:01:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:01:19] [INFO ] [Real]Absence check using 20000 positive place invariants in 14269 ms returned unknown
[2020-06-02 22:01:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:01:37] [INFO ] [Real]Absence check using 20000 positive place invariants in 14249 ms returned unknown
[2020-06-02 22:01:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:01:56] [INFO ] [Real]Absence check using 20000 positive place invariants in 14727 ms returned unknown
[2020-06-02 22:02:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:02:15] [INFO ] [Real]Absence check using 20000 positive place invariants in 15437 ms returned unknown
[2020-06-02 22:02:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:02:34] [INFO ] [Real]Absence check using 20000 positive place invariants in 14450 ms returned unknown
[2020-06-02 22:02:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:02:52] [INFO ] [Real]Absence check using 20000 positive place invariants in 14556 ms returned unknown
Applied a total of 0 rules in 252 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2020-06-02 22:02:56] [INFO ] Computed 20000 place invariants in 3380 ms
[2020-06-02 22:03:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:03:15] [INFO ] [Real]Absence check using 20000 positive place invariants in 15624 ms returned unknown
[2020-06-02 22:03:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:03:34] [INFO ] [Real]Absence check using 20000 positive place invariants in 14758 ms returned unknown
[2020-06-02 22:03:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:03:54] [INFO ] [Real]Absence check using 20000 positive place invariants in 14853 ms returned unknown
[2020-06-02 22:04:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:04:13] [INFO ] [Real]Absence check using 20000 positive place invariants in 15382 ms returned unknown
[2020-06-02 22:04:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:04:33] [INFO ] [Real]Absence check using 20000 positive place invariants in 15256 ms returned unknown
[2020-06-02 22:04:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:04:52] [INFO ] [Real]Absence check using 20000 positive place invariants in 14447 ms returned unknown
[2020-06-02 22:05:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:05:09] [INFO ] [Real]Absence check using 20000 positive place invariants in 14096 ms returned unknown
[2020-06-02 22:05:10] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 118 ms.
[2020-06-02 22:05:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 243 ms.
[2020-06-02 22:05:13] [INFO ] Flatten gal took : 2204 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Philosophers-PT-010000 @ 3570 seconds
vrfy: finished
info: timeLeft: 3507
rslt: Output for ReachabilityCardinality @ Philosophers-PT-010000
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: 100000/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50000
lola: finding significant places
lola: 50000 places, 50000 transitions, 30000 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
Killed
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="Philosophers-PT-010000"
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 Philosophers-PT-010000, 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 r176-tajo-158987871500190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-010000.tgz
mv Philosophers-PT-010000 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 '
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 ;