About the Execution of 2021-gold for LeafsetExtension-PT-S16C3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
282.827 | 11512.00 | 20347.00 | 334.40 | 1 1 3 3 1 1 1 1 1 1 1 1 1 1 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/mcc2022-input.r143-tall-165271830300181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is LeafsetExtension-PT-S16C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830300181
=====================================================================
--------------------
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 1652743374697
Running Version 0
[2022-05-16 23:22:56] [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-16 23:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:22:56] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2022-05-16 23:22:56] [INFO ] Transformed 1542 places.
[2022-05-16 23:22:56] [INFO ] Transformed 1449 transitions.
[2022-05-16 23:22:56] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1449 rows 1542 cols
[2022-05-16 23:22:56] [INFO ] Computed 93 place invariants in 137 ms
Incomplete random walk after 10000 steps, including 384 resets, run finished after 62 ms. (steps per millisecond=161 ) 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 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :4
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 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :4
// Phase 1: matrix 1449 rows 1542 cols
[2022-05-16 23:22:56] [INFO ] Computed 93 place invariants in 149 ms
[2022-05-16 23:22:57] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2022-05-16 23:22:57] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 41 ms returned sat
[2022-05-16 23:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:22:57] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2022-05-16 23:22:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:22:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2022-05-16 23:22:58] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 32 ms returned sat
[2022-05-16 23:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:22:58] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-05-16 23:22:58] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 87 ms.
[2022-05-16 23:22:59] [INFO ] Added : 14 causal constraints over 3 iterations in 442 ms. Result :sat
Minimization took 102 ms.
[2022-05-16 23:22:59] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2022-05-16 23:22:59] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 35 ms returned sat
[2022-05-16 23:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:22:59] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-05-16 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:23:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-16 23:23:00] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 35 ms returned sat
[2022-05-16 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:23:00] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2022-05-16 23:23:00] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 80 ms.
[2022-05-16 23:23:01] [INFO ] Added : 23 causal constraints over 5 iterations in 537 ms. Result :sat
Minimization took 144 ms.
[2022-05-16 23:23:01] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-16 23:23:01] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 10 ms returned unsat
[2022-05-16 23:23:01] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-16 23:23:01] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 31 ms returned unsat
[2022-05-16 23:23:01] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-16 23:23:02] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 42 ms returned unsat
[2022-05-16 23:23:02] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-16 23:23:02] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 38 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1, 1, 1] Max seen :[2, 1, 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
Incomplete Parikh walk after 1800 steps, including 95 resets, run finished after 6 ms. (steps per millisecond=300 ) properties (out of 2) seen :3 could not realise parikh vector
Incomplete Parikh walk after 1800 steps, including 95 resets, run finished after 8 ms. (steps per millisecond=225 ) properties (out of 2) seen :3 could not realise parikh vector
Support contains 2 out of 1542 places. Attempting structural reductions.
Starting structural reductions, 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.5 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 0 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 61 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_18207494789738122129.dot
Successfully produced net in file /tmp/petri1001_6033799890099596558.dot
Successfully produced net in file /tmp/petri1002_1762225261436742944.dot
Successfully produced net in file /tmp/petri1003_4533792809166327022.dot
Successfully produced net in file /tmp/petri1004_9374477985232587753.dot
Successfully produced net in file /tmp/petri1005_13312656183812084382.dot
Successfully produced net in file /tmp/petri1006_6439398013400774278.dot
Successfully produced net in file /tmp/petri1007_9271746315527000055.dot
Successfully produced net in file /tmp/petri1008_1116521139710244859.dot
Successfully produced net in file /tmp/petri1009_10740414971193523071.dot
Successfully produced net in file /tmp/petri1010_2331538318556451074.dot
Successfully produced net in file /tmp/petri1011_15454639677865638209.dot
Successfully produced net in file /tmp/petri1012_8083442422031577790.dot
Successfully produced net in file /tmp/petri1013_7987509504530368649.dot
Successfully produced net in file /tmp/petri1014_18077072065339825973.dot
Successfully produced net in file /tmp/petri1015_2220426633461949555.dot
Successfully produced net in file /tmp/petri1016_14430879476088942586.dot
Successfully produced net in file /tmp/petri1017_3574798742446861379.dot
Successfully produced net in file /tmp/petri1018_5473303500824060718.dot
Successfully produced net in file /tmp/petri1019_7197642420176002207.dot
Successfully produced net in file /tmp/petri1020_8743161141208117674.dot
Successfully produced net in file /tmp/petri1021_8127003877490604036.dot
Successfully produced net in file /tmp/petri1022_9536963646921837705.dot
Successfully produced net in file /tmp/petri1023_17351798945811185972.dot
Successfully produced net in file /tmp/petri1024_4729806199089746830.dot
Successfully produced net in file /tmp/petri1025_4816719038674036651.dot
Successfully produced net in file /tmp/petri1026_17860985724788711034.dot
Successfully produced net in file /tmp/petri1027_17276655863102239986.dot
Successfully produced net in file /tmp/petri1028_10941240696722667759.dot
Successfully produced net in file /tmp/petri1029_14643580577198660771.dot
Successfully produced net in file /tmp/petri1030_2855483105683442514.dot
Successfully produced net in file /tmp/petri1031_4529260060892633180.dot
Successfully produced net in file /tmp/petri1032_6894956848559432305.dot
Successfully produced net in file /tmp/petri1033_6049353615741594975.dot
Successfully produced net in file /tmp/petri1034_6693784418336834895.dot
Successfully produced net in file /tmp/petri1035_8667984600246891847.dot
Successfully produced net in file /tmp/petri1036_9589396370564337496.dot
Successfully produced net in file /tmp/petri1037_10159382959969724332.dot
Successfully produced net in file /tmp/petri1038_12657946190867574781.dot
Successfully produced net in file /tmp/petri1039_10452762632992619005.dot
Successfully produced net in file /tmp/petri1040_15852882448235692984.dot
Successfully produced net in file /tmp/petri1041_1247547541382734194.dot
Successfully produced net in file /tmp/petri1042_12670228494976595699.dot
Successfully produced net in file /tmp/petri1043_16863890064188133983.dot
Successfully produced net in file /tmp/petri1044_7172185178333268974.dot
Successfully produced net in file /tmp/petri1045_9229656152591575024.dot
Successfully produced net in file /tmp/petri1046_4239803884895476242.dot
Successfully produced net in file /tmp/petri1047_7824663708608516829.dot
Successfully produced net in file /tmp/petri1048_15794430730280466790.dot
Successfully produced net in file /tmp/petri1049_2008412539670789372.dot
Successfully produced net in file /tmp/petri1050_13035081880164844874.dot
Successfully produced net in file /tmp/petri1051_9848821704315172742.dot
Successfully produced net in file /tmp/petri1052_17231267849286945760.dot
Successfully produced net in file /tmp/petri1053_4490084017849487957.dot
Successfully produced net in file /tmp/petri1054_16627321918390044330.dot
Successfully produced net in file /tmp/petri1055_15905564182109342455.dot
Successfully produced net in file /tmp/petri1056_10583341097034477589.dot
Successfully produced net in file /tmp/petri1057_4641993260535167801.dot
Successfully produced net in file /tmp/petri1058_11031848085600582464.dot
Successfully produced net in file /tmp/petri1059_8130301366997929386.dot
Successfully produced net in file /tmp/petri1060_1369792437189321261.dot
Successfully produced net in file /tmp/petri1061_11467536833896845470.dot
Successfully produced net in file /tmp/petri1062_17606501290636334168.dot
Successfully produced net in file /tmp/petri1063_9187618877250302874.dot
Successfully produced net in file /tmp/petri1064_14473119755027674672.dot
Successfully produced net in file /tmp/petri1065_7120360019204095158.dot
Successfully produced net in file /tmp/petri1066_16187489453194593170.dot
Successfully produced net in file /tmp/petri1067_13509494726211299030.dot
Successfully produced net in file /tmp/petri1068_5938480309883771258.dot
Successfully produced net in file /tmp/petri1069_16208522923546714752.dot
Successfully produced net in file /tmp/petri1070_4178458553759520861.dot
Successfully produced net in file /tmp/petri1071_11614677061806423098.dot
Successfully produced net in file /tmp/petri1072_15193195213636473984.dot
Successfully produced net in file /tmp/petri1073_11473786879265256168.dot
Successfully produced net in file /tmp/petri1074_7106452004487558915.dot
Successfully produced net in file /tmp/petri1075_8981462494105367007.dot
Successfully produced net in file /tmp/petri1076_5831418103162151660.dot
Successfully produced net in file /tmp/petri1077_806389695907680611.dot
Successfully produced net in file /tmp/petri1078_18416876527007061302.dot
Successfully produced net in file /tmp/petri1079_1528373666347306199.dot
Successfully produced net in file /tmp/petri1080_15774160957939241158.dot
Successfully produced net in file /tmp/petri1081_7820290029996452316.dot
Successfully produced net in file /tmp/petri1082_4109572401592788340.dot
Successfully produced net in file /tmp/petri1083_18316675232038420485.dot
Successfully produced net in file /tmp/petri1084_11398029678775824747.dot
Successfully produced net in file /tmp/petri1085_1610107082883355024.dot
Successfully produced net in file /tmp/petri1086_5265264809633646223.dot
Successfully produced net in file /tmp/petri1087_17957336856867713968.dot
Successfully produced net in file /tmp/petri1088_7993739216710331309.dot
Successfully produced net in file /tmp/petri1089_4556433295979916679.dot
Successfully produced net in file /tmp/petri1090_17531737778271588010.dot
Successfully produced net in file /tmp/petri1091_6533823088882527054.dot
Successfully produced net in file /tmp/petri1092_755310001651457191.dot
Successfully produced net in file /tmp/petri1093_796823882801065027.dot
Successfully produced net in file /tmp/petri1094_14638573783532870942.dot
Successfully produced net in file /tmp/petri1095_7124234597157147697.dot
Successfully produced net in file /tmp/petri1096_14861142816234506739.dot
Successfully produced net in file /tmp/petri1097_15844120238461044593.dot
Successfully produced net in file /tmp/petri1098_1624269943452766057.dot
Successfully produced net in file /tmp/petri1099_369604049844671117.dot
Successfully produced net in file /tmp/petri1100_271007828274315999.dot
Successfully produced net in file /tmp/petri1101_14367853254062966131.dot
Successfully produced net in file /tmp/petri1102_7289444085346879414.dot
Successfully produced net in file /tmp/petri1103_16938707626333526282.dot
Successfully produced net in file /tmp/petri1104_7359930978986010912.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-16 23:23:02] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 132283 resets, run finished after 1679 ms. (steps per millisecond=595 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 9131 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 9141 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 2) seen :6
[2022-05-16 23:23:05] [INFO ] Flow matrix only has 35 transitions (discarded 104 similar events)
// Phase 1: matrix 35 rows 21 cols
[2022-05-16 23:23:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 23:23:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 23:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:23:05] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2022-05-16 23:23:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 23:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:23:05] [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.
BK_STOP 1652743386209
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S16C3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is 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 r143-tall-165271830300181"
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 '
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 ;