About the Execution of 2021-gold for Referendum-PT-1000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r197-tajo-165281579000169.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Referendum-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tajo-165281579000169
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 884K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 350K Apr 29 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 29 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 347K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 233K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 99K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 244K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Referendum-PT-1000-UpperBounds-00
FORMULA_NAME Referendum-PT-1000-UpperBounds-01
FORMULA_NAME Referendum-PT-1000-UpperBounds-02
FORMULA_NAME Referendum-PT-1000-UpperBounds-03
FORMULA_NAME Referendum-PT-1000-UpperBounds-04
FORMULA_NAME Referendum-PT-1000-UpperBounds-05
FORMULA_NAME Referendum-PT-1000-UpperBounds-06
FORMULA_NAME Referendum-PT-1000-UpperBounds-07
FORMULA_NAME Referendum-PT-1000-UpperBounds-08
FORMULA_NAME Referendum-PT-1000-UpperBounds-09
FORMULA_NAME Referendum-PT-1000-UpperBounds-10
FORMULA_NAME Referendum-PT-1000-UpperBounds-11
FORMULA_NAME Referendum-PT-1000-UpperBounds-12
FORMULA_NAME Referendum-PT-1000-UpperBounds-13
FORMULA_NAME Referendum-PT-1000-UpperBounds-14
FORMULA_NAME Referendum-PT-1000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1653248144787
Running Version 0
[2022-05-22 19:35:46] [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-22 19:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 19:35:46] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-22 19:35:46] [INFO ] Transformed 3001 places.
[2022-05-22 19:35:46] [INFO ] Transformed 2001 transitions.
[2022-05-22 19:35:46] [INFO ] Found NUPN structural information;
[2022-05-22 19:35:46] [INFO ] Parsed PT model containing 3001 places and 2001 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 82 ms.
FORMULA Referendum-PT-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-22 19:35:46] [INFO ] Computed 1000 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 3648 ms. (steps per millisecond=2 ) properties (out of 12) seen :5104
FORMULA Referendum-PT-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 4) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 4) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 4) seen :6
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-22 19:35:51] [INFO ] Computed 1000 place invariants in 24 ms
[2022-05-22 19:35:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 238 ms returned sat
[2022-05-22 19:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:35:53] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2022-05-22 19:35:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:35:59] [INFO ] [Real]Absence check using 1000 positive place invariants in 246 ms returned sat
[2022-05-22 19:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:36:00] [INFO ] [Real]Absence check using state equation in 1066 ms returned sat
[2022-05-22 19:36:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:36:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 309 ms returned sat
[2022-05-22 19:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:36:06] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2022-05-22 19:36:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:36:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 233 ms returned sat
[2022-05-22 19:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:36:11] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2022-05-22 19:36:11] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[515, 528, 528, 528]
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3000 transition count 2000
Applied a total of 1 rules in 525 ms. Remains 3000 /3001 variables (removed 1) and now considering 2000/2001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:36:17] [INFO ] Computed 1000 place invariants in 20 ms
Interrupted random walk after 124618 steps, including 124 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{0=536, 1=542, 2=542, 3=542}
Interrupted Best-First random walk after 150072 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=29 ) properties seen :{0=77}
Interrupted Best-First random walk after 164776 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=32 ) properties seen :{1=85, 2=85, 3=85}
Interrupted Best-First random walk after 167606 steps, including 0 resets, run timeout after 5025 ms. (steps per millisecond=33 ) properties seen :{1=87, 2=87, 3=87}
Interrupted Best-First random walk after 163946 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=32 ) properties seen :{1=85, 2=85, 3=85}
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:37:07] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-22 19:37:07] [INFO ] [Real]Absence check using 1000 positive place invariants in 265 ms returned sat
[2022-05-22 19:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:37:09] [INFO ] [Real]Absence check using state equation in 1055 ms returned sat
[2022-05-22 19:37:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:37:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 315 ms returned sat
[2022-05-22 19:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:37:56] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2022-05-22 19:37:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:38:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 291 ms returned sat
[2022-05-22 19:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:38:43] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2022-05-22 19:38:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:39:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2022-05-22 19:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:39:30] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2022-05-22 19:39:30] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[536, 542, 542, 542]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 95 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 80 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:40:15] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-22 19:40:16] [INFO ] Implicit Places using invariants in 624 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:40:16] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-22 19:40:16] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2022-05-22 19:40:16] [INFO ] Redundant transitions in 181 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:40:16] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-22 19:40:18] [INFO ] Dead Transitions using invariants and state equation in 1396 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:40:18] [INFO ] Computed 1000 place invariants in 5 ms
Interrupted random walk after 152113 steps, including 151 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=543, 1=544, 2=544, 3=544}
Interrupted Best-First random walk after 170257 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=33 ) properties seen :{0=88}
Interrupted Best-First random walk after 197392 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=39 ) properties seen :{1=103, 2=103, 3=103}
Interrupted Best-First random walk after 150072 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=29 ) properties seen :{1=77, 2=77, 3=77}
Interrupted Best-First random walk after 191201 steps, including 0 resets, run timeout after 5025 ms. (steps per millisecond=38 ) properties seen :{1=100, 2=100, 3=100}
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:41:08] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-22 19:41:09] [INFO ] [Real]Absence check using 1000 positive place invariants in 288 ms returned sat
[2022-05-22 19:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:41:10] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2022-05-22 19:41:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:41:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 263 ms returned sat
[2022-05-22 19:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:41:57] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2022-05-22 19:41:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:42:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 266 ms returned sat
[2022-05-22 19:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:42:43] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2022-05-22 19:42:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:43:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 265 ms returned sat
[2022-05-22 19:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:43:30] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2022-05-22 19:43:30] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[543, 544, 544, 544]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 171 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 70 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:44:16] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-22 19:44:16] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:44:16] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-22 19:44:17] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2022-05-22 19:44:17] [INFO ] Redundant transitions in 190 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:44:17] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-22 19:44:18] [INFO ] Dead Transitions using invariants and state equation in 1438 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:44:18] [INFO ] Computed 1000 place invariants in 4 ms
Interrupted random walk after 148755 steps, including 148 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{0=539, 1=537, 2=537, 3=537}
Interrupted Best-First random walk after 183977 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=36 ) properties seen :{0=96}
Interrupted Best-First random walk after 180353 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=36 ) properties seen :{1=94, 2=94, 3=94}
Interrupted Best-First random walk after 196598 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=39 ) properties seen :{1=103, 2=103, 3=103}
Interrupted Best-First random walk after 197392 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=39 ) properties seen :{1=103, 2=103, 3=103}
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:45:08] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-22 19:45:09] [INFO ] [Real]Absence check using 1000 positive place invariants in 276 ms returned sat
[2022-05-22 19:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:45:10] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2022-05-22 19:45:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:45:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 270 ms returned sat
[2022-05-22 19:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:45:57] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2022-05-22 19:45:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:46:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 265 ms returned sat
[2022-05-22 19:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:46:44] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2022-05-22 19:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 19:47:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 333 ms returned sat
[2022-05-22 19:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:47:31] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2022-05-22 19:47:31] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[543, 544, 544, 544]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 91 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 64 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:48:16] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-22 19:48:17] [INFO ] Implicit Places using invariants in 627 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:48:17] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-22 19:48:18] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2022-05-22 19:48:18] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:48:18] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-22 19:48:19] [INFO ] Dead Transitions using invariants and state equation in 1535 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-00
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:48:19] [INFO ] Computed 1000 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1225 ms. (steps per millisecond=8 ) properties (out of 1) seen :545
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:48:21] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-22 19:48:21] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2022-05-22 19:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:48:22] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2022-05-22 19:48:22] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[545]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.14 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 149 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2022-05-22 19:48:27] [INFO ] Computed 1000 place invariants in 3 ms
Interrupted random walk after 375033 steps, including 374 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen :{0=1000}
FORMULA Referendum-PT-1000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-00 in 38295 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-01
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:48:57] [INFO ] Computed 1000 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1213 ms. (steps per millisecond=8 ) properties (out of 1) seen :510
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:48:59] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-22 19:49:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 302 ms returned sat
[2022-05-22 19:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:49:01] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2022-05-22 19:49:01] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[510]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 69 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2022-05-22 19:49:06] [INFO ] Computed 1000 place invariants in 2 ms
Interrupted random walk after 370545 steps, including 370 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen :{0=1000}
FORMULA Referendum-PT-1000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-01 in 38571 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-04
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:49:36] [INFO ] Computed 1000 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1616 ms. (steps per millisecond=6 ) properties (out of 1) seen :524
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:49:38] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-22 19:49:39] [INFO ] [Real]Absence check using 1000 positive place invariants in 264 ms returned sat
[2022-05-22 19:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:49:39] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2022-05-22 19:49:40] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[524]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 66 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2022-05-22 19:49:45] [INFO ] Computed 1000 place invariants in 3 ms
Interrupted random walk after 372914 steps, including 372 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen :{0=1000}
FORMULA Referendum-PT-1000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-04 in 38598 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-05
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:50:15] [INFO ] Computed 1000 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1312 ms. (steps per millisecond=7 ) properties (out of 1) seen :531
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-22 19:50:16] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-22 19:50:17] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2022-05-22 19:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 19:50:18] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2022-05-22 19:50:18] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[531]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.5 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 103 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2022-05-22 19:50:23] [INFO ] Computed 1000 place invariants in 4 ms
Interrupted random walk after 372583 steps, including 372 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen :{0=1000}
FORMULA Referendum-PT-1000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-05 in 38839 ms.
[2022-05-22 19:50:54] [INFO ] Flatten gal took : 503 ms
[2022-05-22 19:50:54] [INFO ] Applying decomposition
[2022-05-22 19:50:54] [INFO ] Flatten gal took : 118 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4750846608999887960.txt, -o, /tmp/graph4750846608999887960.bin, -w, /tmp/graph4750846608999887960.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4750846608999887960.bin, -l, -1, -v, -w, /tmp/graph4750846608999887960.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 19:50:55] [INFO ] Decomposing Gal with order
[2022-05-22 19:50:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 19:50:55] [INFO ] Flatten gal took : 73 ms
[2022-05-22 19:50:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 19:50:55] [INFO ] Time to serialize gal into /tmp/UpperBounds10898762241337942164.gal : 15 ms
[2022-05-22 19:50:55] [INFO ] Time to serialize properties into /tmp/UpperBounds10187340011368842070.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10898762241337942164.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10187340011368842070.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10898762241337942164.gal -t CGAL -reachable-file /tmp/UpperBounds10187340011368842070.prop --nowitness
Loading property file /tmp/UpperBounds10187340011368842070.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.32207e+477,2.15771,37760,1002,6,3004,19,2008,0,10,11,0
Total reachable state count : 1.322070819480806635042229428124998147867e+477
BK_STOP 1653249058213
--------------------
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="Referendum-PT-1000"
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 Referendum-PT-1000, 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 r197-tajo-165281579000169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 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 ;