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.r179-tall-165277027100304.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 gold2021
Input is PolyORBNT-PT-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100304
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 17K Apr 30 03:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 30 03:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 30 03:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 30 03:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.3K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 120K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.6M May 10 09:34 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 PolyORBNT-PT-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652838626459

Running Version 0
[2022-05-18 01:50:28] [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-05-18 01:50:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:50:28] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2022-05-18 01:50:28] [INFO ] Transformed 349 places.
[2022-05-18 01:50:28] [INFO ] Transformed 1210 transitions.
[2022-05-18 01:50:28] [INFO ] Parsed PT model containing 349 places and 1210 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 551 out of 555 initially.
// Phase 1: matrix 551 rows 349 cols
[2022-05-18 01:50:28] [INFO ] Computed 62 place invariants in 62 ms
FORMULA PolyORBNT-PT-S05J20-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 682 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 15) seen :33
FORMULA PolyORBNT-PT-S05J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10000 steps, including 187 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 207 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10000 steps, including 184 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :29
[2022-05-18 01:50:28] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2022-05-18 01:50:28] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-18 01:50:28] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2022-05-18 01:50:28] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
[2022-05-18 01:50:29] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-05-18 01:50:29] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 12 ms returned sat
[2022-05-18 01:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:29] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-18 01:50:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:50:29] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2022-05-18 01:50:29] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 19 ms returned unsat
[2022-05-18 01:50:29] [INFO ] [Real]Absence check using 42 positive place invariants in 23 ms returned sat
[2022-05-18 01:50:29] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned sat
[2022-05-18 01:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:29] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-18 01:50:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:50:29] [INFO ] [Nat]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:29] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 13 ms returned sat
[2022-05-18 01:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:34] [INFO ] [Nat]Absence check using state equation in 4925 ms returned unknown
[2022-05-18 01:50:34] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:34] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned sat
[2022-05-18 01:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using state equation in 271 ms returned unsat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned unsat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned unsat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive place invariants in 7 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 26 ms returned unsat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-18 01:50:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:50:35] [INFO ] [Nat]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:36] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2022-05-18 01:50:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:50:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 45 ms returned sat
[2022-05-18 01:50:36] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 48 ms.
[2022-05-18 01:50:36] [INFO ] Added : 15 causal constraints over 3 iterations in 244 ms. Result :sat
Minimization took 135 ms.
[2022-05-18 01:50:36] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2022-05-18 01:50:36] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 7 ms returned unsat
[2022-05-18 01:50:36] [INFO ] [Real]Absence check using 42 positive place invariants in 7 ms returned sat
[2022-05-18 01:50:36] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 10, 10, 1, 5, 1, 1, 1, 128, 1, 1, 1] Max seen :[1, 1, 4, 10, 1, 5, 1, 1, 1, 3, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 4500 steps, including 298 resets, run finished after 25 ms. (steps per millisecond=180 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 57 place count 318 transition count 505
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 105 place count 294 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 293 transition count 504
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 293 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 291 transition count 502
Applied a total of 111 rules in 116 ms. Remains 291 /349 variables (removed 58) and now considering 502/555 (removed 53) transitions.
[2022-05-18 01:50:36] [INFO ] Flow matrix only has 498 transitions (discarded 4 similar events)
// Phase 1: matrix 498 rows 291 cols
[2022-05-18 01:50:36] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-18 01:50:37] [INFO ] Dead Transitions using invariants and state equation in 293 ms returned [263, 264, 266, 267, 268, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 285, 286, 288, 289, 290, 291, 292, 293, 296, 297, 298, 299, 300, 302, 303, 304, 305, 306, 307, 308, 309, 311, 312, 313, 314, 315, 316, 318, 320, 322, 323, 324, 326, 327, 328, 330, 331, 333, 334, 335, 336, 337, 339, 340, 341, 342, 343, 345, 346, 347, 349, 350, 351, 352, 355, 356, 358, 359, 360, 362, 363, 364, 365, 366, 367, 368, 370, 374, 377, 378, 379, 381, 383, 384, 385, 386, 387]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[387, 386, 385, 384, 383, 381, 379, 378, 377, 374, 370, 368, 367, 366, 365, 364, 363, 362, 360, 359, 358, 356, 355, 352, 351, 350, 349, 347, 346, 345, 343, 342, 341, 340, 339, 337, 336, 335, 334, 333, 331, 330, 328, 327, 326, 324, 323, 322, 320, 318, 316, 315, 314, 313, 312, 311, 309, 308, 307, 306, 305, 304, 303, 302, 300, 299, 298, 297, 296, 293, 292, 291, 290, 289, 288, 286, 285, 283, 282, 281, 280, 279, 278, 277, 276, 275, 274, 273, 272, 271, 268, 267, 266, 264, 263]
Starting structural reductions, iteration 1 : 291/349 places, 407/555 transitions.
Applied a total of 0 rules in 17 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 291/349 places, 407/555 transitions.
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:50:37] [INFO ] Computed 57 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 47094 resets, run finished after 2868 ms. (steps per millisecond=348 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 5587 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 6944 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 2) seen :7
[2022-05-18 01:50:41] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:50:41] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-18 01:50:41] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:41] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 6 ms returned sat
[2022-05-18 01:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:41] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-18 01:50:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:50:42] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2022-05-18 01:50:42] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 12 ms returned sat
[2022-05-18 01:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:48] [INFO ] [Nat]Absence check using state equation in 6101 ms returned sat
[2022-05-18 01:50:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:50:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-05-18 01:50:48] [INFO ] Computed and/alt/rep : 203/708/203 causal constraints (skipped 194 transitions) in 25 ms.
[2022-05-18 01:50:49] [INFO ] Added : 100 causal constraints over 20 iterations in 1030 ms. Result :sat
Minimization took 3002 ms.
[2022-05-18 01:50:52] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2022-05-18 01:50:52] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 10 ms returned sat
[2022-05-18 01:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:52] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-18 01:50:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:50:52] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2022-05-18 01:50:52] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 13 ms returned sat
[2022-05-18 01:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:52] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-18 01:50:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 214 ms returned sat
[2022-05-18 01:50:52] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 6 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 1 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 1 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 0 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 5 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 0 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 1 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 1 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 0 ms to minimize.
[2022-05-18 01:50:55] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2022-05-18 01:50:55] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2022-05-18 01:50:55] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 0 ms to minimize.
[2022-05-18 01:50:56] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 1 ms to minimize.
[2022-05-18 01:50:56] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2022-05-18 01:50:56] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2022-05-18 01:51:37] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 1 ms to minimize.
[2022-05-18 01:51:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10, 79] Max seen :[4, 3]
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 33 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 38 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2022-05-18 01:51:37] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:51:37] [INFO ] Computed 57 place invariants in 11 ms
[2022-05-18 01:51:37] [INFO ] Implicit Places using invariants in 254 ms returned []
[2022-05-18 01:51:37] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:51:37] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-18 01:51:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:51:39] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2022-05-18 01:51:39] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-18 01:51:39] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:51:39] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-18 01:51:39] [INFO ] Dead Transitions using invariants and state equation in 257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-02
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:51:39] [INFO ] Computed 57 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 482 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
[2022-05-18 01:51:39] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:51:39] [INFO ] Computed 57 place invariants in 11 ms
[2022-05-18 01:51:39] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2022-05-18 01:51:39] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-18 01:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:40] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-05-18 01:51:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:51:40] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2022-05-18 01:51:40] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 12 ms returned sat
[2022-05-18 01:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:45] [INFO ] [Nat]Absence check using state equation in 4952 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 291 transition count 406
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 290 transition count 406
Applied a total of 2 rules in 21 ms. Remains 290 /291 variables (removed 1) and now considering 406/407 (removed 1) transitions.
[2022-05-18 01:51:45] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-18 01:51:45] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-18 01:51:45] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 290/291 places, 406/407 transitions.
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2022-05-18 01:51:45] [INFO ] Computed 57 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 51909 resets, run finished after 2983 ms. (steps per millisecond=335 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5584 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :4
[2022-05-18 01:51:49] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-18 01:51:49] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-18 01:51:49] [INFO ] [Real]Absence check using 43 positive place invariants in 7 ms returned sat
[2022-05-18 01:51:49] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 6 ms returned sat
[2022-05-18 01:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:49] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-18 01:51:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:51:49] [INFO ] [Nat]Absence check using 43 positive place invariants in 7 ms returned sat
[2022-05-18 01:51:49] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 24 ms returned sat
[2022-05-18 01:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:55] [INFO ] [Nat]Absence check using state equation in 6210 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 237 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2022-05-18 01:51:55] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-18 01:51:55] [INFO ] Computed 57 place invariants in 11 ms
[2022-05-18 01:51:56] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-05-18 01:51:56] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-18 01:51:56] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-18 01:51:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:51:57] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2022-05-18 01:51:57] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-18 01:51:57] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-18 01:51:57] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-18 01:51:57] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-02 in 18042 ms.
Starting property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-12
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:51:57] [INFO ] Computed 57 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 464 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :3
[2022-05-18 01:51:57] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:51:57] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-18 01:51:58] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2022-05-18 01:51:58] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-18 01:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:58] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-18 01:51:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:51:58] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2022-05-18 01:51:58] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 13 ms returned sat
[2022-05-18 01:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:58] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-18 01:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:51:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 211 ms returned sat
[2022-05-18 01:51:58] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2022-05-18 01:51:58] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 0 ms to minimize.
[2022-05-18 01:51:58] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 1 ms to minimize.
[2022-05-18 01:51:58] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 0 ms to minimize.
[2022-05-18 01:51:58] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 0 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 0 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 5 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 0 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 0 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 0 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 0 ms to minimize.
[2022-05-18 01:52:00] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2022-05-18 01:52:00] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 0 ms to minimize.
[2022-05-18 01:52:00] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2022-05-18 01:52:00] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2022-05-18 01:52:00] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 0 ms to minimize.
[2022-05-18 01:52:01] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 1 ms to minimize.
[2022-05-18 01:52:01] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 0 ms to minimize.
[2022-05-18 01:52:01] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2022-05-18 01:52:02] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 0 ms to minimize.
[2022-05-18 01:52:02] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 0 ms to minimize.
[2022-05-18 01:52:03] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 1 ms to minimize.
[2022-05-18 01:52:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [79] Max seen :[3]
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 11 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2022-05-18 01:52:03] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:52:03] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-18 01:52:03] [INFO ] Dead Transitions using invariants and state equation in 325 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:52:03] [INFO ] Computed 57 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47565 resets, run finished after 2801 ms. (steps per millisecond=357 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6959 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :3
[2022-05-18 01:52:07] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:52:07] [INFO ] Computed 57 place invariants in 14 ms
[2022-05-18 01:52:07] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2022-05-18 01:52:07] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 6 ms returned sat
[2022-05-18 01:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:52:07] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-18 01:52:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:52:07] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2022-05-18 01:52:07] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 12 ms returned sat
[2022-05-18 01:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:52:07] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-18 01:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:52:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 210 ms returned sat
[2022-05-18 01:52:07] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 1 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 0 ms to minimize.
[2022-05-18 01:52:08] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2022-05-18 01:52:09] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 1 ms to minimize.
[2022-05-18 01:52:09] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 0 ms to minimize.
[2022-05-18 01:52:09] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 13 ms to minimize.
[2022-05-18 01:52:09] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 0 ms to minimize.
[2022-05-18 01:52:09] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 2 ms to minimize.
[2022-05-18 01:52:09] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 9 ms to minimize.
[2022-05-18 01:52:09] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2022-05-18 01:52:10] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 0 ms to minimize.
[2022-05-18 01:52:10] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 1 ms to minimize.
[2022-05-18 01:52:10] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 0 ms to minimize.
[2022-05-18 01:52:11] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 0 ms to minimize.
[2022-05-18 01:52:11] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2022-05-18 01:52:52] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 0 ms to minimize.
[2022-05-18 01:52:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [79] Max seen :[3]
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Starting structural reductions, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2022-05-18 01:52:52] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:52:52] [INFO ] Computed 57 place invariants in 12 ms
[2022-05-18 01:52:52] [INFO ] Implicit Places using invariants in 259 ms returned []
[2022-05-18 01:52:52] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:52:52] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-18 01:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:52:54] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
[2022-05-18 01:52:54] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-18 01:52:54] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-18 01:52:54] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-18 01:52:54] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 407/407 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-12 in 56860 ms.
[2022-05-18 01:52:54] [INFO ] Flatten gal took : 78 ms
[2022-05-18 01:52:55] [INFO ] Applying decomposition
[2022-05-18 01:52:55] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3824045530507958668.txt, -o, /tmp/graph3824045530507958668.bin, -w, /tmp/graph3824045530507958668.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3824045530507958668.bin, -l, -1, -v, -w, /tmp/graph3824045530507958668.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 01:52:55] [INFO ] Decomposing Gal with order
[2022-05-18 01:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:52:55] [INFO ] Removed a total of 517 redundant transitions.
[2022-05-18 01:52:55] [INFO ] Flatten gal took : 204 ms
[2022-05-18 01:52:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 28 ms.
[2022-05-18 01:52:55] [INFO ] Time to serialize gal into /tmp/UpperBounds17311835047108763649.gal : 26 ms
[2022-05-18 01:52:55] [INFO ] Time to serialize properties into /tmp/UpperBounds8461506666546984574.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17311835047108763649.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8461506666546984574.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds17311835047108763649.gal -t CGAL -reachable-file /tmp/UpperBounds8461506666546984574.prop --nowitness
Loading property file /tmp/UpperBounds8461506666546984574.prop.
Detected timeout of ITS tools.
[2022-05-18 02:13:44] [INFO ] Flatten gal took : 33 ms
[2022-05-18 02:13:44] [INFO ] Time to serialize gal into /tmp/UpperBounds17966242449649556527.gal : 673 ms
[2022-05-18 02:13:44] [INFO ] Time to serialize properties into /tmp/UpperBounds10325760689432925954.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17966242449649556527.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10325760689432925954.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds17966242449649556527.gal -t CGAL -reachable-file /tmp/UpperBounds10325760689432925954.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds10325760689432925954.prop.
Detected timeout of ITS tools.
[2022-05-18 02:34:33] [INFO ] Flatten gal took : 143 ms
[2022-05-18 02:34:34] [INFO ] Input system was already deterministic with 407 transitions.
[2022-05-18 02:34:34] [INFO ] Transformed 291 places.
[2022-05-18 02:34:34] [INFO ] Transformed 407 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 02:35:04] [INFO ] Time to serialize gal into /tmp/UpperBounds5628951854847630593.gal : 4 ms
[2022-05-18 02:35:04] [INFO ] Time to serialize properties into /tmp/UpperBounds13020492189795089557.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5628951854847630593.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13020492189795089557.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5628951854847630593.gal -t CGAL -reachable-file /tmp/UpperBounds13020492189795089557.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13020492189795089557.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PolyORBNT-PT-S05J20, 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 r179-tall-165277027100304"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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