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.r021-smll-171620127700009.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 ASLink-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127700009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 201K 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 ASLink-PT-01a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716364214415

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=ASLink-PT-01a
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 07:50:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:50:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:50:17] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-22 07:50:17] [INFO ] Transformed 431 places.
[2024-05-22 07:50:17] [INFO ] Transformed 735 transitions.
[2024-05-22 07:50:17] [INFO ] Found NUPN structural information;
[2024-05-22 07:50:17] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 178 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 13) seen :9
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 728 rows 431 cols
[2024-05-22 07:50:18] [INFO ] Computed 80 invariants in 43 ms
[2024-05-22 07:50:19] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 07:50:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-22 07:50:19] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 31 ms returned sat
[2024-05-22 07:50:29] [INFO ] After 9623ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-22 07:50:29] [INFO ] After 10241ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2024-05-22 07:50:29] [INFO ] After 10709ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 10 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 425 transition count 702
Reduce places removed 26 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 61 place count 399 transition count 699
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 396 transition count 699
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 64 place count 396 transition count 671
Deduced a syphon composed of 28 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 131 place count 357 transition count 671
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 357 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 356 transition count 670
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 136 place count 353 transition count 659
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 140 place count 352 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 146 place count 351 transition count 654
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 149 place count 348 transition count 654
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 150 place count 347 transition count 646
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 347 transition count 646
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 152 place count 346 transition count 638
Iterating global reduction 7 with 1 rules applied. Total rules applied 153 place count 346 transition count 638
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 154 place count 345 transition count 630
Iterating global reduction 7 with 1 rules applied. Total rules applied 155 place count 345 transition count 630
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 156 place count 344 transition count 622
Iterating global reduction 7 with 1 rules applied. Total rules applied 157 place count 344 transition count 622
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 158 place count 343 transition count 614
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 343 transition count 614
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 160 place count 342 transition count 606
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 342 transition count 606
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 341 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 341 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 164 place count 340 transition count 590
Iterating global reduction 7 with 1 rules applied. Total rules applied 165 place count 340 transition count 590
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 166 place count 339 transition count 582
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 339 transition count 582
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 168 place count 338 transition count 574
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 338 transition count 574
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 170 place count 337 transition count 566
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 337 transition count 566
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 172 place count 336 transition count 558
Iterating global reduction 7 with 1 rules applied. Total rules applied 173 place count 336 transition count 558
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 174 place count 335 transition count 550
Iterating global reduction 7 with 1 rules applied. Total rules applied 175 place count 335 transition count 550
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 176 place count 334 transition count 542
Iterating global reduction 7 with 1 rules applied. Total rules applied 177 place count 334 transition count 542
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 178 place count 333 transition count 534
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 333 transition count 534
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 180 place count 332 transition count 526
Iterating global reduction 7 with 1 rules applied. Total rules applied 181 place count 332 transition count 526
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 193 place count 326 transition count 520
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 326 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 195 place count 325 transition count 519
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 196 place count 325 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 197 place count 324 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 198 place count 324 transition count 518
Applied a total of 198 rules in 436 ms. Remains 324 /431 variables (removed 107) and now considering 518/728 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 324/431 places, 518/728 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 347397 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{0=1}
Probabilistic random walk after 347397 steps, saw 126877 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 518 rows 324 cols
[2024-05-22 07:50:33] [INFO ] Computed 61 invariants in 14 ms
[2024-05-22 07:50:33] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:50:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-22 07:50:34] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 18 ms returned sat
[2024-05-22 07:50:37] [INFO ] After 3458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 07:50:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 07:50:42] [INFO ] After 4518ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 07:50:42] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 2 ms to minimize.
[2024-05-22 07:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2024-05-22 07:50:51] [INFO ] After 13989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-22 07:50:51] [INFO ] After 17688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 101 ms.
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 518/518 transitions.
Applied a total of 0 rules in 27 ms. Remains 324 /324 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 324/324 places, 518/518 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 372623 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 372623 steps, saw 134835 distinct states, run finished after 3006 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 07:50:55] [INFO ] Invariant cache hit.
[2024-05-22 07:50:55] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:50:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-22 07:50:55] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 18 ms returned sat
[2024-05-22 07:51:01] [INFO ] After 5847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 07:51:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 07:51:01] [INFO ] After 303ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 07:51:01] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 1 ms to minimize.
[2024-05-22 07:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2024-05-22 07:51:10] [INFO ] After 9669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-22 07:51:10] [INFO ] After 15804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 518/518 transitions.
Applied a total of 0 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 324/324 places, 518/518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 518/518 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 518/518 (removed 0) transitions.
[2024-05-22 07:51:11] [INFO ] Invariant cache hit.
[2024-05-22 07:51:11] [INFO ] Implicit Places using invariants in 454 ms returned [1, 19, 20, 22, 51, 69, 150, 155, 168, 169, 170, 171, 189, 191, 194, 212, 213, 214, 215, 227, 234, 240, 246, 252, 258, 264, 270, 276, 282, 288]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 457 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 294/324 places, 518/518 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 294 transition count 481
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 257 transition count 479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 255 transition count 479
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 78 place count 255 transition count 465
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 107 place count 240 transition count 465
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 11 rules applied. Total rules applied 118 place count 235 transition count 459
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 124 place count 229 transition count 459
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 139 place count 214 transition count 444
Iterating global reduction 5 with 15 rules applied. Total rules applied 154 place count 214 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 155 place count 214 transition count 443
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 161 place count 208 transition count 437
Iterating global reduction 6 with 6 rules applied. Total rules applied 167 place count 208 transition count 437
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 170 place count 208 transition count 434
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 207 transition count 433
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 207 transition count 433
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 173 place count 206 transition count 432
Iterating global reduction 7 with 1 rules applied. Total rules applied 174 place count 206 transition count 432
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 7 with 30 rules applied. Total rules applied 204 place count 191 transition count 417
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 209 place count 191 transition count 412
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 214 place count 186 transition count 412
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 218 place count 186 transition count 412
Applied a total of 218 rules in 64 ms. Remains 186 /294 variables (removed 108) and now considering 412/518 (removed 106) transitions.
// Phase 1: matrix 412 rows 186 cols
[2024-05-22 07:51:11] [INFO ] Computed 25 invariants in 12 ms
[2024-05-22 07:51:11] [INFO ] Implicit Places using invariants in 202 ms returned [75, 97, 103, 106, 108, 115, 185]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 205 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 179/324 places, 412/518 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 175 transition count 408
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 175 transition count 408
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 173 transition count 406
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 173 transition count 402
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 169 transition count 402
Applied a total of 20 rules in 25 ms. Remains 169 /179 variables (removed 10) and now considering 402/412 (removed 10) transitions.
// Phase 1: matrix 402 rows 169 cols
[2024-05-22 07:51:11] [INFO ] Computed 18 invariants in 5 ms
[2024-05-22 07:51:11] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 07:51:11] [INFO ] Invariant cache hit.
[2024-05-22 07:51:12] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 169/324 places, 402/518 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1348 ms. Remains : 169/324 places, 402/518 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 113 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 667332 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{1=1}
Probabilistic random walk after 667332 steps, saw 338602 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2024-05-22 07:51:15] [INFO ] Invariant cache hit.
[2024-05-22 07:51:15] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:51:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-22 07:51:15] [INFO ] [Nat]Absence check using 6 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-22 07:51:15] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:51:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-22 07:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-22 07:51:16] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-22 07:51:16] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 402/402 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 400
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 167 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 167 transition count 399
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 166 transition count 399
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 165 transition count 398
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 165 transition count 398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 164 transition count 397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 163 transition count 396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 162 transition count 396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 162 transition count 395
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 161 transition count 395
Applied a total of 14 rules in 30 ms. Remains 161 /169 variables (removed 8) and now considering 395/402 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 161/169 places, 395/402 transitions.
Incomplete random walk after 10000 steps, including 299 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 782511 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :{}
Probabilistic random walk after 782511 steps, saw 394640 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 161 cols
[2024-05-22 07:51:19] [INFO ] Computed 17 invariants in 7 ms
[2024-05-22 07:51:19] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:51:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-22 07:51:19] [INFO ] [Nat]Absence check using 6 positive and 11 generalized place invariants in 6 ms returned sat
[2024-05-22 07:51:19] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:51:19] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-22 07:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-22 07:51:19] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 07:51:19] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 395/395 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 395/395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 161/161 places, 395/395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 395/395 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2024-05-22 07:51:19] [INFO ] Invariant cache hit.
[2024-05-22 07:51:19] [INFO ] Implicit Places using invariants in 156 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 395/395 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 158 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 158 transition count 392
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 158 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 157 transition count 391
Applied a total of 6 rules in 23 ms. Remains 157 /160 variables (removed 3) and now considering 391/395 (removed 4) transitions.
// Phase 1: matrix 391 rows 157 cols
[2024-05-22 07:51:19] [INFO ] Computed 16 invariants in 4 ms
[2024-05-22 07:51:19] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 07:51:19] [INFO ] Invariant cache hit.
[2024-05-22 07:51:20] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/161 places, 391/395 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 748 ms. Remains : 157/161 places, 391/395 transitions.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 827995 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 827995 steps, saw 476968 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 07:51:23] [INFO ] Invariant cache hit.
[2024-05-22 07:51:23] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:51:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 07:51:23] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-22 07:51:23] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:51:23] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 07:51:23] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 391/391 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/157 places, 391/391 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 391/391 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 391/391 (removed 0) transitions.
[2024-05-22 07:51:23] [INFO ] Invariant cache hit.
[2024-05-22 07:51:23] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 07:51:23] [INFO ] Invariant cache hit.
[2024-05-22 07:51:24] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-22 07:51:24] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-22 07:51:24] [INFO ] Invariant cache hit.
[2024-05-22 07:51:24] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 926 ms. Remains : 157/157 places, 391/391 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 07:51:24] [INFO ] Invariant cache hit.
[2024-05-22 07:51:24] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:51:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 07:51:24] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-22 07:51:24] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 07:51:24] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 07:51:24] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:51:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 07:51:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 391 transitions and 1569 arcs took 10 ms.
[2024-05-22 07:51:25] [INFO ] Flatten gal took : 103 ms
Total runtime 68427 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-01a
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality

FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716364286636

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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
lola: LAUNCH task # 8 (type EXCL) for 0 ASLink-PT-01a-ReachabilityCardinality-2024-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 ASLink-PT-01a-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 ASLink-PT-01a-ReachabilityCardinality-2024-07
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 # 7 (type SRCH) for 0 ASLink-PT-01a-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-5.sara.
lola: FINISHED task # 4 (type FNDP) for ASLink-PT-01a-ReachabilityCardinality-2024-07
lola: result : true
lola: fired transitions : 2612
lola: tried executions : 34
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 5 (type EQUN) for ASLink-PT-01a-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 7 (type SRCH) for ASLink-PT-01a-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ASLink-PT-01a-ReachabilityCardinality-2024-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-01a-ReachabilityCardinality-2024-07: AG false findpath


Time elapsed: 0 secs. Pages in use: 2

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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r021-smll-171620127700009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a 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 ;