About the Execution of 2022-gold for PolyORBNT-PT-S05J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.220 | 3600000.00 | 2669430.00 | 595239.00 | 1 1 1 1 1 1 3 41 1 ? 1 1 1 3 1 1 | normal |
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.r319-tall-167873970000092.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 gold2022
Input is PolyORBNT-PT-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873970000092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 34K Feb 25 23:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 23:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Feb 25 23:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 251K Feb 25 23:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Feb 25 23:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 217K Feb 25 23:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 168K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 755K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 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-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678878495398
Running Version 202205111006
[2023-03-15 11:08:17] [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]
[2023-03-15 11:08:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:08:17] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2023-03-15 11:08:17] [INFO ] Transformed 629 places.
[2023-03-15 11:08:17] [INFO ] Transformed 1590 transitions.
[2023-03-15 11:08:17] [INFO ] Parsed PT model containing 629 places and 1590 transitions in 420 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 931 out of 935 initially.
// Phase 1: matrix 931 rows 629 cols
[2023-03-15 11:08:17] [INFO ] Computed 102 place invariants in 93 ms
FORMULA PolyORBNT-PT-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-UpperBounds-07 41 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 693 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :18
FORMULA PolyORBNT-PT-S05J40-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 160 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :9
[2023-03-15 11:08:18] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-15 11:08:18] [INFO ] Computed 102 place invariants in 60 ms
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 76 positive place invariants in 35 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 26 ms returned unsat
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 76 positive place invariants in 52 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 28 ms returned unsat
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 76 positive place invariants in 27 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:20] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2023-03-15 11:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:08:20] [INFO ] [Nat]Absence check using 76 positive place invariants in 27 ms returned sat
[2023-03-15 11:08:20] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 37 ms returned unsat
[2023-03-15 11:08:20] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-15 11:08:20] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 25 ms returned sat
[2023-03-15 11:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:21] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2023-03-15 11:08:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:08:21] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-15 11:08:21] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-15 11:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:23] [INFO ] [Nat]Absence check using state equation in 1623 ms returned sat
[2023-03-15 11:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:08:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 94 ms returned sat
[2023-03-15 11:08:23] [INFO ] Deduced a trap composed of 343 places in 352 ms of which 3 ms to minimize.
[2023-03-15 11:08:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2023-03-15 11:08:24] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 89 ms.
[2023-03-15 11:08:24] [INFO ] Added : 9 causal constraints over 2 iterations in 442 ms. Result :sat
Minimization took 204 ms.
[2023-03-15 11:08:24] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-15 11:08:24] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 17 ms returned unsat
[2023-03-15 11:08:24] [INFO ] [Real]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-15 11:08:24] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 21 ms returned unsat
[2023-03-15 11:08:25] [INFO ] [Real]Absence check using 76 positive place invariants in 30 ms returned sat
[2023-03-15 11:08:25] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 33 ms returned unsat
[2023-03-15 11:08:25] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-15 11:08:25] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-15 11:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:25] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-15 11:08:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:08:25] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-15 11:08:26] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-15 11:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:27] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2023-03-15 11:08:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:08:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 3559 ms returned unknown
[2023-03-15 11:08:31] [INFO ] [Real]Absence check using 76 positive place invariants in 30 ms returned sat
[2023-03-15 11:08:31] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 26 ms returned unsat
[2023-03-15 11:08:31] [INFO ] [Real]Absence check using 76 positive place invariants in 30 ms returned sat
[2023-03-15 11:08:31] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned unsat
[2023-03-15 11:08:31] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-15 11:08:31] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-15 11:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:31] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2023-03-15 11:08:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:08:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-15 11:08:32] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-15 11:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:33] [INFO ] [Nat]Absence check using state equation in 1638 ms returned sat
[2023-03-15 11:08:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 88 ms returned sat
[2023-03-15 11:08:34] [INFO ] Deduced a trap composed of 343 places in 521 ms of which 2 ms to minimize.
[2023-03-15 11:08:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 614 ms
[2023-03-15 11:08:34] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 106 ms.
[2023-03-15 11:08:34] [INFO ] Added : 9 causal constraints over 2 iterations in 476 ms. Result :sat
Minimization took 220 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1] Max seen :[1, 1, 1, 0, 1, 1, 1, 3, 1, 1, 0]
FORMULA PolyORBNT-PT-S05J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 844
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 843
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 530 transition count 841
Applied a total of 193 rules in 196 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
[2023-03-15 11:08:35] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2023-03-15 11:08:35] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-15 11:08:36] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 530/629 places, 746/935 transitions.
Applied a total of 0 rules in 32 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/629 places, 746/935 transitions.
Normalized transition count is 742 out of 746 initially.
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:08:36] [INFO ] Computed 97 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 52112 resets, run finished after 5130 ms. (steps per millisecond=194 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4670 resets, run finished after 1344 ms. (steps per millisecond=744 ) properties (out of 1) seen :3
[2023-03-15 11:08:42] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:08:42] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-15 11:08:42] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-15 11:08:42] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-15 11:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:43] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2023-03-15 11:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:08:43] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-15 11:08:43] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-15 11:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:43] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-15 11:08:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:08:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 339 ms returned sat
[2023-03-15 11:08:43] [INFO ] Deduced a trap composed of 187 places in 193 ms of which 1 ms to minimize.
[2023-03-15 11:08:44] [INFO ] Deduced a trap composed of 180 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:08:44] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2023-03-15 11:08:44] [INFO ] Deduced a trap composed of 173 places in 190 ms of which 1 ms to minimize.
[2023-03-15 11:08:44] [INFO ] Deduced a trap composed of 177 places in 182 ms of which 1 ms to minimize.
[2023-03-15 11:08:45] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 0 ms to minimize.
[2023-03-15 11:08:45] [INFO ] Deduced a trap composed of 169 places in 189 ms of which 1 ms to minimize.
[2023-03-15 11:08:45] [INFO ] Deduced a trap composed of 170 places in 179 ms of which 1 ms to minimize.
[2023-03-15 11:08:45] [INFO ] Deduced a trap composed of 179 places in 178 ms of which 1 ms to minimize.
[2023-03-15 11:08:46] [INFO ] Deduced a trap composed of 176 places in 168 ms of which 1 ms to minimize.
[2023-03-15 11:08:46] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 0 ms to minimize.
[2023-03-15 11:08:46] [INFO ] Deduced a trap composed of 170 places in 172 ms of which 0 ms to minimize.
[2023-03-15 11:08:46] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-15 11:08:47] [INFO ] Deduced a trap composed of 176 places in 187 ms of which 0 ms to minimize.
[2023-03-15 11:08:47] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 1 ms to minimize.
[2023-03-15 11:08:47] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 1 ms to minimize.
[2023-03-15 11:08:47] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 1 ms to minimize.
[2023-03-15 11:08:48] [INFO ] Deduced a trap composed of 176 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:08:48] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 0 ms to minimize.
[2023-03-15 11:08:48] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 3 ms to minimize.
[2023-03-15 11:08:48] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 1 ms to minimize.
[2023-03-15 11:08:49] [INFO ] Deduced a trap composed of 155 places in 169 ms of which 0 ms to minimize.
[2023-03-15 11:08:49] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 1 ms to minimize.
[2023-03-15 11:08:50] [INFO ] Deduced a trap composed of 180 places in 166 ms of which 0 ms to minimize.
[2023-03-15 11:08:50] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 0 ms to minimize.
[2023-03-15 11:08:50] [INFO ] Deduced a trap composed of 177 places in 166 ms of which 0 ms to minimize.
[2023-03-15 11:08:51] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 1 ms to minimize.
[2023-03-15 11:08:52] [INFO ] Deduced a trap composed of 174 places in 164 ms of which 0 ms to minimize.
[2023-03-15 11:08:52] [INFO ] Deduced a trap composed of 182 places in 166 ms of which 0 ms to minimize.
[2023-03-15 11:08:52] [INFO ] Deduced a trap composed of 159 places in 218 ms of which 1 ms to minimize.
[2023-03-15 11:08:52] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 1 ms to minimize.
[2023-03-15 11:08:53] [INFO ] Deduced a trap composed of 179 places in 232 ms of which 1 ms to minimize.
[2023-03-15 11:08:53] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 3 ms to minimize.
[2023-03-15 11:08:53] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2023-03-15 11:08:56] [INFO ] Trap strengthening (SAT) tested/added 34/34 trap constraints in 13001 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 41 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 25 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 11:08:56] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:08:56] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 11:08:57] [INFO ] Implicit Places using invariants in 952 ms returned []
[2023-03-15 11:08:57] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:08:57] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 11:08:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:09:05] [INFO ] Implicit Places using invariants and state equation in 7487 ms returned []
Implicit Place search using SMT with State Equation took 8440 ms to find 0 implicit places.
[2023-03-15 11:09:05] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-15 11:09:05] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:05] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-15 11:09:05] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-09
Normalized transition count is 742 out of 746 initially.
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:06] [INFO ] Computed 97 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 507 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :3
[2023-03-15 11:09:06] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:06] [INFO ] Computed 97 place invariants in 14 ms
[2023-03-15 11:09:06] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-15 11:09:06] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-15 11:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:09:06] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2023-03-15 11:09:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:09:06] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-15 11:09:06] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-15 11:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:09:06] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-03-15 11:09:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:09:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 328 ms returned sat
[2023-03-15 11:09:07] [INFO ] Deduced a trap composed of 187 places in 184 ms of which 0 ms to minimize.
[2023-03-15 11:09:07] [INFO ] Deduced a trap composed of 180 places in 212 ms of which 1 ms to minimize.
[2023-03-15 11:09:07] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 4 ms to minimize.
[2023-03-15 11:09:08] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 1 ms to minimize.
[2023-03-15 11:09:08] [INFO ] Deduced a trap composed of 177 places in 221 ms of which 0 ms to minimize.
[2023-03-15 11:09:08] [INFO ] Deduced a trap composed of 179 places in 201 ms of which 0 ms to minimize.
[2023-03-15 11:09:08] [INFO ] Deduced a trap composed of 169 places in 210 ms of which 0 ms to minimize.
[2023-03-15 11:09:08] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 1 ms to minimize.
[2023-03-15 11:09:09] [INFO ] Deduced a trap composed of 179 places in 191 ms of which 0 ms to minimize.
[2023-03-15 11:09:09] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 0 ms to minimize.
[2023-03-15 11:09:09] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 1 ms to minimize.
[2023-03-15 11:09:10] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 0 ms to minimize.
[2023-03-15 11:09:10] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 11:09:10] [INFO ] Deduced a trap composed of 176 places in 245 ms of which 0 ms to minimize.
[2023-03-15 11:09:11] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 1 ms to minimize.
[2023-03-15 11:09:11] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:09:11] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 1 ms to minimize.
[2023-03-15 11:09:11] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 21 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 11:09:11] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:11] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 11:09:12] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Normalized transition count is 742 out of 746 initially.
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:12] [INFO ] Computed 97 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 52073 resets, run finished after 4879 ms. (steps per millisecond=204 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4637 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties (out of 1) seen :3
[2023-03-15 11:09:18] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:18] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-15 11:09:18] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-15 11:09:18] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-15 11:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:09:18] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2023-03-15 11:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:09:18] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-15 11:09:18] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-15 11:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:09:19] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-15 11:09:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:09:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 335 ms returned sat
[2023-03-15 11:09:19] [INFO ] Deduced a trap composed of 187 places in 189 ms of which 0 ms to minimize.
[2023-03-15 11:09:19] [INFO ] Deduced a trap composed of 180 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:09:20] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2023-03-15 11:09:20] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 5 ms to minimize.
[2023-03-15 11:09:20] [INFO ] Deduced a trap composed of 177 places in 179 ms of which 1 ms to minimize.
[2023-03-15 11:09:20] [INFO ] Deduced a trap composed of 179 places in 180 ms of which 0 ms to minimize.
[2023-03-15 11:09:20] [INFO ] Deduced a trap composed of 169 places in 180 ms of which 0 ms to minimize.
[2023-03-15 11:09:21] [INFO ] Deduced a trap composed of 170 places in 176 ms of which 0 ms to minimize.
[2023-03-15 11:09:21] [INFO ] Deduced a trap composed of 179 places in 193 ms of which 0 ms to minimize.
[2023-03-15 11:09:21] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 0 ms to minimize.
[2023-03-15 11:09:21] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 2 ms to minimize.
[2023-03-15 11:09:22] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 0 ms to minimize.
[2023-03-15 11:09:22] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 2 ms to minimize.
[2023-03-15 11:09:22] [INFO ] Deduced a trap composed of 176 places in 172 ms of which 2 ms to minimize.
[2023-03-15 11:09:22] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 12 ms to minimize.
[2023-03-15 11:09:23] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 2 ms to minimize.
[2023-03-15 11:09:23] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 1 ms to minimize.
[2023-03-15 11:09:23] [INFO ] Deduced a trap composed of 176 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:09:23] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:09:24] [INFO ] Deduced a trap composed of 167 places in 166 ms of which 1 ms to minimize.
[2023-03-15 11:09:24] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 0 ms to minimize.
[2023-03-15 11:09:25] [INFO ] Deduced a trap composed of 155 places in 170 ms of which 1 ms to minimize.
[2023-03-15 11:09:25] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 1 ms to minimize.
[2023-03-15 11:09:25] [INFO ] Deduced a trap composed of 180 places in 182 ms of which 0 ms to minimize.
[2023-03-15 11:09:26] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 0 ms to minimize.
[2023-03-15 11:09:26] [INFO ] Deduced a trap composed of 177 places in 160 ms of which 1 ms to minimize.
[2023-03-15 11:09:26] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 1 ms to minimize.
[2023-03-15 11:09:27] [INFO ] Deduced a trap composed of 174 places in 190 ms of which 0 ms to minimize.
[2023-03-15 11:09:28] [INFO ] Deduced a trap composed of 182 places in 226 ms of which 1 ms to minimize.
[2023-03-15 11:09:28] [INFO ] Deduced a trap composed of 159 places in 190 ms of which 0 ms to minimize.
[2023-03-15 11:09:28] [INFO ] Deduced a trap composed of 173 places in 183 ms of which 0 ms to minimize.
[2023-03-15 11:09:28] [INFO ] Deduced a trap composed of 179 places in 165 ms of which 0 ms to minimize.
[2023-03-15 11:09:28] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2023-03-15 11:09:29] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 0 ms to minimize.
[2023-03-15 11:09:32] [INFO ] Trap strengthening (SAT) tested/added 34/34 trap constraints in 12872 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 32 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 19 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 11:09:32] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:32] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-15 11:09:33] [INFO ] Implicit Places using invariants in 745 ms returned []
[2023-03-15 11:09:33] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:33] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-15 11:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:09:39] [INFO ] Implicit Places using invariants and state equation in 6393 ms returned []
Implicit Place search using SMT with State Equation took 7154 ms to find 0 implicit places.
[2023-03-15 11:09:39] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 11:09:39] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 11:09:39] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-15 11:09:40] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-09 in 34123 ms.
[2023-03-15 11:09:40] [INFO ] Flatten gal took : 113 ms
[2023-03-15 11:09:40] [INFO ] Applying decomposition
[2023-03-15 11:09:40] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5715211106790362594.txt' '-o' '/tmp/graph5715211106790362594.bin' '-w' '/tmp/graph5715211106790362594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5715211106790362594.bin' '-l' '-1' '-v' '-w' '/tmp/graph5715211106790362594.weights' '-q' '0' '-e' '0.001'
[2023-03-15 11:09:40] [INFO ] Decomposing Gal with order
[2023-03-15 11:09:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 11:09:40] [INFO ] Removed a total of 844 redundant transitions.
[2023-03-15 11:09:41] [INFO ] Flatten gal took : 207 ms
[2023-03-15 11:09:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 21 ms.
[2023-03-15 11:09:41] [INFO ] Time to serialize gal into /tmp/UpperBounds17962265264648143490.gal : 15 ms
[2023-03-15 11:09:41] [INFO ] Time to serialize properties into /tmp/UpperBounds16010230408239865561.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17962265264648143490.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16010230408239865561.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds16010230408239865561.prop.
Detected timeout of ITS tools.
[2023-03-15 11:30:27] [INFO ] Flatten gal took : 16876 ms
[2023-03-15 11:30:28] [INFO ] Time to serialize gal into /tmp/UpperBounds15093076292219998050.gal : 221 ms
[2023-03-15 11:30:28] [INFO ] Time to serialize properties into /tmp/UpperBounds1797507081535961921.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15093076292219998050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1797507081535961921.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds1797507081535961921.prop.
Detected timeout of ITS tools.
[2023-03-15 11:51:13] [INFO ] Flatten gal took : 466 ms
[2023-03-15 11:51:15] [INFO ] Input system was already deterministic with 746 transitions.
[2023-03-15 11:51:15] [INFO ] Transformed 530 places.
[2023-03-15 11:51:15] [INFO ] Transformed 746 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 11:51:45] [INFO ] Time to serialize gal into /tmp/UpperBounds12794121577861766752.gal : 12 ms
[2023-03-15 11:51:45] [INFO ] Time to serialize properties into /tmp/UpperBounds15498826125577752941.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12794121577861766752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15498826125577752941.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15498826125577752941.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is PolyORBNT-PT-S05J40, 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 r319-tall-167873970000092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 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 '
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 ;