About the Execution of ITS-Tools for Philosophers-PT-000200
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162298996000139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298996000139
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.9M
-rw-r--r-- 1 mcc users 388K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 361K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 112K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 436K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 274K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 156K Mar 27 07:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 560K Mar 27 07:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Mar 25 08:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 187K Mar 25 08:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 872K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000200-UpperBounds-00
FORMULA_NAME Philosophers-PT-000200-UpperBounds-01
FORMULA_NAME Philosophers-PT-000200-UpperBounds-02
FORMULA_NAME Philosophers-PT-000200-UpperBounds-03
FORMULA_NAME Philosophers-PT-000200-UpperBounds-04
FORMULA_NAME Philosophers-PT-000200-UpperBounds-05
FORMULA_NAME Philosophers-PT-000200-UpperBounds-06
FORMULA_NAME Philosophers-PT-000200-UpperBounds-07
FORMULA_NAME Philosophers-PT-000200-UpperBounds-08
FORMULA_NAME Philosophers-PT-000200-UpperBounds-09
FORMULA_NAME Philosophers-PT-000200-UpperBounds-10
FORMULA_NAME Philosophers-PT-000200-UpperBounds-11
FORMULA_NAME Philosophers-PT-000200-UpperBounds-12
FORMULA_NAME Philosophers-PT-000200-UpperBounds-13
FORMULA_NAME Philosophers-PT-000200-UpperBounds-14
FORMULA_NAME Philosophers-PT-000200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1622990167913
Running Version 0
[2021-06-06 14:36:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-06 14:36:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:36:09] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2021-06-06 14:36:09] [INFO ] Transformed 1000 places.
[2021-06-06 14:36:09] [INFO ] Transformed 1000 transitions.
[2021-06-06 14:36:09] [INFO ] Found NUPN structural information;
[2021-06-06 14:36:09] [INFO ] Parsed PT model containing 1000 places and 1000 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 117 ms.
FORMULA Philosophers-PT-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1000 rows 1000 cols
[2021-06-06 14:36:09] [INFO ] Computed 400 place invariants in 36 ms
FORMULA Philosophers-PT-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 9) seen :634
FORMULA Philosophers-PT-000200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :36
// Phase 1: matrix 1000 rows 1000 cols
[2021-06-06 14:36:10] [INFO ] Computed 400 place invariants in 13 ms
[2021-06-06 14:36:11] [INFO ] [Real]Absence check using 400 positive place invariants in 77 ms returned sat
[2021-06-06 14:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:11] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2021-06-06 14:36:11] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:12] [INFO ] [Nat]Absence check using 400 positive place invariants in 67 ms returned sat
[2021-06-06 14:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:13] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2021-06-06 14:36:13] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 49 ms.
[2021-06-06 14:36:13] [INFO ] Added : 22 causal constraints over 5 iterations in 394 ms. Result :sat
Minimization took 117 ms.
[2021-06-06 14:36:14] [INFO ] [Real]Absence check using 400 positive place invariants in 82 ms returned sat
[2021-06-06 14:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:14] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2021-06-06 14:36:14] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:15] [INFO ] [Nat]Absence check using 400 positive place invariants in 89 ms returned sat
[2021-06-06 14:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:15] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2021-06-06 14:36:15] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 51 ms.
[2021-06-06 14:36:15] [INFO ] Added : 35 causal constraints over 7 iterations in 509 ms. Result :sat
Minimization took 151 ms.
[2021-06-06 14:36:16] [INFO ] [Real]Absence check using 400 positive place invariants in 79 ms returned sat
[2021-06-06 14:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:16] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-06-06 14:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:21] [INFO ] [Real]Absence check using 400 positive place invariants in 70 ms returned sat
[2021-06-06 14:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:22] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2021-06-06 14:36:22] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:23] [INFO ] [Nat]Absence check using 400 positive place invariants in 71 ms returned sat
[2021-06-06 14:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:23] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2021-06-06 14:36:23] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 45 ms.
[2021-06-06 14:36:24] [INFO ] Added : 22 causal constraints over 5 iterations in 377 ms. Result :sat
Minimization took 120 ms.
[2021-06-06 14:36:24] [INFO ] [Real]Absence check using 400 positive place invariants in 74 ms returned sat
[2021-06-06 14:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:24] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2021-06-06 14:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:26] [INFO ] [Nat]Absence check using 400 positive place invariants in 72 ms returned sat
[2021-06-06 14:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:26] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-06-06 14:36:26] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 46 ms.
[2021-06-06 14:36:26] [INFO ] Added : 22 causal constraints over 5 iterations in 353 ms. Result :sat
Minimization took 127 ms.
[2021-06-06 14:36:27] [INFO ] [Real]Absence check using 400 positive place invariants in 69 ms returned sat
[2021-06-06 14:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:27] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2021-06-06 14:36:27] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:28] [INFO ] [Nat]Absence check using 400 positive place invariants in 75 ms returned sat
[2021-06-06 14:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 43 ms.
[2021-06-06 14:36:29] [INFO ] Added : 22 causal constraints over 5 iterations in 349 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 200, 200] Max seen :[117, 34, 129, 117, 117, 117]
Incomplete Parikh walk after 26600 steps, including 117 resets, run finished after 1335 ms. (steps per millisecond=19 ) properties (out of 6) seen :824 could not realise parikh vector
FORMULA Philosophers-PT-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 26600 steps, including 116 resets, run finished after 795 ms. (steps per millisecond=33 ) properties (out of 2) seen :28 could not realise parikh vector
Incomplete Parikh walk after 26600 steps, including 116 resets, run finished after 790 ms. (steps per millisecond=33 ) properties (out of 2) seen :21 could not realise parikh vector
Incomplete Parikh walk after 24200 steps, including 112 resets, run finished after 618 ms. (steps per millisecond=39 ) properties (out of 2) seen :149 could not realise parikh vector
Incomplete Parikh walk after 26600 steps, including 116 resets, run finished after 802 ms. (steps per millisecond=33 ) properties (out of 2) seen :21 could not realise parikh vector
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Free-agglomeration rule (complex) applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1000 transition count 800
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 400 place count 800 transition count 800
Applied a total of 400 rules in 167 ms. Remains 800 /1000 variables (removed 200) and now considering 800/1000 (removed 200) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/1000 places, 800/1000 transitions.
// Phase 1: matrix 800 rows 800 cols
[2021-06-06 14:36:34] [INFO ] Computed 400 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 1134 resets, run finished after 28091 ms. (steps per millisecond=35 ) properties (out of 2) seen :258
FORMULA Philosophers-PT-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 720014 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen :{0=90}
// Phase 1: matrix 800 rows 800 cols
[2021-06-06 14:37:07] [INFO ] Computed 400 place invariants in 9 ms
[2021-06-06 14:37:07] [INFO ] [Real]Absence check using 400 positive place invariants in 98 ms returned sat
[2021-06-06 14:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:07] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-06-06 14:37:07] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [200] Max seen :[99]
Support contains 200 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 800/800 transitions.
Free-agglomeration rule (complex) applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 800 transition count 600
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 600 place count 600 transition count 400
Applied a total of 600 rules in 94 ms. Remains 600 /800 variables (removed 200) and now considering 400/800 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/800 places, 400/800 transitions.
// Phase 1: matrix 400 rows 600 cols
[2021-06-06 14:37:53] [INFO ] Computed 400 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 22994 ms. (steps per millisecond=43 ) properties (out of 1) seen :75
Interrupted Best-First random walk after 719781 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen :{0=97}
// Phase 1: matrix 400 rows 600 cols
[2021-06-06 14:38:21] [INFO ] Computed 400 place invariants in 5 ms
[2021-06-06 14:38:21] [INFO ] [Real]Absence check using 400 positive place invariants in 81 ms returned sat
[2021-06-06 14:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:38:21] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-06-06 14:38:21] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [200] Max seen :[99]
Support contains 200 out of 600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 24 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/600 places, 400/400 transitions.
Starting structural reductions, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 15 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2021-06-06 14:39:06] [INFO ] Computed 400 place invariants in 3 ms
[2021-06-06 14:39:06] [INFO ] Implicit Places using invariants in 375 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 193, 194, 196, 197, 198, 199, 200, 201, 202, 203, 204]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 379 ms to find 200 implicit places.
[2021-06-06 14:39:06] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:39:06] [INFO ] Computed 200 place invariants in 2 ms
[2021-06-06 14:39:07] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Starting structural reductions, iteration 1 : 400/600 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2021-06-06 14:39:07] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:39:07] [INFO ] Computed 200 place invariants in 2 ms
[2021-06-06 14:39:07] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 2 iterations. Remains : 400/600 places, 400/400 transitions.
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:39:07] [INFO ] Computed 200 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16112 ms. (steps per millisecond=62 ) properties (out of 1) seen :74
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4736 ms. (steps per millisecond=211 ) properties (out of 1) seen :97
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:39:28] [INFO ] Computed 200 place invariants in 2 ms
[2021-06-06 14:39:28] [INFO ] [Real]Absence check using 200 positive place invariants in 44 ms returned sat
[2021-06-06 14:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:28] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-06-06 14:39:28] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [200] Max seen :[99]
Support contains 200 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 400/400 transitions.
Starting structural reductions, iteration 0 : 400/400 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:40:13] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:40:13] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:40:13] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:40:13] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2021-06-06 14:40:13] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:40:13] [INFO ] Computed 200 place invariants in 8 ms
[2021-06-06 14:40:14] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 400/400 transitions.
Starting property specific reduction for Philosophers-PT-000200-UpperBounds-03
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:40:14] [INFO ] Computed 200 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :19
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:40:14] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:40:14] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-06-06 14:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:40:14] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-06-06 14:40:14] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 18 ms.
[2021-06-06 14:40:14] [INFO ] Added : 0 causal constraints over 0 iterations in 56 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [200] Max seen :[71]
Incomplete Parikh walk after 10000 steps, including 97 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :100 could not realise parikh vector
Support contains 200 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 400/400 transitions.
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:40:14] [INFO ] Computed 200 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16104 ms. (steps per millisecond=62 ) properties (out of 1) seen :74
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4801 ms. (steps per millisecond=208 ) properties (out of 1) seen :97
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:40:35] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:40:35] [INFO ] [Real]Absence check using 200 positive place invariants in 45 ms returned unsat
Current structural bounds on expressions (after SMT) : [100] Max seen :[100]
FORMULA Philosophers-PT-000200-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Philosophers-PT-000200-UpperBounds-03 in 21820 ms.
[2021-06-06 14:40:36] [INFO ] Flatten gal took : 86 ms
[2021-06-06 14:40:36] [INFO ] Applying decomposition
[2021-06-06 14:40:36] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8036845474890834054.txt, -o, /tmp/graph8036845474890834054.bin, -w, /tmp/graph8036845474890834054.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8036845474890834054.bin, -l, -1, -v, -w, /tmp/graph8036845474890834054.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 14:40:36] [INFO ] Decomposing Gal with order
[2021-06-06 14:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 14:40:36] [INFO ] Flatten gal took : 77 ms
[2021-06-06 14:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-06-06 14:40:36] [INFO ] Time to serialize gal into /tmp/UpperBounds6433155054402261178.gal : 17 ms
[2021-06-06 14:40:36] [INFO ] Time to serialize properties into /tmp/UpperBounds2636446877861916144.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6433155054402261178.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2636446877861916144.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds6433155054402261178.gal -t CGAL -reachable-file /tmp/UpperBounds2636446877861916144.prop --nowitness
Loading property file /tmp/UpperBounds2636446877861916144.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.58195e+07,0.095814,8664,239,12,757,100,839,506,24,109,0
Total reachable state count : 45819514
BK_STOP 1622990437699
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000200, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162298996000139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;