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-165472282100357.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 DoubleLock-PT-p3s3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282100357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.0K Jun 7 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 7 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654809963741

Running Version 202205111006
[2022-06-09 21:26:04] [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]
[2022-06-09 21:26:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 21:26:05] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2022-06-09 21:26:05] [INFO ] Transformed 306 places.
[2022-06-09 21:26:05] [INFO ] Transformed 3136 transitions.
[2022-06-09 21:26:05] [INFO ] Parsed PT model containing 306 places and 3136 transitions in 335 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 68 places in 12 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2121 out of 3008 initially.
// Phase 1: matrix 2121 rows 238 cols
[2022-06-09 21:26:05] [INFO ] Computed 4 place invariants in 63 ms
Incomplete random walk after 10001 steps, including 98 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :12
FORMULA DoubleLock-PT-p3s3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :7
FORMULA DoubleLock-PT-p3s3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :5
FORMULA DoubleLock-PT-p3s3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :6
FORMULA DoubleLock-PT-p3s3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-06-09 21:26:05] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 238 cols
[2022-06-09 21:26:05] [INFO ] Computed 4 place invariants in 34 ms
[2022-06-09 21:26:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 21:26:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 21:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:06] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2022-06-09 21:26:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:26:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 21:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:06] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-06-09 21:26:06] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:06] [INFO ] [Nat]Added 143 Read/Feed constraints in 243 ms returned sat
[2022-06-09 21:26:07] [INFO ] Deduced a trap composed of 115 places in 199 ms of which 3 ms to minimize.
[2022-06-09 21:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2022-06-09 21:26:07] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 279 ms.
[2022-06-09 21:26:07] [INFO ] Added : 0 causal constraints over 0 iterations in 419 ms. Result :sat
Minimization took 263 ms.
[2022-06-09 21:26:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 21:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:08] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2022-06-09 21:26:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:26:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 21:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:08] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-06-09 21:26:10] [INFO ] [Nat]Added 143 Read/Feed constraints in 1764 ms returned sat
[2022-06-09 21:26:10] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 387 ms.
[2022-06-09 21:26:10] [INFO ] Added : 0 causal constraints over 0 iterations in 536 ms. Result :sat
Minimization took 687 ms.
Current structural bounds on expressions (after SMT) : [1, -1] Max seen :[0, 6]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Graph (complete) has 5131 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.17 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 235 transition count 2976
Applied a total of 33 rules in 159 ms. Remains 235 /238 variables (removed 3) and now considering 2976/3008 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/238 places, 2976/3008 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:11] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 1000004 steps, including 9496 resets, run finished after 2072 ms. (steps per millisecond=482 ) properties (out of 2) seen :12
FORMULA DoubleLock-PT-p3s3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1456 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 1) seen :17
[2022-06-09 21:26:14] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:14] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-09 21:26:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:15] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-06-09 21:26:15] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:15] [INFO ] [Real]Added 143 Read/Feed constraints in 122 ms returned sat
[2022-06-09 21:26:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:26:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:15] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-06-09 21:26:16] [INFO ] [Nat]Added 143 Read/Feed constraints in 470 ms returned sat
[2022-06-09 21:26:16] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 177 ms.
[2022-06-09 21:26:16] [INFO ] Added : 1 causal constraints over 1 iterations in 384 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[17]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 70 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:17] [INFO ] Computed 3 place invariants in 18 ms
Incomplete random walk after 1000002 steps, including 9518 resets, run finished after 1820 ms. (steps per millisecond=549 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 1449 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 1) seen :17
[2022-06-09 21:26:19] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:19] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-09 21:26:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:20] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-06-09 21:26:20] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:20] [INFO ] [Real]Added 143 Read/Feed constraints in 117 ms returned sat
[2022-06-09 21:26:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:26:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:20] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-06-09 21:26:21] [INFO ] [Nat]Added 143 Read/Feed constraints in 525 ms returned sat
[2022-06-09 21:26:21] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 189 ms.
[2022-06-09 21:26:21] [INFO ] Added : 1 causal constraints over 1 iterations in 392 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[17]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 76 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 47 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 21:26:22] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:22] [INFO ] Computed 3 place invariants in 23 ms
[2022-06-09 21:26:22] [INFO ] Implicit Places using invariants in 296 ms returned []
[2022-06-09 21:26:22] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:22] [INFO ] Computed 3 place invariants in 13 ms
[2022-06-09 21:26:22] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:24] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 2117 ms to find 0 implicit places.
[2022-06-09 21:26:24] [INFO ] Redundant transitions in 178 ms returned []
[2022-06-09 21:26:24] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:24] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-09 21:26:25] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting property specific reduction for DoubleLock-PT-p3s3-UpperBounds-14
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:25] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 10003 steps, including 98 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :5
[2022-06-09 21:26:25] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:25] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 21:26:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:25] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-09 21:26:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:26:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:26] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-06-09 21:26:26] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:27] [INFO ] [Nat]Added 143 Read/Feed constraints in 1412 ms returned sat
[2022-06-09 21:26:27] [INFO ] Deduced a trap composed of 112 places in 275 ms of which 2 ms to minimize.
[2022-06-09 21:26:28] [INFO ] Deduced a trap composed of 104 places in 263 ms of which 1 ms to minimize.
[2022-06-09 21:26:28] [INFO ] Deduced a trap composed of 89 places in 284 ms of which 1 ms to minimize.
[2022-06-09 21:26:28] [INFO ] Deduced a trap composed of 95 places in 287 ms of which 3 ms to minimize.
[2022-06-09 21:26:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1354 ms
[2022-06-09 21:26:29] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 202 ms.
[2022-06-09 21:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 328 ms. Result :sat
Minimization took 1217 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 49 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:30] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 9539 resets, run finished after 1994 ms. (steps per millisecond=501 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 1464 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 1) seen :18
[2022-06-09 21:26:33] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:33] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-09 21:26:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:33] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-06-09 21:26:33] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:33] [INFO ] [Real]Added 143 Read/Feed constraints in 95 ms returned sat
[2022-06-09 21:26:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:26:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:34] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2022-06-09 21:26:34] [INFO ] [Nat]Added 143 Read/Feed constraints in 620 ms returned sat
[2022-06-09 21:26:35] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 173 ms.
[2022-06-09 21:26:35] [INFO ] Added : 1 causal constraints over 1 iterations in 356 ms. Result :sat
Minimization took 234 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[18]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 47 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 46 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 21:26:35] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:35] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-09 21:26:36] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-06-09 21:26:36] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:36] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-09 21:26:36] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:37] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
[2022-06-09 21:26:37] [INFO ] Redundant transitions in 164 ms returned []
[2022-06-09 21:26:37] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:37] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-09 21:26:38] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:38] [INFO ] Computed 3 place invariants in 9 ms
Incomplete random walk after 1000001 steps, including 9528 resets, run finished after 1953 ms. (steps per millisecond=512 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 1465 resets, run finished after 677 ms. (steps per millisecond=1477 ) properties (out of 1) seen :17
[2022-06-09 21:26:41] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:41] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-09 21:26:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:41] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-06-09 21:26:41] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:41] [INFO ] [Real]Added 143 Read/Feed constraints in 95 ms returned sat
[2022-06-09 21:26:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:26:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 21:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:26:42] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-06-09 21:26:42] [INFO ] [Nat]Added 143 Read/Feed constraints in 613 ms returned sat
[2022-06-09 21:26:43] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 154 ms.
[2022-06-09 21:26:43] [INFO ] Added : 1 causal constraints over 1 iterations in 353 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[18]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 49 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 53 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 21:26:43] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:43] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-09 21:26:44] [INFO ] Implicit Places using invariants in 251 ms returned []
[2022-06-09 21:26:44] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:44] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 21:26:44] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:26:45] [INFO ] Implicit Places using invariants and state equation in 1915 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
[2022-06-09 21:26:46] [INFO ] Redundant transitions in 61 ms returned []
[2022-06-09 21:26:46] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:26:46] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-09 21:26:46] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Ending property specific reduction for DoubleLock-PT-p3s3-UpperBounds-14 in 21560 ms.
[2022-06-09 21:26:47] [INFO ] Flatten gal took : 256 ms
[2022-06-09 21:26:47] [INFO ] Applying decomposition
[2022-06-09 21:26:47] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14058235118802447751.txt' '-o' '/tmp/graph14058235118802447751.bin' '-w' '/tmp/graph14058235118802447751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14058235118802447751.bin' '-l' '-1' '-v' '-w' '/tmp/graph14058235118802447751.weights' '-q' '0' '-e' '0.001'
[2022-06-09 21:26:48] [INFO ] Decomposing Gal with order
[2022-06-09 21:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 21:26:48] [INFO ] Removed a total of 7121 redundant transitions.
[2022-06-09 21:26:48] [INFO ] Flatten gal took : 340 ms
[2022-06-09 21:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 486 labels/synchronizations in 121 ms.
[2022-06-09 21:26:48] [INFO ] Time to serialize gal into /tmp/UpperBounds11363222663033039424.gal : 29 ms
[2022-06-09 21:26:48] [INFO ] Time to serialize properties into /tmp/UpperBounds5406049633093246435.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11363222663033039424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5406049633093246435.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds5406049633093246435.prop.
Detected timeout of ITS tools.
[2022-06-09 21:47:03] [INFO ] Flatten gal took : 104 ms
[2022-06-09 21:47:03] [INFO ] Time to serialize gal into /tmp/UpperBounds14184512146770834316.gal : 13 ms
[2022-06-09 21:47:03] [INFO ] Time to serialize properties into /tmp/UpperBounds2839343861876243800.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14184512146770834316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2839343861876243800.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds2839343861876243800.prop.
Detected timeout of ITS tools.
[2022-06-09 22:07:30] [INFO ] Flatten gal took : 746 ms
[2022-06-09 22:07:40] [INFO ] Input system was already deterministic with 2976 transitions.
[2022-06-09 22:07:40] [INFO ] Transformed 235 places.
[2022-06-09 22:07:40] [INFO ] Transformed 2976 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 22:07:43] [INFO ] Time to serialize gal into /tmp/UpperBounds3610849968755758471.gal : 194 ms
[2022-06-09 22:07:43] [INFO ] Time to serialize properties into /tmp/UpperBounds2574264558656540107.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3610849968755758471.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2574264558656540107.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2574264558656540107.prop.

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
+ [[ 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
+ 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 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=@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="DoubleLock-PT-p3s3"
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 DoubleLock-PT-p3s3, 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 r312-tall-165472282100357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s3.tgz
mv DoubleLock-PT-p3s3 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;