fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472281700070
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BugTracking-PT-q8m002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4283.207 3600000.00 13715717.00 579.90 ?T?TFFTTF?TFFFTT normal

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-165472281700070.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-q8m002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281700070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Jun 7 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 7 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 7 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 7 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Jun 7 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 7 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 7 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 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-q8m002-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654749130406

Running Version 202205111006
[2022-06-09 04:32:11] [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 04:32:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 04:32:12] [INFO ] Load time of PNML (sax parser for PT used): 740 ms
[2022-06-09 04:32:12] [INFO ] Transformed 754 places.
[2022-06-09 04:32:12] [INFO ] Transformed 27370 transitions.
[2022-06-09 04:32:12] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 950 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 82 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 191 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 7) seen :1
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :1
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-09 04:32:13] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 04:32:14] [INFO ] Computed 10 place invariants in 45 ms
[2022-06-09 04:32:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-09 04:32:14] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 04:32:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 04:32:15] [INFO ] After 862ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-06-09 04:32:15] [INFO ] State equation strengthened by 303 read => feed constraints.
[2022-06-09 04:32:15] [INFO ] After 597ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-06-09 04:32:16] [INFO ] Deduced a trap composed of 44 places in 356 ms of which 4 ms to minimize.
[2022-06-09 04:32:16] [INFO ] Deduced a trap composed of 41 places in 368 ms of which 1 ms to minimize.
[2022-06-09 04:32:17] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 0 ms to minimize.
[2022-06-09 04:32:17] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 2 ms to minimize.
[2022-06-09 04:32:17] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 0 ms to minimize.
[2022-06-09 04:32:18] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2022-06-09 04:32:18] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2022-06-09 04:32:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2647 ms
[2022-06-09 04:32:18] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2022-06-09 04:32:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 223 ms
[2022-06-09 04:32:19] [INFO ] After 3897ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 282 ms.
[2022-06-09 04:32:19] [INFO ] After 5156ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3999 ms.
Support contains 10 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 276 transition count 3873
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 276 transition count 3867
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 270 transition count 3867
Applied a total of 17 rules in 361 ms. Remains 270 /280 variables (removed 10) and now considering 3867/3904 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/280 places, 3867/3904 transitions.
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 14413 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4677 ms. (steps per millisecond=213 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3632 ms. (steps per millisecond=275 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 900885 steps, including 8 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen 0
Interrupted probabilistic random walk after 2762891 steps, run timeout after 81001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 2762891 steps, saw 1211091 distinct states, run finished after 81005 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-09 04:34:12] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:34:12] [INFO ] Computed 8 place invariants in 23 ms
[2022-06-09 04:34:12] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 04:34:12] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 04:34:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 04:34:13] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 04:34:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 04:34:14] [INFO ] After 599ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-09 04:34:14] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 0 ms to minimize.
[2022-06-09 04:34:15] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 0 ms to minimize.
[2022-06-09 04:34:15] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 1 ms to minimize.
[2022-06-09 04:34:15] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 0 ms to minimize.
[2022-06-09 04:34:16] [INFO ] Deduced a trap composed of 97 places in 345 ms of which 0 ms to minimize.
[2022-06-09 04:34:16] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 0 ms to minimize.
[2022-06-09 04:34:17] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 2 ms to minimize.
[2022-06-09 04:34:17] [INFO ] Deduced a trap composed of 14 places in 349 ms of which 0 ms to minimize.
[2022-06-09 04:34:17] [INFO ] Deduced a trap composed of 87 places in 311 ms of which 0 ms to minimize.
[2022-06-09 04:34:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3806 ms
[2022-06-09 04:34:18] [INFO ] After 4843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 337 ms.
[2022-06-09 04:34:18] [INFO ] After 6021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3867/3867 transitions.
Applied a total of 0 rules in 63 ms. Remains 270 /270 variables (removed 0) and now considering 3867/3867 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3867/3867 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3867/3867 transitions.
Applied a total of 0 rules in 87 ms. Remains 270 /270 variables (removed 0) and now considering 3867/3867 (removed 0) transitions.
[2022-06-09 04:34:18] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:34:18] [INFO ] Computed 8 place invariants in 25 ms
[2022-06-09 04:34:19] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-09 04:34:19] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:34:19] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 04:34:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 04:34:21] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2262 ms to find 0 implicit places.
[2022-06-09 04:34:21] [INFO ] Redundant transitions in 328 ms returned []
[2022-06-09 04:34:21] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:34:21] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 04:34:22] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3867/3867 transitions.
Incomplete random walk after 1000001 steps, including 6 resets, run finished after 15728 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4563 ms. (steps per millisecond=219 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3813 ms. (steps per millisecond=262 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4774 ms. (steps per millisecond=209 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2812044 steps, run timeout after 84001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 2812044 steps, saw 1226578 distinct states, run finished after 84001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-09 04:36:15] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:36:15] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 04:36:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 04:36:15] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 04:36:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 04:36:16] [INFO ] After 807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 04:36:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 04:36:17] [INFO ] After 617ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-09 04:36:17] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 1 ms to minimize.
[2022-06-09 04:36:18] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 0 ms to minimize.
[2022-06-09 04:36:18] [INFO ] Deduced a trap composed of 8 places in 393 ms of which 1 ms to minimize.
[2022-06-09 04:36:18] [INFO ] Deduced a trap composed of 28 places in 394 ms of which 1 ms to minimize.
[2022-06-09 04:36:19] [INFO ] Deduced a trap composed of 97 places in 393 ms of which 0 ms to minimize.
[2022-06-09 04:36:19] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 0 ms to minimize.
[2022-06-09 04:36:20] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 0 ms to minimize.
[2022-06-09 04:36:20] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 1 ms to minimize.
[2022-06-09 04:36:21] [INFO ] Deduced a trap composed of 87 places in 333 ms of which 0 ms to minimize.
[2022-06-09 04:36:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4113 ms
[2022-06-09 04:36:21] [INFO ] After 5170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 325 ms.
[2022-06-09 04:36:21] [INFO ] After 6382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3867/3867 transitions.
Applied a total of 0 rules in 60 ms. Remains 270 /270 variables (removed 0) and now considering 3867/3867 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3867/3867 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3867/3867 transitions.
Applied a total of 0 rules in 56 ms. Remains 270 /270 variables (removed 0) and now considering 3867/3867 (removed 0) transitions.
[2022-06-09 04:36:22] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:36:22] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 04:36:22] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-06-09 04:36:22] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:36:22] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 04:36:23] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 04:36:24] [INFO ] Implicit Places using invariants and state equation in 2159 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
[2022-06-09 04:36:24] [INFO ] Redundant transitions in 250 ms returned []
[2022-06-09 04:36:24] [INFO ] Flow matrix only has 3700 transitions (discarded 167 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 04:36:24] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 04:36:25] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3867/3867 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 270 transition count 3699
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 172 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 173 place count 268 transition count 3696
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 268 transition count 3693
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 179 place count 265 transition count 3693
Applied a total of 179 rules in 316 ms. Remains 265 /270 variables (removed 5) and now considering 3693/3867 (removed 174) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 3693 rows 265 cols
[2022-06-09 04:36:26] [INFO ] Computed 9 place invariants in 28 ms
[2022-06-09 04:36:26] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 04:36:26] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 04:36:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-09 04:36:27] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 04:36:27] [INFO ] After 1156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 241 ms.
[2022-06-09 04:36:27] [INFO ] After 1466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-09 04:36:28] [INFO ] Flatten gal took : 378 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16243406579773471653
[2022-06-09 04:36:28] [INFO ] Too many transitions (3867) to apply POR reductions. Disabling POR matrices.
[2022-06-09 04:36:28] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16243406579773471653
Running compilation step : cd /tmp/ltsmin16243406579773471653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 04:36:28] [INFO ] Applying decomposition
[2022-06-09 04:36:29] [INFO ] Flatten gal took : 218 ms
[2022-06-09 04:36:29] [INFO ] Flatten gal took : 520 ms
Compilation finished in 10780 ms.
Running link step : cd /tmp/ltsmin16243406579773471653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin16243406579773471653;'/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' 'BugTrackingPTq8m002ReachabilityCardinality00==true'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin16243406579773471653;'/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' 'BugTrackingPTq8m002ReachabilityCardinality00==true'
Running LTSmin : cd /tmp/ltsmin16243406579773471653;'/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' 'BugTrackingPTq8m002ReachabilityCardinality02==true'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin16243406579773471653;'/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' 'BugTrackingPTq8m002ReachabilityCardinality02==true'
Running LTSmin : cd /tmp/ltsmin16243406579773471653;'/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' 'BugTrackingPTq8m002ReachabilityCardinality09==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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-q8m002"
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-q8m002, 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-165472281700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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