fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r351-tall-167889220900065
Last Updated
May 14, 2023

About the Execution of 2022-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
1955.764 370611.00 389477.00 968.30 1 500 1 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/mcc2023-input.r351-tall-167889220900065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r351-tall-167889220900065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 496K Feb 26 19:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Feb 26 19:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 255K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 257K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 881K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 404K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M Feb 26 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Feb 26 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 511K Feb 26 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 571K Mar 5 18:23 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 1679137311643

Running Version 202205111006
[2023-03-18 11:01:52] [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]
[2023-03-18 11:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:01:53] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-18 11:01:53] [INFO ] Transformed 1501 places.
[2023-03-18 11:01:53] [INFO ] Transformed 1001 transitions.
[2023-03-18 11:01:53] [INFO ] Found NUPN structural information;
[2023-03-18 11:01:53] [INFO ] Parsed PT model containing 1501 places and 1001 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 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-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1001 rows 1501 cols
[2023-03-18 11:01:53] [INFO ] Computed 500 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 1300 ms. (steps per millisecond=7 ) properties (out of 11) seen :1339
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-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-08 1 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 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :8
// Phase 1: matrix 1001 rows 1501 cols
[2023-03-18 11:01:55] [INFO ] Computed 500 place invariants in 15 ms
[2023-03-18 11:01:55] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-18 11:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:56] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2023-03-18 11:01:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:02:01] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 11:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:02] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-18 11:02:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:02:07] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-18 11:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:07] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2023-03-18 11:02:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:02:13] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2023-03-18 11:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:13] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2023-03-18 11:02:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:02:19] [INFO ] [Real]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-18 11:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:19] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-18 11:02:19] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[267, 267, 266, 267, 266]
Support contains 1000 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 176 ms. Remains 1500 /1501 variables (removed 1) and now considering 1000/1001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1500/1501 places, 1000/1001 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:02:24] [INFO ] Computed 500 place invariants in 9 ms
Finished random walk after 232934 steps, including 464 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=7 )
Interrupted Best-First random walk after 234360 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=46 ) properties seen 1113
Interrupted Best-First random walk after 236601 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=47 ) properties seen 1140
Interrupted Best-First random walk after 241001 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=48 ) properties seen 800
Interrupted Best-First random walk after 239120 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=47 ) properties seen 1173
Interrupted Best-First random walk after 241592 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=48 ) properties seen 806
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:03:19] [INFO ] Computed 500 place invariants in 9 ms
[2023-03-18 11:03:20] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-18 11:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:20] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-18 11:03:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:03:24] [INFO ] [Real]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-18 11:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:24] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-18 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:03:28] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-18 11:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:28] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-18 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:03:32] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2023-03-18 11:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:32] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2023-03-18 11:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:03:36] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2023-03-18 11:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:37] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-18 11:03:37] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[391, 391, 403, 391, 403]
Support contains 1000 out of 1500 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.
Finished structural reductions, in 1 iterations. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 38 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:03:40] [INFO ] Computed 500 place invariants in 4 ms
[2023-03-18 11:03:40] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:03:40] [INFO ] Computed 500 place invariants in 4 ms
[2023-03-18 11:03:41] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2023-03-18 11:03:41] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:03:41] [INFO ] Computed 500 place invariants in 5 ms
[2023-03-18 11:03:42] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1500/1500 places, 1000/1000 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:03:42] [INFO ] Computed 500 place invariants in 5 ms
Finished random walk after 235435 steps, including 469 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=7 )
Interrupted Best-First random walk after 236601 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=47 ) properties seen 1140
Interrupted Best-First random walk after 236601 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=47 ) properties seen 1140
Interrupted Best-First random walk after 239765 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=47 ) properties seen 788
Interrupted Best-First random walk after 238680 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=47 ) properties seen 1167
Interrupted Best-First random walk after 240800 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=48 ) properties seen 798
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:04:37] [INFO ] Computed 500 place invariants in 6 ms
[2023-03-18 11:04:37] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-18 11:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:37] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-18 11:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:04:41] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-18 11:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:42] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-18 11:04:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:04:45] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-18 11:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:46] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2023-03-18 11:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:04:49] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-18 11:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:50] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-18 11:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:04:53] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 11:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:54] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-18 11:04:54] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[391, 391, 403, 391, 403]
Support contains 1000 out of 1500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 30 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:04:57] [INFO ] Computed 500 place invariants in 3 ms
[2023-03-18 11:04:58] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:04:58] [INFO ] Computed 500 place invariants in 2 ms
[2023-03-18 11:04:58] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-18 11:04:58] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:04:58] [INFO ] Computed 500 place invariants in 3 ms
[2023-03-18 11:04:59] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1500/1500 places, 1000/1000 transitions.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-01
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:04:59] [INFO ] Computed 500 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 1) seen :270
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :4
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:05:00] [INFO ] Computed 500 place invariants in 5 ms
[2023-03-18 11:05:00] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-18 11:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:05:00] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-18 11:05:00] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[270]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.5 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 42 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 11:05:05] [INFO ] Computed 500 place invariants in 3 ms
Finished random walk after 691323 steps, including 1379 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=23 )
FORMULA Referendum-PT-0500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-01 in 36563 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-03
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:05:35] [INFO ] Computed 500 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 1) seen :264
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :4
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:05:36] [INFO ] Computed 500 place invariants in 3 ms
[2023-03-18 11:05:36] [INFO ] [Real]Absence check using 500 positive place invariants in 89 ms returned sat
[2023-03-18 11:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:05:37] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-18 11:05:37] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[264]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 42 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 11:05:41] [INFO ] Computed 500 place invariants in 1 ms
Finished random walk after 691905 steps, including 1381 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=23 )
FORMULA Referendum-PT-0500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-03 in 35923 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-04
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:06:11] [INFO ] Computed 500 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 1) seen :262
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :4
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:06:12] [INFO ] Computed 500 place invariants in 5 ms
[2023-03-18 11:06:12] [INFO ] [Real]Absence check using 500 positive place invariants in 89 ms returned sat
[2023-03-18 11:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:06:13] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2023-03-18 11:06:13] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[262]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 27 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 11:06:17] [INFO ] Computed 500 place invariants in 1 ms
Finished random walk after 695431 steps, including 1388 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=23 )
FORMULA Referendum-PT-0500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-04 in 35724 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-06
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:06:47] [INFO ] Computed 500 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 1) seen :268
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :4
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:06:48] [INFO ] Computed 500 place invariants in 6 ms
[2023-03-18 11:06:48] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2023-03-18 11:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:06:49] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-18 11:06:49] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[268]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 36 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 11:06:54] [INFO ] Computed 500 place invariants in 4 ms
Finished random walk after 690350 steps, including 1377 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=23 )
FORMULA Referendum-PT-0500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-06 in 36563 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-07
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:07:24] [INFO ] Computed 500 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 1) seen :273
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :4
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 11:07:24] [INFO ] Computed 500 place invariants in 4 ms
[2023-03-18 11:07:25] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-18 11:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:07:25] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-18 11:07:25] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[273]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.1 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 15 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 11:07:30] [INFO ] Computed 500 place invariants in 1 ms
Finished random walk after 690809 steps, including 1378 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=23 )
FORMULA Referendum-PT-0500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-07 in 36592 ms.
[2023-03-18 11:08:00] [INFO ] Flatten gal took : 216 ms
[2023-03-18 11:08:01] [INFO ] Applying decomposition
[2023-03-18 11:08:01] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1319652008970893005.txt' '-o' '/tmp/graph1319652008970893005.bin' '-w' '/tmp/graph1319652008970893005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1319652008970893005.bin' '-l' '-1' '-v' '-w' '/tmp/graph1319652008970893005.weights' '-q' '0' '-e' '0.001'
[2023-03-18 11:08:01] [INFO ] Decomposing Gal with order
[2023-03-18 11:08:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 11:08:01] [INFO ] Flatten gal took : 48 ms
[2023-03-18 11:08:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-18 11:08:01] [INFO ] Time to serialize gal into /tmp/UpperBounds10810225101899453220.gal : 12 ms
[2023-03-18 11:08:01] [INFO ] Time to serialize properties into /tmp/UpperBounds12835323238440939469.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10810225101899453220.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12835323238440939469.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds12835323238440939469.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,3.63603e+238,0.683687,13560,502,6,1504,19,1008,0,10,11,0
Total reachable state count : 3.636029179586993683265444291665825203311e+238

Total runtime 369345 ms.

BK_STOP 1679137682254

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r351-tall-167889220900065"
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 ;