About the Execution of 2023-gold for GPPP-PT-C0100N0000000100
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-171640625200256.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-C0100N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625200256
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Apr 12 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 09:09 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-C0100N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716545807810
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-C0100N0000000100
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 10:16:49] [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 10:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:16:49] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2024-05-24 10:16:49] [INFO ] Transformed 33 places.
[2024-05-24 10:16:49] [INFO ] Transformed 22 transitions.
[2024-05-24 10:16:49] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 10:16:49] [INFO ] Computed 12 invariants in 7 ms
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-13 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10013 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :1473
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :704
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :911
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :826
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :777
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :777
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :807
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :820
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :814
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :829
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :821
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :777
[2024-05-24 10:16:49] [INFO ] Invariant cache hit.
[2024-05-24 10:16:49] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-24 10:16:49] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 10:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 10:16:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:16:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 10:16:49] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2024-05-24 10:16:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:49] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 10:16:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:16:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 307 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:50] [INFO ] [Nat]Absence check using state equation in 52 ms returned unsat
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 10:16:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:16:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned unsat
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 10:16:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:16:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:51] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 800 ms returned sat
[2024-05-24 10:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:51] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 10:16:51] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 10:16:51] [INFO ] Added : 19 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 53 ms.
[2024-05-24 10:16:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:51] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 10:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 10:16:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:16:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:51] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 259 ms returned sat
[2024-05-24 10:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:52] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-24 10:16:52] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 10:16:52] [INFO ] Added : 19 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 112 ms.
[2024-05-24 10:16:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:52] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 9 ms returned sat
[2024-05-24 10:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 10:16:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:16:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 10:16:57] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4979 ms returned unknown
[2024-05-24 10:16:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 10:16:57] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:16:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 10:16:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:16:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:16:57] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-24 10:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:00] [INFO ] [Nat]Absence check using state equation in 3196 ms returned sat
[2024-05-24 10:17:00] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 10:17:00] [INFO ] Added : 16 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 15 ms.
[2024-05-24 10:17:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 10:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 10:17:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:00] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2024-05-24 10:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:05] [INFO ] [Nat]Absence check using state equation in 4971 ms returned unknown
[2024-05-24 10:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:17:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 10:17:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:17:05] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 24 ms returned sat
[2024-05-24 10:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:06] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2024-05-24 10:17:06] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 10:17:07] [INFO ] Added : 16 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 10:17:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 10:17:07] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 10:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 10:17:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 10:17:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 10:17:12] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4981 ms returned unknown
Current structural bounds on expressions (after SMT) : [400, 300, 4, 2, 600, 450, 900, 450, 200, 1000, 8] Max seen :[400, 300, 4, 2, 393, 150, 5, 3, 7, 9, 1]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-01 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-00 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 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
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 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 2 with 3 rules applied. Total rules applied 5 place count 30 transition count 20
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 2 with 3 rules applied. Total rules applied 8 place count 28 transition count 19
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 17 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2024-05-24 10:17:12] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 10:17:12] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 27/33 places, 18/22 transitions.
[2024-05-24 10:17:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000383 steps, including 760 resets, run finished after 293 ms. (steps per millisecond=3414 ) properties (out of 7) seen :828
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=2857 ) properties (out of 7) seen :404
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=3831 ) properties (out of 7) seen :401
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=2932 ) properties (out of 7) seen :425
Incomplete Best-First random walk after 1000001 steps, including 160 resets, run finished after 341 ms. (steps per millisecond=2932 ) properties (out of 7) seen :470
Incomplete Best-First random walk after 1000001 steps, including 156 resets, run finished after 347 ms. (steps per millisecond=2881 ) properties (out of 7) seen :475
Incomplete Best-First random walk after 1000001 steps, including 157 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 7) seen :480
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=3508 ) properties (out of 7) seen :439
[2024-05-24 10:17:15] [INFO ] Invariant cache hit.
[2024-05-24 10:17:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:15] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 10:17:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3580 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using state equation in 99 ms returned unsat
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 10:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using state equation in 138 ms returned unsat
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 10:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 412 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 10:17:19] [INFO ] Computed and/alt/rep : 17/38/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 10:17:19] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 12 ms.
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 10:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 10:17:24] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4760 ms returned sat
[2024-05-24 10:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:24] [INFO ] [Nat]Absence check using state equation in 137 ms returned unsat
[2024-05-24 10:17:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:24] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 10:17:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:24] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:25] [INFO ] [Nat]Absence check using state equation in 283 ms returned unsat
[2024-05-24 10:17:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:25] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:25] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 10:17:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:25] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:27] [INFO ] [Nat]Absence check using state equation in 1929 ms returned unsat
[2024-05-24 10:17:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:27] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 10:17:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:27] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [396, 398, 900, 4, 10, 10, 2] Max seen :[396, 398, 8, 4, 10, 10, 2]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-07 398 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-05 396 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 18/18 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 17
Applied a total of 2 rules in 3 ms. Remains 26 /27 variables (removed 1) and now considering 17/18 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 26/27 places, 17/18 transitions.
// Phase 1: matrix 17 rows 26 cols
[2024-05-24 10:17:27] [INFO ] Computed 10 invariants in 5 ms
Incomplete random walk after 1000144 steps, including 767 resets, run finished after 229 ms. (steps per millisecond=4367 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=3144 ) properties (out of 1) seen :6
[2024-05-24 10:17:27] [INFO ] Invariant cache hit.
[2024-05-24 10:17:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:27] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 10:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 10:17:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:28] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 152 ms returned sat
[2024-05-24 10:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:29] [INFO ] [Nat]Absence check using state equation in 1206 ms returned unsat
Current structural bounds on expressions (after SMT) : [10] Max seen :[10]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 40160 ms.
BK_STOP 1716545850208
--------------------
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-C0100N0000000100"
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-C0100N0000000100, 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-171640625200256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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 ;