Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Apr 29 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 12:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 12:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 905K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652793704280

Running Version 202205111006
[2022-05-17 13:21:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 13:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:21:45] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2022-05-17 13:21:45] [INFO ] Transformed 1542 places.
[2022-05-17 13:21:45] [INFO ] Transformed 1449 transitions.
[2022-05-17 13:21:45] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 355 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1449 rows 1542 cols
[2022-05-17 13:21:46] [INFO ] Computed 93 place invariants in 126 ms
Incomplete random walk after 10000 steps, including 384 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 16) seen :17
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :4
// Phase 1: matrix 1449 rows 1542 cols
[2022-05-17 13:21:46] [INFO ] Computed 93 place invariants in 101 ms
[2022-05-17 13:21:46] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2022-05-17 13:21:46] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 42 ms returned sat
[2022-05-17 13:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:21:47] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2022-05-17 13:21:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 13:21:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-17 13:21:47] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 31 ms returned sat
[2022-05-17 13:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 13:21:48] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-05-17 13:21:48] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 80 ms.
[2022-05-17 13:21:48] [INFO ] Added : 17 causal constraints over 4 iterations in 496 ms. Result :sat
Minimization took 101 ms.
[2022-05-17 13:21:49] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-17 13:21:49] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 36 ms returned sat
[2022-05-17 13:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:21:49] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2022-05-17 13:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 13:21:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2022-05-17 13:21:49] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 34 ms returned sat
[2022-05-17 13:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 13:21:50] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2022-05-17 13:21:50] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 75 ms.
[2022-05-17 13:21:50] [INFO ] Added : 17 causal constraints over 4 iterations in 470 ms. Result :sat
Minimization took 100 ms.
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 8 ms returned unsat
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 36 ms returned unsat
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 38 ms returned unsat
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-17 13:21:51] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1, 1, 1] Max seen :[2, 2, 1, 1, 1, 1]
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1542 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 105 are kept as prefixes of interest. Removing 1437 places using SCC suffix rule.8 ms
Discarding 1437 places :
Also discarding 834 output transitions
Drop transitions removed 834 transitions
Drop transitions removed 307 transitions
Reduce isomorphic transitions removed 307 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 339 rules applied. Total rules applied 340 place count 89 transition count 292
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 358 place count 71 transition count 292
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 358 place count 71 transition count 290
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 362 place count 69 transition count 290
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 376 place count 55 transition count 276
Iterating global reduction 2 with 14 rules applied. Total rules applied 390 place count 55 transition count 276
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 404 place count 41 transition count 262
Iterating global reduction 2 with 14 rules applied. Total rules applied 418 place count 41 transition count 262
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 420 place count 39 transition count 262
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 420 place count 39 transition count 260
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 424 place count 37 transition count 260
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 440 place count 37 transition count 244
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 456 place count 21 transition count 244
Applied a total of 456 rules in 66 ms. Remains 21 /1542 variables (removed 1521) and now considering 244/1449 (removed 1205) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/1542 places, 244/1449 transitions.
Successfully produced net in file /tmp/petri1000_16405818574310071124.dot
Successfully produced net in file /tmp/petri1001_3076193920009444124.dot
Successfully produced net in file /tmp/petri1002_18418793608566615302.dot
Successfully produced net in file /tmp/petri1003_1396836478944951935.dot
Successfully produced net in file /tmp/petri1004_9269750655938574172.dot
Successfully produced net in file /tmp/petri1005_5799371956074215076.dot
Successfully produced net in file /tmp/petri1006_7585204401344324901.dot
Successfully produced net in file /tmp/petri1007_16903600112054245654.dot
Successfully produced net in file /tmp/petri1008_804923792401358579.dot
Successfully produced net in file /tmp/petri1009_14297979720911227201.dot
Successfully produced net in file /tmp/petri1010_8419398158080996701.dot
Successfully produced net in file /tmp/petri1011_14124777991195873067.dot
Successfully produced net in file /tmp/petri1012_10168654470743378205.dot
Successfully produced net in file /tmp/petri1013_6892461760609854465.dot
Successfully produced net in file /tmp/petri1014_5074818356894793921.dot
Successfully produced net in file /tmp/petri1015_17776880421723070737.dot
Successfully produced net in file /tmp/petri1016_17268610543901106080.dot
Successfully produced net in file /tmp/petri1017_14018092281513003373.dot
Successfully produced net in file /tmp/petri1018_8811440501510748811.dot
Successfully produced net in file /tmp/petri1019_5780707592148705408.dot
Successfully produced net in file /tmp/petri1020_2354800601666767030.dot
Successfully produced net in file /tmp/petri1021_3579762139908940361.dot
Successfully produced net in file /tmp/petri1022_14971284122297235701.dot
Successfully produced net in file /tmp/petri1023_9383667871956069727.dot
Successfully produced net in file /tmp/petri1024_17543317505997870753.dot
Successfully produced net in file /tmp/petri1025_16380423992461317443.dot
Successfully produced net in file /tmp/petri1026_10458893197189096725.dot
Successfully produced net in file /tmp/petri1027_16237533839637851281.dot
Successfully produced net in file /tmp/petri1028_1605973535767641734.dot
Successfully produced net in file /tmp/petri1029_12073330995269982807.dot
Successfully produced net in file /tmp/petri1030_1150679876931090315.dot
Successfully produced net in file /tmp/petri1031_18272483247095367594.dot
Successfully produced net in file /tmp/petri1032_3729807472237632880.dot
Successfully produced net in file /tmp/petri1033_8931701347871502671.dot
Successfully produced net in file /tmp/petri1034_16895035609417565065.dot
Successfully produced net in file /tmp/petri1035_5016211181264404430.dot
Successfully produced net in file /tmp/petri1036_17257728296549603066.dot
Successfully produced net in file /tmp/petri1037_599234596573745726.dot
Successfully produced net in file /tmp/petri1038_9371552123773925364.dot
Successfully produced net in file /tmp/petri1039_1171892931739306936.dot
Successfully produced net in file /tmp/petri1040_10854659948239412614.dot
Successfully produced net in file /tmp/petri1041_4953840274025004329.dot
Successfully produced net in file /tmp/petri1042_11841491793065689088.dot
Successfully produced net in file /tmp/petri1043_11962795006959566893.dot
Successfully produced net in file /tmp/petri1044_11095766378451455893.dot
Successfully produced net in file /tmp/petri1045_8728572129895993942.dot
Successfully produced net in file /tmp/petri1046_2614361459266659098.dot
Successfully produced net in file /tmp/petri1047_265559110047351637.dot
Successfully produced net in file /tmp/petri1048_18419289743290619925.dot
Successfully produced net in file /tmp/petri1049_13364149774101891672.dot
Successfully produced net in file /tmp/petri1050_13827060461435030021.dot
Successfully produced net in file /tmp/petri1051_2295146974418869486.dot
Successfully produced net in file /tmp/petri1052_12596898406730025337.dot
Successfully produced net in file /tmp/petri1053_6061435683571175752.dot
Successfully produced net in file /tmp/petri1054_18434933114685953483.dot
Successfully produced net in file /tmp/petri1055_10618024369472736206.dot
Successfully produced net in file /tmp/petri1056_7480551622493364321.dot
Successfully produced net in file /tmp/petri1057_8860850054221372540.dot
Successfully produced net in file /tmp/petri1058_12098302996112905050.dot
Successfully produced net in file /tmp/petri1059_11751387553796133556.dot
Successfully produced net in file /tmp/petri1060_2291803161217739367.dot
Successfully produced net in file /tmp/petri1061_15316998253463263158.dot
Successfully produced net in file /tmp/petri1062_16445107479370199272.dot
Successfully produced net in file /tmp/petri1063_14214126381646372483.dot
Successfully produced net in file /tmp/petri1064_16843213169400080817.dot
Successfully produced net in file /tmp/petri1065_17348234935804119946.dot
Successfully produced net in file /tmp/petri1066_15877074060839574960.dot
Successfully produced net in file /tmp/petri1067_1314310895137937281.dot
Successfully produced net in file /tmp/petri1068_12622664204434457442.dot
Successfully produced net in file /tmp/petri1069_8242368559876561007.dot
Successfully produced net in file /tmp/petri1070_14889388139628443948.dot
Successfully produced net in file /tmp/petri1071_7548286779959548137.dot
Successfully produced net in file /tmp/petri1072_4286015119899171958.dot
Successfully produced net in file /tmp/petri1073_8677109500846076984.dot
Successfully produced net in file /tmp/petri1074_12568157258016816756.dot
Successfully produced net in file /tmp/petri1075_5113945827890403675.dot
Successfully produced net in file /tmp/petri1076_12904927985549521488.dot
Successfully produced net in file /tmp/petri1077_13144520196430858175.dot
Successfully produced net in file /tmp/petri1078_14595458985689698605.dot
Successfully produced net in file /tmp/petri1079_1080724595655750045.dot
Successfully produced net in file /tmp/petri1080_17207035334685530082.dot
Successfully produced net in file /tmp/petri1081_238573138169751998.dot
Successfully produced net in file /tmp/petri1082_13927257325165122660.dot
Successfully produced net in file /tmp/petri1083_10949255310838249690.dot
Successfully produced net in file /tmp/petri1084_1573446154630549460.dot
Successfully produced net in file /tmp/petri1085_11764043338850782097.dot
Successfully produced net in file /tmp/petri1086_11876935609348485007.dot
Successfully produced net in file /tmp/petri1087_14384952112492900783.dot
Successfully produced net in file /tmp/petri1088_3457906817516360249.dot
Successfully produced net in file /tmp/petri1089_4484644201928437335.dot
Successfully produced net in file /tmp/petri1090_6886657034117006887.dot
Successfully produced net in file /tmp/petri1091_15716443373536297552.dot
Successfully produced net in file /tmp/petri1092_8855584715777870487.dot
Successfully produced net in file /tmp/petri1093_4430807101413625150.dot
Successfully produced net in file /tmp/petri1094_17668334572963942995.dot
Successfully produced net in file /tmp/petri1095_1014093517631477663.dot
Successfully produced net in file /tmp/petri1096_479670302383516660.dot
Successfully produced net in file /tmp/petri1097_4337889056108957967.dot
Successfully produced net in file /tmp/petri1098_13722655798448726730.dot
Successfully produced net in file /tmp/petri1099_5614946357851066156.dot
Successfully produced net in file /tmp/petri1100_10890977756972130958.dot
Successfully produced net in file /tmp/petri1101_2998732484307220919.dot
Successfully produced net in file /tmp/petri1102_15208131131057917796.dot
Successfully produced net in file /tmp/petri1103_13536445017309879106.dot
Successfully produced net in file /tmp/petri1104_17869359469481564184.dot
Drop transitions removed 105 transitions
Dominated transitions for bounds rules discarded 105 transitions
Normalized transition count is 35 out of 139 initially.
// Phase 1: matrix 35 rows 21 cols
[2022-05-17 13:21:51] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 132230 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 9112 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 9131 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 2) seen :6
[2022-05-17 13:21:54] [INFO ] Flow matrix only has 35 transitions (discarded 104 similar events)
// Phase 1: matrix 35 rows 21 cols
[2022-05-17 13:21:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 13:21:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 13:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:21:54] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 13:21:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 13:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:21:54] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 3] Max seen :[3, 3]
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9195 ms.

BK_STOP 1652793714776

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S16C3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S16C3, 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 r132-tall-165271820900485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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