Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819411300541.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DoubleLock-PT-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411300541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 14:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 813K Mar 5 18:22 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-p2s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678584795546

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-12 01:33:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-12 01:33:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 01:33:19] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2023-03-12 01:33:19] [INFO ] Transformed 184 places.
[2023-03-12 01:33:19] [INFO ] Transformed 1832 transitions.
[2023-03-12 01:33:19] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 36 places in 10 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1225 out of 1768 initially.
// Phase 1: matrix 1225 rows 148 cols
[2023-03-12 01:33:19] [INFO ] Computed 4 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 100 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :21
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :4
[2023-03-12 01:33:19] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2023-03-12 01:33:19] [INFO ] Computed 4 place invariants in 14 ms
[2023-03-12 01:33:19] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-12 01:33:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 01:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:20] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-12 01:33:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:33:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 01:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:21] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2023-03-12 01:33:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:33:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 206 ms returned sat
[2023-03-12 01:33:21] [INFO ] Deduced a trap composed of 72 places in 423 ms of which 12 ms to minimize.
[2023-03-12 01:33:22] [INFO ] Deduced a trap composed of 67 places in 424 ms of which 2 ms to minimize.
[2023-03-12 01:33:22] [INFO ] Deduced a trap composed of 66 places in 359 ms of which 2 ms to minimize.
[2023-03-12 01:33:23] [INFO ] Deduced a trap composed of 66 places in 376 ms of which 2 ms to minimize.
[2023-03-12 01:33:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1900 ms
[2023-03-12 01:33:23] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 323 ms.
[2023-03-12 01:33:23] [INFO ] Added : 0 causal constraints over 0 iterations in 453 ms. Result :sat
Minimization took 281 ms.
[2023-03-12 01:33:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:33:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 01:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:24] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2023-03-12 01:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 01:33:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 01:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:24] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-12 01:33:25] [INFO ] [Nat]Added 116 Read/Feed constraints in 468 ms returned sat
[2023-03-12 01:33:25] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 293 ms.
[2023-03-12 01:33:25] [INFO ] Added : 0 causal constraints over 0 iterations in 414 ms. Result :sat
Minimization took 306 ms.
[2023-03-12 01:33:26] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 01:33:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 01:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:26] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2023-03-12 01:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:33:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 01:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:26] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-12 01:33:27] [INFO ] [Nat]Added 116 Read/Feed constraints in 167 ms returned sat
[2023-03-12 01:33:27] [INFO ] Deduced a trap composed of 63 places in 537 ms of which 2 ms to minimize.
[2023-03-12 01:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 644 ms
[2023-03-12 01:33:27] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 185 ms.
[2023-03-12 01:33:27] [INFO ] Added : 0 causal constraints over 0 iterations in 351 ms. Result :sat
Minimization took 678 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, -1] Max seen :[1, 7, 2]
FORMULA DoubleLock-PT-p2s2-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 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 144 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 143 transition count 1704
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 143 transition count 1704
Applied a total of 35 rules in 157 ms. Remains 143 /148 variables (removed 5) and now considering 1704/1768 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 143/148 places, 1704/1768 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:33:29] [INFO ] Computed 3 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 10208 resets, run finished after 1932 ms. (steps per millisecond=517 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1970 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1954 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 2) seen :2
[2023-03-12 01:33:33] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:33:33] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 01:33:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:33] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-12 01:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 01:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:34] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2023-03-12 01:33:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:33:34] [INFO ] [Nat]Added 116 Read/Feed constraints in 234 ms returned sat
[2023-03-12 01:33:34] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 1 ms to minimize.
[2023-03-12 01:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-12 01:33:34] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 163 ms.
[2023-03-12 01:33:34] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 430 ms.
[2023-03-12 01:33:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 01:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:35] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2023-03-12 01:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 01:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:36] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-12 01:33:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 351 ms returned sat
[2023-03-12 01:33:37] [INFO ] Deduced a trap composed of 54 places in 380 ms of which 1 ms to minimize.
[2023-03-12 01:33:37] [INFO ] Deduced a trap composed of 67 places in 393 ms of which 2 ms to minimize.
[2023-03-12 01:33:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 878 ms
[2023-03-12 01:33:37] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 147 ms.
[2023-03-12 01:33:37] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 359 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[2, 2]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 65 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 67 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 01:33:39] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:33:39] [INFO ] Invariant cache hit.
[2023-03-12 01:33:39] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-12 01:33:39] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:33:39] [INFO ] Invariant cache hit.
[2023-03-12 01:33:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:33:40] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
[2023-03-12 01:33:41] [INFO ] Redundant transitions in 191 ms returned []
[2023-03-12 01:33:41] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:33:41] [INFO ] Invariant cache hit.
[2023-03-12 01:33:42] [INFO ] Dead Transitions using invariants and state equation in 1398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3595 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:33:42] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 10151 resets, run finished after 1857 ms. (steps per millisecond=538 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 1916 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1931 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties (out of 2) seen :2
[2023-03-12 01:33:45] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:33:45] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-12 01:33:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:46] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-12 01:33:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:46] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-12 01:33:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:33:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 166 ms returned sat
[2023-03-12 01:33:46] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 1 ms to minimize.
[2023-03-12 01:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2023-03-12 01:33:47] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 163 ms.
[2023-03-12 01:33:47] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 389 ms.
[2023-03-12 01:33:47] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 01:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:48] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-12 01:33:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 01:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:48] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2023-03-12 01:33:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 511 ms returned sat
[2023-03-12 01:33:49] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 2 ms to minimize.
[2023-03-12 01:33:49] [INFO ] Deduced a trap composed of 67 places in 376 ms of which 1 ms to minimize.
[2023-03-12 01:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 824 ms
[2023-03-12 01:33:50] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 152 ms.
[2023-03-12 01:33:50] [INFO ] Added : 0 causal constraints over 0 iterations in 264 ms. Result :sat
Minimization took 434 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[2, 3]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 54 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 31 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 01:33:51] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:33:51] [INFO ] Invariant cache hit.
[2023-03-12 01:33:51] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 01:33:51] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:33:51] [INFO ] Invariant cache hit.
[2023-03-12 01:33:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:33:52] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
[2023-03-12 01:33:52] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-12 01:33:52] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:33:52] [INFO ] Invariant cache hit.
[2023-03-12 01:33:54] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2779 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:33:54] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 10163 resets, run finished after 1796 ms. (steps per millisecond=556 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 1935 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1940 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 2) seen :2
[2023-03-12 01:33:57] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:33:57] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 01:33:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 01:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:57] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-12 01:33:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 01:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:58] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-12 01:33:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:33:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 233 ms returned sat
[2023-03-12 01:33:58] [INFO ] Deduced a trap composed of 62 places in 181 ms of which 1 ms to minimize.
[2023-03-12 01:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-12 01:33:58] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 122 ms.
[2023-03-12 01:33:58] [INFO ] Added : 0 causal constraints over 0 iterations in 220 ms. Result :sat
Minimization took 357 ms.
[2023-03-12 01:33:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 01:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:33:59] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-12 01:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:33:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:00] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2023-03-12 01:34:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 356 ms returned sat
[2023-03-12 01:34:00] [INFO ] Deduced a trap composed of 54 places in 253 ms of which 1 ms to minimize.
[2023-03-12 01:34:01] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 0 ms to minimize.
[2023-03-12 01:34:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 616 ms
[2023-03-12 01:34:01] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 87 ms.
[2023-03-12 01:34:01] [INFO ] Added : 0 causal constraints over 0 iterations in 172 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[2, 3]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 50 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 45 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 01:34:01] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:01] [INFO ] Invariant cache hit.
[2023-03-12 01:34:02] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 01:34:02] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:02] [INFO ] Invariant cache hit.
[2023-03-12 01:34:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:04] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
[2023-03-12 01:34:04] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-12 01:34:04] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:04] [INFO ] Invariant cache hit.
[2023-03-12 01:34:05] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3269 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:05] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 10002 steps, including 98 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-12 01:34:05] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:05] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 01:34:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:05] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-12 01:34:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:34:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:06] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2023-03-12 01:34:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:06] [INFO ] [Nat]Added 116 Read/Feed constraints in 183 ms returned sat
[2023-03-12 01:34:06] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 1 ms to minimize.
[2023-03-12 01:34:06] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 0 ms to minimize.
[2023-03-12 01:34:06] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 0 ms to minimize.
[2023-03-12 01:34:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 678 ms
[2023-03-12 01:34:07] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 106 ms.
[2023-03-12 01:34:07] [INFO ] Added : 0 causal constraints over 0 iterations in 190 ms. Result :sat
Minimization took 284 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:07] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000002 steps, including 10124 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1924 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 1) seen :2
[2023-03-12 01:34:10] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:10] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 01:34:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:10] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-12 01:34:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:34:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:10] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-12 01:34:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:10] [INFO ] [Nat]Added 116 Read/Feed constraints in 169 ms returned sat
[2023-03-12 01:34:11] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 0 ms to minimize.
[2023-03-12 01:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-12 01:34:11] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 109 ms.
[2023-03-12 01:34:11] [INFO ] Added : 0 causal constraints over 0 iterations in 193 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 27 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 32 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 01:34:11] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:11] [INFO ] Invariant cache hit.
[2023-03-12 01:34:12] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 01:34:12] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:12] [INFO ] Invariant cache hit.
[2023-03-12 01:34:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:13] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2023-03-12 01:34:13] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-12 01:34:13] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:13] [INFO ] Invariant cache hit.
[2023-03-12 01:34:14] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2938 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:14] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000005 steps, including 10159 resets, run finished after 1729 ms. (steps per millisecond=578 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1955 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 1) seen :1
[2023-03-12 01:34:17] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:17] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 01:34:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:17] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-12 01:34:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:34:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:17] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-12 01:34:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 01:34:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 3649 ms returned sat
[2023-03-12 01:34:21] [INFO ] Deduced a trap composed of 78 places in 223 ms of which 1 ms to minimize.
[2023-03-12 01:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-12 01:34:21] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 106 ms.
[2023-03-12 01:34:21] [INFO ] Added : 0 causal constraints over 0 iterations in 190 ms. Result :sat
Minimization took 419 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 01:34:22] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:22] [INFO ] Invariant cache hit.
[2023-03-12 01:34:22] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-12 01:34:22] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:22] [INFO ] Invariant cache hit.
[2023-03-12 01:34:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:24] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2023-03-12 01:34:24] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-12 01:34:24] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:24] [INFO ] Invariant cache hit.
[2023-03-12 01:34:25] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2464 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:25] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000002 steps, including 10209 resets, run finished after 1716 ms. (steps per millisecond=582 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1951 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 1) seen :2
[2023-03-12 01:34:27] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:27] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 01:34:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:27] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-12 01:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:34:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:28] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-12 01:34:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 01:34:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 3785 ms returned sat
[2023-03-12 01:34:32] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 1 ms to minimize.
[2023-03-12 01:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-12 01:34:32] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 110 ms.
[2023-03-12 01:34:32] [INFO ] Added : 0 causal constraints over 0 iterations in 190 ms. Result :sat
Minimization took 221 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 01:34:32] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:32] [INFO ] Invariant cache hit.
[2023-03-12 01:34:32] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-12 01:34:32] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:32] [INFO ] Invariant cache hit.
[2023-03-12 01:34:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:34] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2023-03-12 01:34:34] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-12 01:34:34] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:34] [INFO ] Invariant cache hit.
[2023-03-12 01:34:35] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2509 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 29914 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:35] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 102 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :3
[2023-03-12 01:34:35] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:35] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 01:34:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:35] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-12 01:34:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:34:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:35] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2023-03-12 01:34:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 343 ms returned sat
[2023-03-12 01:34:36] [INFO ] Deduced a trap composed of 54 places in 260 ms of which 1 ms to minimize.
[2023-03-12 01:34:36] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 0 ms to minimize.
[2023-03-12 01:34:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 625 ms
[2023-03-12 01:34:36] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 105 ms.
[2023-03-12 01:34:36] [INFO ] Added : 0 causal constraints over 0 iterations in 186 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:37] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 10182 resets, run finished after 1745 ms. (steps per millisecond=573 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1960 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 1) seen :3
[2023-03-12 01:34:39] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-12 01:34:39] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 01:34:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 01:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:40] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2023-03-12 01:34:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 01:34:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 01:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 01:34:40] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-12 01:34:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:40] [INFO ] [Nat]Added 116 Read/Feed constraints in 345 ms returned sat
[2023-03-12 01:34:41] [INFO ] Deduced a trap composed of 54 places in 241 ms of which 1 ms to minimize.
[2023-03-12 01:34:41] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 0 ms to minimize.
[2023-03-12 01:34:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 608 ms
[2023-03-12 01:34:41] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 103 ms.
[2023-03-12 01:34:41] [INFO ] Added : 0 causal constraints over 0 iterations in 185 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 01:34:42] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:42] [INFO ] Invariant cache hit.
[2023-03-12 01:34:42] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-12 01:34:42] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:42] [INFO ] Invariant cache hit.
[2023-03-12 01:34:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 01:34:43] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2023-03-12 01:34:43] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-12 01:34:43] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-12 01:34:43] [INFO ] Invariant cache hit.
[2023-03-12 01:34:44] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2378 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 9418 ms.
[2023-03-12 01:34:45] [INFO ] Flatten gal took : 222 ms
[2023-03-12 01:34:45] [INFO ] Applying decomposition
[2023-03-12 01:34:45] [INFO ] Flatten gal took : 132 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1990083186414246019.txt' '-o' '/tmp/graph1990083186414246019.bin' '-w' '/tmp/graph1990083186414246019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1990083186414246019.bin' '-l' '-1' '-v' '-w' '/tmp/graph1990083186414246019.weights' '-q' '0' '-e' '0.001'
[2023-03-12 01:34:45] [INFO ] Decomposing Gal with order
[2023-03-12 01:34:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-12 01:34:45] [INFO ] Removed a total of 4008 redundant transitions.
[2023-03-12 01:34:46] [INFO ] Flatten gal took : 249 ms
[2023-03-12 01:34:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 71 ms.
[2023-03-12 01:34:46] [INFO ] Time to serialize gal into /tmp/UpperBounds11378731068326604324.gal : 28 ms
[2023-03-12 01:34:46] [INFO ] Time to serialize properties into /tmp/UpperBounds9844342058911360726.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11378731068326604324.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9844342058911360726.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds9844342058911360726.prop.
Detected timeout of ITS tools.
[2023-03-12 01:55:14] [INFO ] Flatten gal took : 86 ms
[2023-03-12 01:55:14] [INFO ] Time to serialize gal into /tmp/UpperBounds16468716688697387553.gal : 22 ms
[2023-03-12 01:55:14] [INFO ] Time to serialize properties into /tmp/UpperBounds12397259617116070791.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16468716688697387553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12397259617116070791.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds12397259617116070791.prop.
Detected timeout of ITS tools.
[2023-03-12 02:15:43] [INFO ] Flatten gal took : 90 ms
[2023-03-12 02:15:43] [INFO ] Input system was already deterministic with 1704 transitions.
[2023-03-12 02:15:43] [INFO ] Transformed 143 places.
[2023-03-12 02:15:43] [INFO ] Transformed 1704 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-12 02:15:44] [INFO ] Time to serialize gal into /tmp/UpperBounds1465327304780084385.gal : 9 ms
[2023-03-12 02:15:44] [INFO ] Time to serialize properties into /tmp/UpperBounds10733132331012197101.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1465327304780084385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10733132331012197101.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10733132331012197101.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 155284 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14563200 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-p2s2"
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-5348"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p2s2, 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 r133-smll-167819411300541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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