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.r329-tall-167889202100517.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 ltsminxred
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-167889202100517
=====================================================================

--------------------
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 1679144143157

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 12:55:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 12:55:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:55:44] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2023-03-18 12:55:44] [INFO ] Transformed 1501 places.
[2023-03-18 12:55:44] [INFO ] Transformed 1001 transitions.
[2023-03-18 12:55:44] [INFO ] Found NUPN structural information;
[2023-03-18 12:55:44] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 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 12:55:45] [INFO ] Computed 500 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 1615 ms. (steps per millisecond=6 ) properties (out of 11) seen :1375
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 204 ms. (steps per millisecond=49 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) 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 5) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 5) seen :8
[2023-03-18 12:55:47] [INFO ] Invariant cache hit.
[2023-03-18 12:55:48] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-18 12:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:55:48] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2023-03-18 12:55:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:55:53] [INFO ] [Real]Absence check using 500 positive place invariants in 106 ms returned sat
[2023-03-18 12:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:55:54] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-18 12:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:55:59] [INFO ] [Real]Absence check using 500 positive place invariants in 104 ms returned sat
[2023-03-18 12:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:56:00] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-18 12:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:56:05] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2023-03-18 12:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:56:06] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-18 12:56:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:56:11] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-18 12:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:56:11] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-18 12:56:11] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[273, 273, 275, 273, 275]
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 148 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 148 ms. Remains : 1500/1501 places, 1000/1001 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 12:56:17] [INFO ] Computed 500 place invariants in 6 ms
Finished random walk after 209510 steps, including 418 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=6 )
Interrupted Best-First random walk after 234617 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=46 ) properties seen 1116
Interrupted Best-First random walk after 218601 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=43 ) properties seen 960
Interrupted Best-First random walk after 221072 steps, including 0 resets, run timeout after 5011 ms. (steps per millisecond=44 ) properties seen 654
Interrupted Best-First random walk after 217512 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=43 ) properties seen 951
Interrupted Best-First random walk after 221760 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=44 ) properties seen 658
[2023-03-18 12:57:12] [INFO ] Invariant cache hit.
[2023-03-18 12:57:12] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-18 12:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:57:12] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-18 12:57:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:57:16] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 12:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:57:17] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-18 12:57:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:57:20] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-18 12:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:57:21] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-18 12:57:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:57:25] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-18 12:57:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:57:26] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2023-03-18 12:57:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:57:29] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 12:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:57:30] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2023-03-18 12:57:30] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[372, 372, 329, 372, 329]
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 20 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 20 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 38 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 12:57:34] [INFO ] Invariant cache hit.
[2023-03-18 12:57:34] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-18 12:57:34] [INFO ] Invariant cache hit.
[2023-03-18 12:57:35] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2023-03-18 12:57:35] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-18 12:57:35] [INFO ] Invariant cache hit.
[2023-03-18 12:57:36] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1841 ms. Remains : 1500/1500 places, 1000/1000 transitions.
[2023-03-18 12:57:36] [INFO ] Invariant cache hit.
Finished random walk after 202344 steps, including 403 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=6 )
Interrupted Best-First random walk after 220025 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=43 ) properties seen 972
Interrupted Best-First random walk after 218240 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=43 ) properties seen 957
Interrupted Best-First random walk after 220376 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=44 ) properties seen 650
Interrupted Best-First random walk after 216776 steps, including 0 resets, run timeout after 5011 ms. (steps per millisecond=43 ) properties seen 945
Interrupted Best-First random walk after 219672 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=43 ) properties seen 646
[2023-03-18 12:58:31] [INFO ] Invariant cache hit.
[2023-03-18 12:58:31] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2023-03-18 12:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:58:32] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-18 12:58:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:58:35] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2023-03-18 12:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:58:36] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-18 12:58:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:58:40] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 12:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:58:40] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-18 12:58:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:58:45] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 12:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:58:45] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-18 12:58:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:58:49] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 12:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:58:49] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-18 12:58:49] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[372, 372, 329, 372, 329]
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 30 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 32 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.
[2023-03-18 12:58:53] [INFO ] Invariant cache hit.
[2023-03-18 12:58:54] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-18 12:58:54] [INFO ] Invariant cache hit.
[2023-03-18 12:58:54] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2023-03-18 12:58:54] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 12:58:54] [INFO ] Invariant cache hit.
[2023-03-18 12:58:55] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1707 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-01
[2023-03-18 12:58:55] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 1) seen :263
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :4
[2023-03-18 12:58:56] [INFO ] Invariant cache hit.
[2023-03-18 12:58:56] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-18 12:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:58:57] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-18 12:58:57] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[263]
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.6 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 REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 12:59:01] [INFO ] Computed 500 place invariants in 2 ms
Finished random walk after 616215 steps, including 1229 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=20 )
FORMULA Referendum-PT-0500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-01 in 36476 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-03
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 12:59:31] [INFO ] Computed 500 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 1) seen :280
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
[2023-03-18 12:59:32] [INFO ] Invariant cache hit.
[2023-03-18 12:59:33] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-18 12:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:59:33] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-18 12:59:33] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[280]
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 28 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
[2023-03-18 12:59:38] [INFO ] Computed 500 place invariants in 2 ms
Finished random walk after 605893 steps, including 1209 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=20 )
FORMULA Referendum-PT-0500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-03 in 36671 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-04
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 13:00:08] [INFO ] Computed 500 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 634 ms. (steps per millisecond=15 ) properties (out of 1) seen :281
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
[2023-03-18 13:00:09] [INFO ] Invariant cache hit.
[2023-03-18 13:00:09] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-18 13:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:00:10] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-18 13:00:10] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[281]
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 26 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 26 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 13:00:15] [INFO ] Computed 500 place invariants in 1 ms
Finished random walk after 605700 steps, including 1208 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=20 )
FORMULA Referendum-PT-0500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-04 in 36585 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-06
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 13:00:45] [INFO ] Computed 500 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 1) seen :265
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
[2023-03-18 13:00:46] [INFO ] Invariant cache hit.
[2023-03-18 13:00:46] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-18 13:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:00:46] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-18 13:00:46] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[265]
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.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 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
[2023-03-18 13:00:51] [INFO ] Computed 500 place invariants in 2 ms
Finished random walk after 605383 steps, including 1208 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=20 )
FORMULA Referendum-PT-0500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-06 in 36554 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-07
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-18 13:01:21] [INFO ] Computed 500 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 1) seen :272
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :4
[2023-03-18 13:01:22] [INFO ] Invariant cache hit.
[2023-03-18 13:01:22] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-18 13:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:01:23] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-18 13:01:23] [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.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 23 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 24 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-18 13:01:28] [INFO ] Computed 500 place invariants in 1 ms
Finished random walk after 604835 steps, including 1207 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=20 )
FORMULA Referendum-PT-0500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-07 in 36440 ms.
[2023-03-18 13:01:58] [INFO ] Flatten gal took : 201 ms
Total runtime 373821 ms.
ITS solved all properties within timeout

BK_STOP 1679144519334

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ltsminxred"
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 ltsminxred"
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-167889202100517"
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 ;