About the Execution of Smart+red for GPPP-PT-C0100N0000010000
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.r171-tall-167838859200869.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 smartxred
Input is GPPP-PT-C0100N0000010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859200869
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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-C0100N0000010000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679516789929
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000010000
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 20:26:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 20:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:26:31] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-22 20:26:31] [INFO ] Transformed 33 places.
[2023-03-22 20:26:31] [INFO ] Transformed 22 transitions.
[2023-03-22 20:26:31] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-22 20:26:31] [INFO ] Computed 12 place invariants in 14 ms
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-12 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-09 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-01 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10148 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=563 ) properties (out of 12) seen :43436
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-10 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :42504
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :41837
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :41839
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :41807
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :42433
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :41829
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :42515
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :41850
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :42517
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 10) seen :41706
[2023-03-22 20:26:31] [INFO ] Invariant cache hit.
[2023-03-22 20:26:31] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-22 20:26:31] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-22 20:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:31] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-22 20:26:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:26:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-22 20:26:31] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2023-03-22 20:26:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:26:32] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-22 20:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:32] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 20:26:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:26:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 20:26:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 20:26:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4978 ms returned unknown
[2023-03-22 20:26:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:26:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-22 20:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 20:26:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:26:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:26:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 686 ms returned sat
[2023-03-22 20:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:42] [INFO ] [Nat]Absence check using state equation in 4298 ms returned unknown
[2023-03-22 20:26:42] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-22 20:26:42] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-22 20:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 20:26:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:26:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 20:26:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 20:26:47] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4986 ms returned unknown
[2023-03-22 20:26:47] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-22 20:26:47] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2023-03-22 20:26:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:26:47] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 20:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:26:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 20:26:48] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 767 ms returned sat
[2023-03-22 20:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:51] [INFO ] [Nat]Absence check using state equation in 3581 ms returned sat
[2023-03-22 20:26:51] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 20:26:51] [INFO ] Added : 13 causal constraints over 5 iterations in 88 ms. Result :sat
Minimization took 539 ms.
[2023-03-22 20:26:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 20:26:52] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2023-03-22 20:26:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:26:52] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 20:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:26:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:26:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 20:26:57] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4987 ms returned unknown
[2023-03-22 20:26:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:26:57] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:26:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 20:26:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:26:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 20:27:02] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4687 ms returned sat
[2023-03-22 20:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:02] [INFO ] [Nat]Absence check using state equation in 300 ms returned unknown
[2023-03-22 20:27:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:27:02] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 20:27:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 20:27:02] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [400, 41400, 900, 700, 300, 450, 300, 700, 6666, 400] Max seen :[400, 40007, 10, 10, 300, 3, 300, 10, 1104, 400]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-15 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-11 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-05 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-00 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. 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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
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 4 place count 31 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 7 place count 29 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 20 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-22 20:27:02] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-22 20:27:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 27/33 places, 18/22 transitions.
[2023-03-22 20:27:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000178 steps, including 761 resets, run finished after 386 ms. (steps per millisecond=2591 ) properties (out of 6) seen :41138
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 6) seen :40706
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 6) seen :41109
Incomplete Best-First random walk after 1000001 steps, including 155 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 6) seen :41110
Incomplete Best-First random walk after 1000001 steps, including 161 resets, run finished after 319 ms. (steps per millisecond=3134 ) properties (out of 6) seen :41110
Incomplete Best-First random walk after 1000001 steps, including 163 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 6) seen :41122
Incomplete Best-First random walk after 1000000 steps, including 207 resets, run finished after 299 ms. (steps per millisecond=3344 ) properties (out of 6) seen :41124
[2023-03-22 20:27:04] [INFO ] Invariant cache hit.
[2023-03-22 20:27:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:04] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-22 20:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:04] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 20:27:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-22 20:27:04] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using state equation in 222 ms returned unsat
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 20:27:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using state equation in 54 ms returned unsat
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 20:27:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned unsat
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 20:27:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 62 ms returned sat
[2023-03-22 20:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:09] [INFO ] [Nat]Absence check using state equation in 4402 ms returned sat
[2023-03-22 20:27:09] [INFO ] Computed and/alt/rep : 17/43/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 20:27:09] [INFO ] Added : 13 causal constraints over 5 iterations in 58 ms. Result :sat
Minimization took 3001 ms.
[2023-03-22 20:27:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 20:27:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:13] [INFO ] [Nat]Absence check using state equation in 17 ms returned unsat
[2023-03-22 20:27:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 20:27:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-22 20:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:19] [INFO ] [Nat]Absence check using state equation in 6015 ms returned unknown
Current structural bounds on expressions (after SMT) : [40007, 10, 10, 450, 10, 6666] Max seen :[40007, 10, 10, 4, 10, 1104]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-02 40007 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 18/18 transitions.
Graph (trivial) has 2 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 7 ms. Remains 26 /27 variables (removed 1) and now considering 16/18 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 26/27 places, 16/18 transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-22 20:27:19] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000036 steps, including 789 resets, run finished after 234 ms. (steps per millisecond=4273 ) properties (out of 2) seen :1108
Incomplete Best-First random walk after 1000001 steps, including 166 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 2) seen :1104
Incomplete Best-First random walk after 1000000 steps, including 219 resets, run finished after 277 ms. (steps per millisecond=3610 ) properties (out of 2) seen :1107
[2023-03-22 20:27:19] [INFO ] Invariant cache hit.
[2023-03-22 20:27:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 20:27:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned unsat
[2023-03-22 20:27:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 20:27:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:27:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-22 20:27:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:27:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1104] Max seen :[4, 1104]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-14 1104 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 48816 ms.
ITS solved all properties within timeout
BK_STOP 1679516841048
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="GPPP-PT-C0100N0000010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is GPPP-PT-C0100N0000010000, 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 r171-tall-167838859200869"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 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 ;