Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789300436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:43 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 ShieldPPPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716992279344

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-29 14:18:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:18:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:18:01] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-05-29 14:18:01] [INFO ] Transformed 7803 places.
[2024-05-29 14:18:01] [INFO ] Transformed 7103 transitions.
[2024-05-29 14:18:01] [INFO ] Found NUPN structural information;
[2024-05-29 14:18:01] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 659 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 7103 rows 7803 cols
[2024-05-29 14:18:02] [INFO ] Computed 1101 invariants in 87 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
[2024-05-29 14:18:02] [INFO ] Invariant cache hit.
[2024-05-29 14:18:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 788 ms returned sat
[2024-05-29 14:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:07] [INFO ] [Real]Absence check using state equation in 2145 ms returned unknown
[2024-05-29 14:18:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 829 ms returned sat
[2024-05-29 14:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:12] [INFO ] [Real]Absence check using state equation in 2707 ms returned unknown
[2024-05-29 14:18:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 830 ms returned sat
[2024-05-29 14:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:17] [INFO ] [Real]Absence check using state equation in 3032 ms returned unknown
[2024-05-29 14:18:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 813 ms returned sat
[2024-05-29 14:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:22] [INFO ] [Real]Absence check using state equation in 3029 ms returned unknown
[2024-05-29 14:18:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 790 ms returned sat
[2024-05-29 14:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:28] [INFO ] [Real]Absence check using state equation in 2882 ms returned unknown
[2024-05-29 14:18:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 786 ms returned sat
[2024-05-29 14:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:33] [INFO ] [Real]Absence check using state equation in 2921 ms returned unknown
[2024-05-29 14:18:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 790 ms returned sat
[2024-05-29 14:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:38] [INFO ] [Real]Absence check using state equation in 2936 ms returned unknown
[2024-05-29 14:18:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 768 ms returned sat
[2024-05-29 14:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:43] [INFO ] [Real]Absence check using state equation in 2980 ms returned unknown
[2024-05-29 14:18:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 799 ms returned sat
[2024-05-29 14:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:48] [INFO ] [Real]Absence check using state equation in 2896 ms returned unknown
[2024-05-29 14:18:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 789 ms returned sat
[2024-05-29 14:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:53] [INFO ] [Real]Absence check using state equation in 2915 ms returned unknown
[2024-05-29 14:18:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 786 ms returned sat
[2024-05-29 14:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:58] [INFO ] [Real]Absence check using state equation in 2939 ms returned unknown
[2024-05-29 14:19:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 814 ms returned sat
[2024-05-29 14:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:19:03] [INFO ] [Real]Absence check using state equation in 2912 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1892 transitions
Trivial Post-agglo rules discarded 1892 transitions
Performed 1892 trivial Post agglomeration. Transition count delta: 1892
Iterating post reduction 0 with 1892 rules applied. Total rules applied 1892 place count 7803 transition count 5211
Reduce places removed 1892 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1894 rules applied. Total rules applied 3786 place count 5911 transition count 5209
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 3793 place count 5910 transition count 5203
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 3799 place count 5904 transition count 5203
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 398 Pre rules applied. Total rules applied 3799 place count 5904 transition count 4805
Deduced a syphon composed of 398 places in 20 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 4 with 796 rules applied. Total rules applied 4595 place count 5506 transition count 4805
Discarding 700 places :
Symmetric choice reduction at 4 with 700 rule applications. Total rules 5295 place count 4806 transition count 4105
Iterating global reduction 4 with 700 rules applied. Total rules applied 5995 place count 4806 transition count 4105
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 297 Pre rules applied. Total rules applied 5995 place count 4806 transition count 3808
Deduced a syphon composed of 297 places in 16 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 4 with 594 rules applied. Total rules applied 6589 place count 4509 transition count 3808
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 91 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 4 with 3396 rules applied. Total rules applied 9985 place count 2811 transition count 2110
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10187 place count 2710 transition count 2110
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10389 place count 2609 transition count 2110
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 5 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 10573 place count 2517 transition count 2110
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 10575 place count 2517 transition count 2108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 10577 place count 2515 transition count 2108
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 5 with 297 rules applied. Total rules applied 10874 place count 2515 transition count 2108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10875 place count 2514 transition count 2107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10876 place count 2513 transition count 2107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10876 place count 2513 transition count 2105
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10880 place count 2511 transition count 2105
Applied a total of 10880 rules in 3373 ms. Remains 2511 /7803 variables (removed 5292) and now considering 2105/7103 (removed 4998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3374 ms. Remains : 2511/7803 places, 2105/7103 transitions.
// Phase 1: matrix 2105 rows 2511 cols
[2024-05-29 14:19:06] [INFO ] Computed 1100 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15681 ms. (steps per millisecond=63 ) properties (out of 12) seen :3
FORMULA ShieldPPPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 450997 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 446149 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 452614 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 462270 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 466004 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
Interrupted Best-First random walk after 460071 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 2
FORMULA ShieldPPPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 453322 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
[2024-05-29 14:19:57] [INFO ] Invariant cache hit.
[2024-05-29 14:19:57] [INFO ] [Real]Absence check using 1100 positive place invariants in 221 ms returned sat
[2024-05-29 14:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:19:58] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2024-05-29 14:19:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:19:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 229 ms returned sat
[2024-05-29 14:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:20:00] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2024-05-29 14:20:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:20:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-29 14:20:00] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 5 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2024-05-29 14:20:01] [INFO ] Computed and/alt/rep : 2101/4948/2101 causal constraints (skipped 0 transitions) in 196 ms.
[2024-05-29 14:20:21] [INFO ] Added : 850 causal constraints over 170 iterations in 20067 ms.(timeout) Result :sat
Minimization took 439 ms.
[2024-05-29 14:20:22] [INFO ] [Real]Absence check using 1100 positive place invariants in 226 ms returned sat
[2024-05-29 14:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:20:23] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2024-05-29 14:20:23] [INFO ] [Real]Added 3 Read/Feed constraints in 13 ms returned sat
[2024-05-29 14:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:20:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 224 ms returned sat
[2024-05-29 14:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:20:24] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2024-05-29 14:20:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2024-05-29 14:20:25] [INFO ] Computed and/alt/rep : 2101/4948/2101 causal constraints (skipped 0 transitions) in 118 ms.
[2024-05-29 14:20:45] [INFO ] Added : 875 causal constraints over 175 iterations in 20219 ms.(timeout) Result :sat
Minimization took 457 ms.
[2024-05-29 14:20:46] [INFO ] [Real]Absence check using 1100 positive place invariants in 219 ms returned sat
[2024-05-29 14:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:20:47] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2024-05-29 14:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:20:47] [INFO ] [Nat]Absence check using 1100 positive place invariants in 223 ms returned sat
[2024-05-29 14:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:20:48] [INFO ] [Nat]Absence check using state equation in 1045 ms returned sat
[2024-05-29 14:20:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-29 14:20:49] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 2 ms to minimize.
[2024-05-29 14:20:49] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:20:49] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:20:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 858 ms
[2024-05-29 14:20:49] [INFO ] Computed and/alt/rep : 2101/4948/2101 causal constraints (skipped 0 transitions) in 109 ms.
[2024-05-29 14:21:09] [INFO ] Added : 865 causal constraints over 173 iterations in 20091 ms.(timeout) Result :sat
Minimization took 462 ms.
[2024-05-29 14:21:10] [INFO ] [Real]Absence check using 1100 positive place invariants in 225 ms returned sat
[2024-05-29 14:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:11] [INFO ] [Real]Absence check using state equation in 1047 ms returned sat
[2024-05-29 14:21:12] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-29 14:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:21:12] [INFO ] [Nat]Absence check using 1100 positive place invariants in 224 ms returned sat
[2024-05-29 14:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:13] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2024-05-29 14:21:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-29 14:21:13] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2024-05-29 14:21:14] [INFO ] Computed and/alt/rep : 2101/4948/2101 causal constraints (skipped 0 transitions) in 113 ms.
[2024-05-29 14:21:34] [INFO ] Added : 875 causal constraints over 175 iterations in 20151 ms.(timeout) Result :sat
Minimization took 521 ms.
[2024-05-29 14:21:35] [INFO ] [Real]Absence check using 1100 positive place invariants in 227 ms returned sat
[2024-05-29 14:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:36] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2024-05-29 14:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:21:36] [INFO ] [Nat]Absence check using 1100 positive place invariants in 224 ms returned sat
[2024-05-29 14:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:21:37] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2024-05-29 14:21:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-29 14:21:38] [INFO ] Computed and/alt/rep : 2101/4948/2101 causal constraints (skipped 0 transitions) in 114 ms.
[2024-05-29 14:21:58] [INFO ] Added : 870 causal constraints over 174 iterations in 20101 ms.(timeout) Result :sat
Minimization took 463 ms.
[2024-05-29 14:21:59] [INFO ] [Real]Absence check using 1100 positive place invariants in 216 ms returned sat
[2024-05-29 14:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:22:00] [INFO ] [Real]Absence check using state equation in 1032 ms returned sat
[2024-05-29 14:22:00] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-05-29 14:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:22:00] [INFO ] [Nat]Absence check using 1100 positive place invariants in 219 ms returned sat
[2024-05-29 14:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:22:01] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2024-05-29 14:22:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:22:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 535 ms
[2024-05-29 14:22:02] [INFO ] Computed and/alt/rep : 2101/4948/2101 causal constraints (skipped 0 transitions) in 109 ms.
[2024-05-29 14:22:22] [INFO ] Added : 875 causal constraints over 175 iterations in 20073 ms.(timeout) Result :sat
Minimization took 421 ms.
[2024-05-29 14:22:23] [INFO ] [Real]Absence check using 1100 positive place invariants in 226 ms returned sat
[2024-05-29 14:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:22:24] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2024-05-29 14:22:24] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-29 14:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:22:25] [INFO ] [Nat]Absence check using 1100 positive place invariants in 230 ms returned sat
[2024-05-29 14:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:22:26] [INFO ] [Nat]Absence check using state equation in 1060 ms returned sat
[2024-05-29 14:22:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-29 14:22:26] [INFO ] Computed and/alt/rep : 2101/4948/2101 causal constraints (skipped 0 transitions) in 110 ms.
[2024-05-29 14:22:46] [INFO ] Added : 875 causal constraints over 175 iterations in 20031 ms.(timeout) Result :sat
Minimization took 496 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 288050 ms.

BK_STOP 1716992570313

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-100B, 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 r373-tall-171683789300436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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