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.r153-tall-171631151600339.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 DoubleExponent-PT-003, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716422119026

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 23:55:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 23:55:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:55:20] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-22 23:55:20] [INFO ] Transformed 163 places.
[2024-05-22 23:55:20] [INFO ] Transformed 148 transitions.
[2024-05-22 23:55:20] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 324 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 206524 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{0=1, 2=1, 11=1}
Probabilistic random walk after 206524 steps, saw 103282 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :3
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 13 properties.
// Phase 1: matrix 148 rows 163 cols
[2024-05-22 23:55:24] [INFO ] Computed 19 invariants in 22 ms
[2024-05-22 23:55:24] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 23:55:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2024-05-22 23:55:24] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 23:55:24] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :2
[2024-05-22 23:55:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
[2024-05-22 23:55:25] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-22 23:55:25] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 23:55:25] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 2 ms to minimize.
[2024-05-22 23:55:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 265 ms
[2024-05-22 23:55:25] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-05-22 23:55:25] [INFO ] After 747ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :2
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 24 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 160 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 159 transition count 129
Reduce places removed 18 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 141 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 137 transition count 125
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 47 place count 137 transition count 119
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 131 transition count 119
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 89 place count 116 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 115 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 115 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 112 transition count 101
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 106 place count 112 transition count 92
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 115 place count 103 transition count 92
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 125 place count 103 transition count 92
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 103 transition count 92
Applied a total of 127 rules in 49 ms. Remains 103 /163 variables (removed 60) and now considering 92/148 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 103/163 places, 92/148 transitions.
Incomplete random walk after 10000 steps, including 406 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 360 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 592813 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 592813 steps, saw 296494 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 92 rows 103 cols
[2024-05-22 23:55:28] [INFO ] Computed 16 invariants in 3 ms
[2024-05-22 23:55:28] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:55:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:55:28] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 23:55:28] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 23:55:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:55:28] [INFO ] After 54ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:55:29] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-22 23:55:29] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-22 23:55:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-22 23:55:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 23:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-22 23:55:29] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-22 23:55:29] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 24 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 92/92 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 23:55:29] [INFO ] Invariant cache hit.
[2024-05-22 23:55:29] [INFO ] Implicit Places using invariants in 49 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/103 places, 92/92 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 91
Applied a total of 2 rules in 7 ms. Remains 101 /102 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 101 cols
[2024-05-22 23:55:29] [INFO ] Computed 15 invariants in 5 ms
[2024-05-22 23:55:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 23:55:29] [INFO ] Invariant cache hit.
[2024-05-22 23:55:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:55:29] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [57, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 188 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/103 places, 91/92 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 91
Applied a total of 1 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 99 cols
[2024-05-22 23:55:29] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 23:55:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 23:55:29] [INFO ] Invariant cache hit.
[2024-05-22 23:55:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 23:55:29] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 99/103 places, 91/92 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 474 ms. Remains : 99/103 places, 91/92 transitions.
Incomplete random walk after 10000 steps, including 429 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 346 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 356 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 567665 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 567665 steps, saw 283915 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 23:55:32] [INFO ] Invariant cache hit.
[2024-05-22 23:55:32] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:55:32] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2024-05-22 23:55:33] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 23:55:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 23:55:33] [INFO ] After 38ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-22 23:55:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 124 ms
[2024-05-22 23:55:33] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-22 23:55:33] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 24 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 99/99 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-22 23:55:33] [INFO ] Invariant cache hit.
[2024-05-22 23:55:33] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:55:33] [INFO ] Invariant cache hit.
[2024-05-22 23:55:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 23:55:33] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-22 23:55:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:55:33] [INFO ] Invariant cache hit.
[2024-05-22 23:55:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 99/99 places, 91/91 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 99 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 98 transition count 90
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 98 transition count 89
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 97 transition count 89
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 6 place count 96 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 96 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 95 transition count 87
Applied a total of 8 rules in 10 ms. Remains 95 /99 variables (removed 4) and now considering 87/91 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 95 cols
[2024-05-22 23:55:33] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 23:55:33] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:55:33] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-22 23:55:33] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 23:55:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-22 23:55:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 228 ms
[2024-05-22 23:55:34] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-22 23:55:34] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:55:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 23:55:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 91 transitions and 325 arcs took 2 ms.
[2024-05-22 23:55:34] [INFO ] Flatten gal took : 30 ms
Total runtime 13849 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-003
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716422138175

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 DoubleExponent-PT-003-ReachabilityCardinality-2024-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 DoubleExponent-PT-003-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 DoubleExponent-PT-003-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 DoubleExponent-PT-003-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: FINISHED task # 9 (type SRCH) for DoubleExponent-PT-003-ReachabilityCardinality-2024-12
lola: result : true
lola: markings : 72840
lola: fired transitions : 72839
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for DoubleExponent-PT-003-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 7 (type EQUN) for DoubleExponent-PT-003-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 10 (type EXCL) for DoubleExponent-PT-003-ReachabilityCardinality-2024-12 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 DoubleExponent-PT-003-ReachabilityCardinality-2024-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 DoubleExponent-PT-003-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 DoubleExponent-PT-003-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 16 (type SRCH) for 3 DoubleExponent-PT-003-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type FNDP) for DoubleExponent-PT-003-ReachabilityCardinality-2024-12
lola: result : unknown
lola: fired transitions : 182379
lola: tried executions : 9582
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 7 (type EQUN) for DoubleExponent-PT-003-ReachabilityCardinality-2024-12
lola: result : unknown
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-14.sara.
sara: warning, failure of lp_solve (at job 27)
lola: FINISHED task # 17 (type EXCL) for DoubleExponent-PT-003-ReachabilityCardinality-2024-14
lola: result : false
lola: markings : 1194969
lola: fired transitions : 1194968
lola: time used : 3.000000
lola: memory pages used : 5
lola: CANCELED task # 13 (type FNDP) for DoubleExponent-PT-003-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 14 (type EQUN) for DoubleExponent-PT-003-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 16 (type SRCH) for DoubleExponent-PT-003-ReachabilityCardinality-2024-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-ReachabilityCardinality-2024-12: EF true tandem / insertion
DoubleExponent-PT-003-ReachabilityCardinality-2024-14: AG true tandem / relaxed


Time elapsed: 3 secs. Pages in use: 10

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="DoubleExponent-PT-003"
export BK_EXAMINATION="ReachabilityCardinality"
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 DoubleExponent-PT-003, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151600339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;