Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r021-oct2-167813608500008.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ASLink-PT-01a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-167813608500008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 201K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678929937134

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 01:25:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 01:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:25:39] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-16 01:25:39] [INFO ] Transformed 431 places.
[2023-03-16 01:25:39] [INFO ] Transformed 735 transitions.
[2023-03-16 01:25:39] [INFO ] Found NUPN structural information;
[2023-03-16 01:25:39] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 221 ms.
Structural test allowed to assert that 45 places are NOT stable. Took 7 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 386) seen :307
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 79) seen :52
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 728 rows 431 cols
[2023-03-16 01:25:40] [INFO ] Computed 80 place invariants in 32 ms
[2023-03-16 01:25:41] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-16 01:25:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2023-03-16 01:25:41] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 30 ms returned sat
[2023-03-16 01:25:43] [INFO ] After 1820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-16 01:25:44] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 4 ms to minimize.
[2023-03-16 01:25:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-16 01:25:46] [INFO ] After 4646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 2867 ms.
[2023-03-16 01:25:49] [INFO ] After 8352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 6 properties in 2653 ms.
Support contains 21 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 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 426 transition count 698
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 65 place count 396 transition count 698
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 65 place count 396 transition count 669
Deduced a syphon composed of 29 places in 4 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 134 place count 356 transition count 669
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 356 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 355 transition count 668
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 352 transition count 652
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 352 transition count 652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 146 place count 351 transition count 649
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 148 place count 349 transition count 649
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 149 place count 348 transition count 641
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 348 transition count 641
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 151 place count 347 transition count 633
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 347 transition count 633
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 153 place count 346 transition count 625
Iterating global reduction 6 with 1 rules applied. Total rules applied 154 place count 346 transition count 625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 155 place count 345 transition count 617
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 345 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 157 place count 344 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 344 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 159 place count 343 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 343 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 161 place count 342 transition count 593
Iterating global reduction 6 with 1 rules applied. Total rules applied 162 place count 342 transition count 593
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 163 place count 341 transition count 585
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 341 transition count 585
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 165 place count 340 transition count 577
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 340 transition count 577
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 339 transition count 569
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 339 transition count 569
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 169 place count 338 transition count 561
Iterating global reduction 6 with 1 rules applied. Total rules applied 170 place count 338 transition count 561
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 171 place count 337 transition count 553
Iterating global reduction 6 with 1 rules applied. Total rules applied 172 place count 337 transition count 553
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 173 place count 336 transition count 545
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 336 transition count 545
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 175 place count 335 transition count 537
Iterating global reduction 6 with 1 rules applied. Total rules applied 176 place count 335 transition count 537
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 177 place count 334 transition count 529
Iterating global reduction 6 with 1 rules applied. Total rules applied 178 place count 334 transition count 529
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 179 place count 333 transition count 521
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 333 transition count 521
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 194 place count 326 transition count 514
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 326 transition count 514
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 325 transition count 513
Applied a total of 196 rules in 258 ms. Remains 325 /431 variables (removed 106) and now considering 513/728 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 325/431 places, 513/728 transitions.
Incomplete random walk after 1000000 steps, including 20818 resets, run finished after 8143 ms. (steps per millisecond=122 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 1000000 steps, including 8724 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 513 rows 325 cols
[2023-03-16 01:26:01] [INFO ] Computed 63 place invariants in 25 ms
[2023-03-16 01:26:01] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:26:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 01:26:01] [INFO ] [Nat]Absence check using 18 positive and 45 generalized place invariants in 11 ms returned sat
[2023-03-16 01:26:01] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:26:01] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-16 01:26:01] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 513/513 transitions.
Ensure Unique test removed 1 places
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 3 rules applied. Total rules applied 3 place count 324 transition count 511
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 320 transition count 511
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 320 transition count 507
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 16 place count 315 transition count 507
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 313 transition count 507
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 313 transition count 506
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 20 place count 312 transition count 506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 311 transition count 505
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 310 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 310 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 309 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 30 place count 307 transition count 501
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 31 place count 306 transition count 500
Iterating global reduction 5 with 1 rules applied. Total rules applied 32 place count 306 transition count 500
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 306 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 34 place count 305 transition count 499
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 36 place count 305 transition count 499
Applied a total of 36 rules in 76 ms. Remains 305 /325 variables (removed 20) and now considering 499/513 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 305/325 places, 499/513 transitions.
Incomplete random walk after 1000000 steps, including 21331 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9228 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1896302 steps, run timeout after 6001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 1896302 steps, saw 574036 distinct states, run finished after 6003 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 499 rows 305 cols
[2023-03-16 01:26:10] [INFO ] Computed 56 place invariants in 14 ms
[2023-03-16 01:26:10] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:26:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 31 ms returned sat
[2023-03-16 01:26:11] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 239 ms returned sat
[2023-03-16 01:26:12] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:26:12] [INFO ] After 777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-16 01:26:12] [INFO ] After 1222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 499/499 transitions.
Applied a total of 0 rules in 15 ms. Remains 305 /305 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 305/305 places, 499/499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 499/499 transitions.
Applied a total of 0 rules in 12 ms. Remains 305 /305 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2023-03-16 01:26:12] [INFO ] Invariant cache hit.
[2023-03-16 01:26:12] [INFO ] Implicit Places using invariants in 714 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 140, 151, 152, 153, 171, 173, 176, 194, 195, 196, 197, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 717 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 275/305 places, 499/499 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 275 transition count 453
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 229 transition count 453
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 92 place count 229 transition count 442
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 115 place count 217 transition count 442
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 127 place count 213 transition count 434
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 135 place count 205 transition count 434
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 150 place count 190 transition count 419
Iterating global reduction 4 with 15 rules applied. Total rules applied 165 place count 190 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 168 place count 190 transition count 416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 168 place count 190 transition count 415
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 189 transition count 415
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 173 place count 186 transition count 412
Iterating global reduction 5 with 3 rules applied. Total rules applied 176 place count 186 transition count 412
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 177 place count 185 transition count 411
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 185 transition count 411
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 184 transition count 410
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 184 transition count 410
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 216 place count 166 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 217 place count 166 transition count 391
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 218 place count 165 transition count 390
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 165 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 220 place count 165 transition count 389
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 165 transition count 387
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 225 place count 162 transition count 387
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 228 place count 162 transition count 387
Applied a total of 228 rules in 69 ms. Remains 162 /275 variables (removed 113) and now considering 387/499 (removed 112) transitions.
// Phase 1: matrix 387 rows 162 cols
[2023-03-16 01:26:13] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-16 01:26:13] [INFO ] Implicit Places using invariants in 230 ms returned [73, 90, 96, 99, 101]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 234 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/305 places, 387/499 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 154 transition count 384
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 154 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 153 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 153 transition count 383
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 151 transition count 381
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 151 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 148 transition count 378
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 148 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 377
Applied a total of 20 rules in 23 ms. Remains 147 /157 variables (removed 10) and now considering 377/387 (removed 10) transitions.
// Phase 1: matrix 377 rows 147 cols
[2023-03-16 01:26:13] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-16 01:26:13] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-16 01:26:13] [INFO ] Invariant cache hit.
[2023-03-16 01:26:13] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/305 places, 377/499 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1569 ms. Remains : 147/305 places, 377/499 transitions.
Incomplete random walk after 1000000 steps, including 29134 resets, run finished after 1459 ms. (steps per millisecond=685 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 15564 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1246435 steps, run visited all 1 properties in 3343 ms. (steps per millisecond=372 )
Probabilistic random walk after 1246435 steps, saw 732679 distinct states, run finished after 3343 ms. (steps per millisecond=372 ) properties seen :1
Able to resolve query StableMarking after proving 387 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 40237 ms.
ITS solved all properties within timeout

BK_STOP 1678929979817

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-01a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ASLink-PT-01a, examination is StableMarking"
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-oct2-167813608500008"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;