About the Execution of 2023-gold for GPPP-PT-C1000N0000001000
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.r197-tall-171640625300286.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 GPPP-PT-C1000N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625300286
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C1000N0000001000-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716551531871
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=GPPP-PT-C1000N0000001000
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 11:52:13] [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-24 11:52:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:52:13] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2024-05-24 11:52:13] [INFO ] Transformed 33 places.
[2024-05-24 11:52:13] [INFO ] Transformed 22 transitions.
[2024-05-24 11:52:13] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 11:52:13] [INFO ] Invariants computation overflowed in 7 ms
Incomplete random walk after 12008 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=857 ) properties (out of 16) seen :27001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :22127
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :22141
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :21225
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :22691
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :22165
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :22165
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :22209
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :22238
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :22115
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :22159
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :21225
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :22153
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :21225
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :22155
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :22129
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :22190
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 11:52:13] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-24 11:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:13] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
[2024-05-24 11:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:13] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-24 11:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:52:14] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:52:14] [INFO ] Added : 17 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 11:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:52:14] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:52:14] [INFO ] Added : 18 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 10 ms.
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 11:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:52:14] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 11:52:14] [INFO ] Added : 14 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 11:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 11:52:14] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 11:52:14] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 137 ms.
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 11:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 11:52:14] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:52:14] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-24 11:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 11:52:14] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:52:14] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 13 ms.
[2024-05-24 11:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2024-05-24 11:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-05-24 11:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2024-05-24 11:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 11:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2024-05-24 11:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 11:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 11:52:15] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:52:15] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-05-24 11:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 11:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:15] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:52:15] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:52:15] [INFO ] Added : 20 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [7000, -1, 3000, 3000, -1, -1, 2000, -1, -1, -1, 4000, 1, 11000, 1, -1, -1] Max seen :[7000, 7, 3000, 3000, 3, 7, 2000, 113, 1, 3, 4000, 1, 11000, 1, 1, 7]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-12 11000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-10 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-03 3000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-02 3000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-00 7000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 19
Applied a total of 8 rules in 19 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2024-05-24 11:52:26] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-24 11:52:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 28/33 places, 19/22 transitions.
// Phase 1: matrix 19 rows 28 cols
[2024-05-24 11:52:26] [INFO ] Invariants computation overflowed in 1 ms
Incomplete random walk after 1001602 steps, including 82 resets, run finished after 357 ms. (steps per millisecond=2805 ) properties (out of 8) seen :4034
Incomplete Best-First random walk after 1000000 steps, including 16 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 8) seen :182
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 8) seen :172
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 8) seen :98
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=3448 ) properties (out of 8) seen :4006
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=3076 ) properties (out of 8) seen :133
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 8) seen :189
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 362 ms. (steps per millisecond=2762 ) properties (out of 8) seen :200
// Phase 1: matrix 19 rows 28 cols
[2024-05-24 11:52:29] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-24 11:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 11:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2024-05-24 11:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 11:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned unsat
[2024-05-24 11:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 11:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-24 11:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 11:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2024-05-24 11:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 11:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-24 11:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Nat]Absence check using state equation in 28 ms returned unsat
[2024-05-24 11:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 11:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-24 11:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 11:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 11:52:30] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 4, 10, 3998, 2, 4, 2, 10] Max seen :[10, 4, 10, 3998, 2, 4, 2, 10]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-07 3998 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 17066 ms.
BK_STOP 1716551551287
--------------------
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="GPPP-PT-C1000N0000001000"
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 GPPP-PT-C1000N0000001000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625300286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000001000.tgz
mv GPPP-PT-C1000N0000001000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;