fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r329-tall-171662362200391
Last Updated
July 7, 2024

About the Execution of 2023-gold for Referendum-PT-0500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1900.119 380576.00 398898.00 1368.30 500 500 500 500 500 1 500 500 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/mcc2024-input.r329-tall-171662362200391.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Referendum-PT-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362200391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 641K Apr 11 20:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 191K Apr 11 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 17:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 246K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 813K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 286K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 339K Apr 12 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 614K Apr 11 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.2M Apr 11 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 124K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 571K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716862096734

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-28 02:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:08:19] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-28 02:08:19] [INFO ] Transformed 1501 places.
[2024-05-28 02:08:19] [INFO ] Transformed 1001 transitions.
[2024-05-28 02:08:19] [INFO ] Found NUPN structural information;
[2024-05-28 02:08:19] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 24 ms.
FORMULA Referendum-PT-0500-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1001 rows 1501 cols
[2024-05-28 02:08:19] [INFO ] Computed 500 invariants in 30 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 1717 ms. (steps per millisecond=5 ) properties (out of 12) seen :2608
FORMULA Referendum-PT-0500-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :4
[2024-05-28 02:08:21] [INFO ] Invariant cache hit.
[2024-05-28 02:08:22] [INFO ] [Real]Absence check using 500 positive place invariants in 104 ms returned sat
[2024-05-28 02:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:08:22] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-05-28 02:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:08:28] [INFO ] [Real]Absence check using 500 positive place invariants in 104 ms returned sat
[2024-05-28 02:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:08:28] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2024-05-28 02:08:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:08:34] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2024-05-28 02:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:08:34] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2024-05-28 02:08:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:08:39] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2024-05-28 02:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:08:40] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-05-28 02:08:40] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500] Max seen :[274, 274, 274, 281]
Support contains 1000 out of 1501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1500 transition count 1000
Applied a total of 1 rules in 161 ms. Remains 1500 /1501 variables (removed 1) and now considering 1000/1001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1500/1501 places, 1000/1001 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2024-05-28 02:08:45] [INFO ] Computed 500 invariants in 4 ms
Finished random walk after 294857 steps, including 588 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=9 )
Interrupted Best-First random walk after 245960 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen 1287
Interrupted Best-First random walk after 244112 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=48 ) properties seen 1251
Interrupted Best-First random walk after 245817 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen 1284
Interrupted Best-First random walk after 245960 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=49 ) properties seen 429
[2024-05-28 02:09:35] [INFO ] Invariant cache hit.
[2024-05-28 02:09:35] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2024-05-28 02:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:09:36] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-05-28 02:09:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:09:40] [INFO ] [Real]Absence check using 500 positive place invariants in 100 ms returned sat
[2024-05-28 02:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:09:40] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-05-28 02:09:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:09:44] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2024-05-28 02:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:09:44] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2024-05-28 02:09:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:09:48] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2024-05-28 02:09:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:09:48] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-05-28 02:09:48] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500] Max seen :[429, 429, 429, 429]
Support contains 1000 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 40 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-28 02:09:52] [INFO ] Invariant cache hit.
[2024-05-28 02:09:52] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-28 02:09:52] [INFO ] Invariant cache hit.
[2024-05-28 02:09:53] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2024-05-28 02:09:53] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-28 02:09:53] [INFO ] Invariant cache hit.
[2024-05-28 02:09:53] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1732 ms. Remains : 1500/1500 places, 1000/1000 transitions.
[2024-05-28 02:09:53] [INFO ] Invariant cache hit.
Finished random walk after 294182 steps, including 587 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=9 )
Interrupted Best-First random walk after 247280 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=49 ) properties seen 1317
Interrupted Best-First random walk after 248192 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=49 ) properties seen 1341
Interrupted Best-First random walk after 248976 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen 1365
Interrupted Best-First random walk after 247401 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=49 ) properties seen 440
[2024-05-28 02:10:43] [INFO ] Invariant cache hit.
[2024-05-28 02:10:44] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2024-05-28 02:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:44] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-05-28 02:10:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:10:48] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2024-05-28 02:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:48] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-05-28 02:10:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:10:52] [INFO ] [Real]Absence check using 500 positive place invariants in 103 ms returned sat
[2024-05-28 02:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:52] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-28 02:10:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:10:56] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2024-05-28 02:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:56] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2024-05-28 02:10:56] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500] Max seen :[455, 455, 455, 440]
Support contains 1000 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 28 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-28 02:11:00] [INFO ] Invariant cache hit.
[2024-05-28 02:11:00] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-28 02:11:00] [INFO ] Invariant cache hit.
[2024-05-28 02:11:01] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2024-05-28 02:11:01] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-28 02:11:01] [INFO ] Invariant cache hit.
[2024-05-28 02:11:01] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1712 ms. Remains : 1500/1500 places, 1000/1000 transitions.
[2024-05-28 02:11:01] [INFO ] Invariant cache hit.
Finished random walk after 294645 steps, including 588 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=9 )
Interrupted Best-First random walk after 242352 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=48 ) properties seen 1221
Interrupted Best-First random walk after 243080 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=48 ) properties seen 1233
Interrupted Best-First random walk after 244112 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=48 ) properties seen 1251
Interrupted Best-First random walk after 244440 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=48 ) properties seen 419
[2024-05-28 02:11:51] [INFO ] Invariant cache hit.
[2024-05-28 02:11:52] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2024-05-28 02:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:11:52] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2024-05-28 02:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:11:56] [INFO ] [Real]Absence check using 500 positive place invariants in 88 ms returned sat
[2024-05-28 02:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:11:56] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-05-28 02:11:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using 500 positive place invariants in 93 ms returned sat
[2024-05-28 02:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-05-28 02:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:12:04] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2024-05-28 02:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:12:04] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2024-05-28 02:12:04] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500] Max seen :[455, 455, 455, 440]
Support contains 1000 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 26 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-28 02:12:08] [INFO ] Invariant cache hit.
[2024-05-28 02:12:08] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-28 02:12:08] [INFO ] Invariant cache hit.
[2024-05-28 02:12:09] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2024-05-28 02:12:09] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-28 02:12:09] [INFO ] Invariant cache hit.
[2024-05-28 02:12:09] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1722 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-00
[2024-05-28 02:12:09] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 1) seen :271
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :4
[2024-05-28 02:12:10] [INFO ] Invariant cache hit.
[2024-05-28 02:12:10] [INFO ] [Real]Absence check using 500 positive place invariants in 93 ms returned sat
[2024-05-28 02:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:12:11] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-05-28 02:12:11] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[271]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.2 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 29 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2024-05-28 02:12:16] [INFO ] Computed 500 invariants in 5 ms
Finished random walk after 728985 steps, including 1455 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=24 )
FORMULA Referendum-PT-0500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-00 in 36547 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-03
// Phase 1: matrix 1000 rows 1500 cols
[2024-05-28 02:12:46] [INFO ] Computed 500 invariants in 5 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 1) seen :267
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :4
[2024-05-28 02:12:47] [INFO ] Invariant cache hit.
[2024-05-28 02:12:47] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2024-05-28 02:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:12:47] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-28 02:12:47] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[267]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.2 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 38 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2024-05-28 02:12:52] [INFO ] Computed 500 invariants in 14 ms
Finished random walk after 733032 steps, including 1463 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=24 )
FORMULA Referendum-PT-0500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-03 in 36476 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-04
// Phase 1: matrix 1000 rows 1500 cols
[2024-05-28 02:13:22] [INFO ] Computed 500 invariants in 2 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 1) seen :269
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :4
[2024-05-28 02:13:23] [INFO ] Invariant cache hit.
[2024-05-28 02:13:23] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2024-05-28 02:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:13:24] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2024-05-28 02:13:24] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[269]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.3 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 19 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2024-05-28 02:13:29] [INFO ] Computed 500 invariants in 2 ms
Finished random walk after 735361 steps, including 1467 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=24 )
FORMULA Referendum-PT-0500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-04 in 36525 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-06
// Phase 1: matrix 1000 rows 1500 cols
[2024-05-28 02:13:59] [INFO ] Computed 500 invariants in 3 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 1) seen :272
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :4
[2024-05-28 02:14:00] [INFO ] Invariant cache hit.
[2024-05-28 02:14:00] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2024-05-28 02:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:14:00] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-05-28 02:14:00] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[272]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.4 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 30 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2024-05-28 02:14:05] [INFO ] Computed 500 invariants in 1 ms
Finished random walk after 738160 steps, including 1473 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=24 )
FORMULA Referendum-PT-0500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-06 in 36558 ms.
[2024-05-28 02:14:36] [INFO ] Flatten gal took : 249 ms
Total runtime 377246 ms.

BK_STOP 1716862477310

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Referendum-PT-0500, 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 r329-tall-171662362200391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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