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

About the Execution of Marcie+red for GPPP-PT-C0100N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
482.432 42613.00 47584.00 271.20 300 10 200 2 400 1 10 300 200 200 396 407 1 10 200 2 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857800853.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 marciexred
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 r170-tall-167838857800853
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 10:41 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 22K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:44 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-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 1678642364979

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:32:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 17:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:32:46] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-12 17:32:46] [INFO ] Transformed 33 places.
[2023-03-12 17:32:46] [INFO ] Transformed 22 transitions.
[2023-03-12 17:32:46] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:32:46] [INFO ] Computed 12 place invariants in 15 ms
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10052 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=558 ) properties (out of 14) seen :2420
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :1331
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1133
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 :1080
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :1505
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 :1110
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 :1124
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :1501
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 :1090
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 :1002
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 :1118
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 :1095
[2023-03-12 17:32:46] [INFO ] Invariant cache hit.
[2023-03-12 17:32:47] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-12 17:32:47] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2023-03-12 17:32:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:32:47] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 17:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:32:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 17:32:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:32:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:32:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 17:32:52] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4985 ms returned unknown
[2023-03-12 17:32:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:32:52] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-12 17:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:32:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 17:32:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:32:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:32:55] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3438 ms returned sat
[2023-03-12 17:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:32:56] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2023-03-12 17:32:56] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 17:32:56] [INFO ] Added : 7 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 8 ms.
[2023-03-12 17:32:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:32:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:32:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 17:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:32:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-12 17:32:56] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-12 17:32:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 17:32:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-12 17:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:32:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 17:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:32:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 17:32:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 17:33:01] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4974 ms returned unknown
[2023-03-12 17:33:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:01] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 17:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:01] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-12 17:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:03] [INFO ] [Nat]Absence check using state equation in 1379 ms returned sat
[2023-03-12 17:33:03] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 17:33:03] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 81 ms.
[2023-03-12 17:33:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:03] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2023-03-12 17:33:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:03] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 17:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 17:33:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 798 ms returned sat
[2023-03-12 17:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-12 17:33:04] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 17:33:04] [INFO ] Added : 19 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 18 ms.
[2023-03-12 17:33:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 17:33:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 68 ms returned sat
[2023-03-12 17:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:06] [INFO ] [Nat]Absence check using state equation in 1842 ms returned sat
[2023-03-12 17:33:06] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 17:33:06] [INFO ] Added : 18 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 114 ms.
[2023-03-12 17:33:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 17:33:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-12 17:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:09] [INFO ] [Nat]Absence check using state equation in 2859 ms returned sat
[2023-03-12 17:33:09] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:33:09] [INFO ] Added : 16 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 44 ms.
[2023-03-12 17:33:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:09] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 17:33:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:14] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4582 ms returned sat
[2023-03-12 17:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:14] [INFO ] [Nat]Absence check using state equation in 404 ms returned unknown
Current structural bounds on expressions (after SMT) : [300, 1000, 8, 400, 600, 200, 300, 600, 1300, 200, 8] Max seen :[300, 8, 1, 400, 1, 8, 300, 393, 400, 8, 1]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-07 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-04 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-00 300 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.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 29 transition count 18
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 9 place count 27 transition count 17
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 0 with 2 rules applied. Total rules applied 11 place count 26 transition count 16
Applied a total of 11 rules in 17 ms. Remains 26 /33 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-12 17:33:15] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-12 17:33:15] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 26/33 places, 16/22 transitions.
[2023-03-12 17:33:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000154 steps, including 776 resets, run finished after 268 ms. (steps per millisecond=3731 ) properties (out of 8) seen :831
Incomplete Best-First random walk after 1000000 steps, including 159 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 8) seen :822
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 299 ms. (steps per millisecond=3344 ) properties (out of 8) seen :820
Incomplete Best-First random walk after 1000001 steps, including 159 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 8) seen :809
Incomplete Best-First random walk after 1000001 steps, including 160 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 8) seen :822
Incomplete Best-First random walk after 1000001 steps, including 184 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 8) seen :816
Incomplete Best-First random walk after 1000000 steps, including 326 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 8) seen :808
Incomplete Best-First random walk after 1000000 steps, including 164 resets, run finished after 326 ms. (steps per millisecond=3067 ) properties (out of 8) seen :817
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 326 ms. (steps per millisecond=3067 ) properties (out of 8) seen :823
[2023-03-12 17:33:18] [INFO ] Invariant cache hit.
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:33:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 17:33:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned unsat
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 17:33:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-12 17:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:24] [INFO ] [Nat]Absence check using state equation in 6013 ms returned unknown
[2023-03-12 17:33:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 17:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2023-03-12 17:33:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 17:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-12 17:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:25] [INFO ] [Nat]Absence check using state equation in 237 ms returned unsat
[2023-03-12 17:33:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 17:33:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 82 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:25] [INFO ] [Nat]Absence check using state equation in 719 ms returned unsat
[2023-03-12 17:33:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 17:33:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 17:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:25] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-12 17:33:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:26] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 17:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:26] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 2, 600, 10, 396, 407, 10, 2] Max seen :[10, 2, 1, 10, 396, 407, 10, 2]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-11 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-10 396 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 16/16 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 26 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 15
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 25 transition count 14
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 24 transition count 14
Applied a total of 4 rules in 5 ms. Remains 24 /26 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 24/26 places, 14/16 transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-12 17:33:26] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000055 steps, including 792 resets, run finished after 220 ms. (steps per millisecond=4545 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 163 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 1) seen :1
[2023-03-12 17:33:26] [INFO ] Invariant cache hit.
[2023-03-12 17:33:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:26] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 17:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:33:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:26] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 17:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:33:26] [INFO ] [Nat]Absence check using state equation in 78 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 40273 ms.
ITS solved all properties within timeout

BK_STOP 1678642407592

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000000100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
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 r170-tall-167838857800853"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;