Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472281700054.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 BugTracking-PT-q3m128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281700054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Jun 7 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 22K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 203K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 7 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q3m128-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654741846936

Running Version 202205111006
[2022-06-09 02:30:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2022-06-09 02:30:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 02:30:49] [INFO ] Load time of PNML (sax parser for PT used): 767 ms
[2022-06-09 02:30:49] [INFO ] Transformed 754 places.
[2022-06-09 02:30:49] [INFO ] Transformed 27370 transitions.
[2022-06-09 02:30:49] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 975 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 93 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-09 02:30:50] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-09 02:30:50] [INFO ] Computed 10 place invariants in 32 ms
[2022-06-09 02:30:50] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-06-09 02:30:51] [INFO ] After 1048ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-06-09 02:30:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:30:52] [INFO ] After 853ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-06-09 02:30:52] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-09 02:30:52] [INFO ] After 397ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-06-09 02:30:53] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 32 ms to minimize.
[2022-06-09 02:30:53] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 1 ms to minimize.
[2022-06-09 02:30:53] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 0 ms to minimize.
[2022-06-09 02:30:54] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 2 ms to minimize.
[2022-06-09 02:30:54] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 5 ms to minimize.
[2022-06-09 02:30:54] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 0 ms to minimize.
[2022-06-09 02:30:54] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2022-06-09 02:30:54] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2022-06-09 02:30:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2262 ms
[2022-06-09 02:30:55] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 1 ms to minimize.
[2022-06-09 02:30:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 340 ms
[2022-06-09 02:30:55] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:30:56] [INFO ] Deduced a trap composed of 107 places in 305 ms of which 1 ms to minimize.
[2022-06-09 02:30:56] [INFO ] Deduced a trap composed of 118 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:30:56] [INFO ] Deduced a trap composed of 110 places in 289 ms of which 0 ms to minimize.
[2022-06-09 02:30:57] [INFO ] Deduced a trap composed of 77 places in 297 ms of which 1 ms to minimize.
[2022-06-09 02:30:57] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 0 ms to minimize.
[2022-06-09 02:30:57] [INFO ] Deduced a trap composed of 86 places in 295 ms of which 0 ms to minimize.
[2022-06-09 02:30:58] [INFO ] Deduced a trap composed of 69 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:30:58] [INFO ] Deduced a trap composed of 72 places in 295 ms of which 1 ms to minimize.
[2022-06-09 02:30:59] [INFO ] Deduced a trap composed of 121 places in 321 ms of which 1 ms to minimize.
[2022-06-09 02:30:59] [INFO ] Deduced a trap composed of 77 places in 293 ms of which 0 ms to minimize.
[2022-06-09 02:30:59] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:31:00] [INFO ] Deduced a trap composed of 91 places in 291 ms of which 0 ms to minimize.
[2022-06-09 02:31:00] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 1 ms to minimize.
[2022-06-09 02:31:00] [INFO ] Deduced a trap composed of 84 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:31:01] [INFO ] Deduced a trap composed of 98 places in 287 ms of which 1 ms to minimize.
[2022-06-09 02:31:01] [INFO ] Deduced a trap composed of 57 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:31:01] [INFO ] Deduced a trap composed of 63 places in 298 ms of which 1 ms to minimize.
[2022-06-09 02:31:02] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 0 ms to minimize.
[2022-06-09 02:31:02] [INFO ] Deduced a trap composed of 52 places in 274 ms of which 0 ms to minimize.
[2022-06-09 02:31:02] [INFO ] Deduced a trap composed of 111 places in 299 ms of which 1 ms to minimize.
[2022-06-09 02:31:03] [INFO ] Deduced a trap composed of 110 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:31:03] [INFO ] Deduced a trap composed of 123 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:31:03] [INFO ] Deduced a trap composed of 120 places in 286 ms of which 1 ms to minimize.
[2022-06-09 02:31:04] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8636 ms
[2022-06-09 02:31:04] [INFO ] After 11883ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 248 ms.
[2022-06-09 02:31:04] [INFO ] After 13098ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5897 ms.
Support contains 12 out of 240 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 237 transition count 2772
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 237 transition count 2765
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 17 place count 230 transition count 2765
Applied a total of 17 rules in 240 ms. Remains 230 /240 variables (removed 10) and now considering 2765/2769 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/240 places, 2765/2769 transitions.
Incomplete random walk after 1000024 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3475 ms. (steps per millisecond=287 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3348 ms. (steps per millisecond=298 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1013174 steps, run timeout after 21001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 1013174 steps, saw 649292 distinct states, run finished after 21003 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 02:31:39] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:31:39] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:31:39] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 02:31:40] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 02:31:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 02:31:40] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 02:31:40] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-09 02:31:40] [INFO ] After 322ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 02:31:41] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2022-06-09 02:31:41] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2022-06-09 02:31:41] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2022-06-09 02:31:41] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 0 ms to minimize.
[2022-06-09 02:31:42] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 0 ms to minimize.
[2022-06-09 02:31:42] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 1 ms to minimize.
[2022-06-09 02:31:42] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 1 ms to minimize.
[2022-06-09 02:31:42] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2022-06-09 02:31:43] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 1 ms to minimize.
[2022-06-09 02:31:43] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 0 ms to minimize.
[2022-06-09 02:31:43] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2022-06-09 02:31:43] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 0 ms to minimize.
[2022-06-09 02:31:43] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
[2022-06-09 02:31:44] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 1 ms to minimize.
[2022-06-09 02:31:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3287 ms
[2022-06-09 02:31:44] [INFO ] After 3802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 224 ms.
[2022-06-09 02:31:44] [INFO ] After 4570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 12 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 51 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2765/2765 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 85 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
[2022-06-09 02:31:44] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:31:44] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 02:31:45] [INFO ] Implicit Places using invariants in 371 ms returned []
[2022-06-09 02:31:45] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:31:45] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 02:31:45] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-09 02:31:46] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2022-06-09 02:31:46] [INFO ] Redundant transitions in 205 ms returned []
[2022-06-09 02:31:46] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:31:46] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:31:47] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2765/2765 transitions.
Incomplete random walk after 1000046 steps, including 2 resets, run finished after 854 ms. (steps per millisecond=1171 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3368 ms. (steps per millisecond=296 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3534 ms. (steps per millisecond=282 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1005806 steps, run timeout after 21001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 1005806 steps, saw 644327 distinct states, run finished after 21001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 02:32:16] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:32:16] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:32:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 02:32:16] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 02:32:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 02:32:17] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 02:32:17] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-09 02:32:17] [INFO ] After 303ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 02:32:18] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2022-06-09 02:32:18] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2022-06-09 02:32:18] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2022-06-09 02:32:18] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 0 ms to minimize.
[2022-06-09 02:32:18] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 0 ms to minimize.
[2022-06-09 02:32:19] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2022-06-09 02:32:19] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 1 ms to minimize.
[2022-06-09 02:32:19] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2022-06-09 02:32:19] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 0 ms to minimize.
[2022-06-09 02:32:20] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 1 ms to minimize.
[2022-06-09 02:32:20] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 0 ms to minimize.
[2022-06-09 02:32:20] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 1 ms to minimize.
[2022-06-09 02:32:20] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2022-06-09 02:32:20] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 1 ms to minimize.
[2022-06-09 02:32:20] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3232 ms
[2022-06-09 02:32:21] [INFO ] After 3722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 220 ms.
[2022-06-09 02:32:21] [INFO ] After 4529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 12 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 42 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2765/2765 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 39 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
[2022-06-09 02:32:21] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:32:21] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 02:32:21] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-06-09 02:32:21] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:32:21] [INFO ] Computed 8 place invariants in 59 ms
[2022-06-09 02:32:22] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-09 02:32:23] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2018 ms to find 0 implicit places.
[2022-06-09 02:32:23] [INFO ] Redundant transitions in 155 ms returned []
[2022-06-09 02:32:23] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2022-06-09 02:32:23] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:32:24] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2765/2765 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 230 transition count 2633
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 136 place count 228 transition count 2631
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 140 place count 228 transition count 2627
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 144 place count 224 transition count 2627
Applied a total of 144 rules in 187 ms. Remains 224 /230 variables (removed 6) and now considering 2627/2765 (removed 138) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2627 rows 224 cols
[2022-06-09 02:32:24] [INFO ] Computed 9 place invariants in 16 ms
[2022-06-09 02:32:24] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 02:32:25] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 02:32:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 02:32:25] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 02:32:25] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-06-09 02:32:26] [INFO ] After 861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-09 02:32:26] [INFO ] Flatten gal took : 335 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3837859778959933188
[2022-06-09 02:32:26] [INFO ] Too many transitions (2765) to apply POR reductions. Disabling POR matrices.
[2022-06-09 02:32:26] [INFO ] Applying decomposition
[2022-06-09 02:32:26] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3837859778959933188
Running compilation step : cd /tmp/ltsmin3837859778959933188;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 02:32:27] [INFO ] Flatten gal took : 404 ms
[2022-06-09 02:32:27] [INFO ] Flatten gal took : 225 ms
Compilation finished in 7303 ms.
Running link step : cd /tmp/ltsmin3837859778959933188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin3837859778959933188;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m128ReachabilityCardinality03==true'
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin3837859778959933188;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m128ReachabilityCardinality03==true'
Running LTSmin : cd /tmp/ltsmin3837859778959933188;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m128ReachabilityCardinality13==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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="BugTracking-PT-q3m128"
export BK_EXAMINATION="ReachabilityCardinality"
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 BugTracking-PT-q3m128, 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 r312-tall-165472281700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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