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.r011-oct2-167813599700047.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 smartxred
Input is ASLink-PT-03a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599700047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 357K 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

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

=== Now, execution of the tool begins

BK_START 1678719491045

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 14:58:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 14:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:58:14] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-13 14:58:14] [INFO ] Transformed 821 places.
[2023-03-13 14:58:14] [INFO ] Transformed 1281 transitions.
[2023-03-13 14:58:14] [INFO ] Found NUPN structural information;
[2023-03-13 14:58:14] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 16) seen :6
FORMULA ASLink-PT-03a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :1
FORMULA ASLink-PT-03a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1268 rows 821 cols
[2023-03-13 14:58:16] [INFO ] Computed 156 place invariants in 100 ms
[2023-03-13 14:58:16] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned sat
[2023-03-13 14:58:17] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 289 ms returned sat
[2023-03-13 14:58:17] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 14:58:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2023-03-13 14:58:17] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 70 ms returned sat
[2023-03-13 14:58:42] [INFO ] After 24244ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2023-03-13 14:58:42] [INFO ] After 24272ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 14:58:42] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
FORMULA ASLink-PT-03a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 37 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 803 transition count 1201
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 152 place count 736 transition count 1201
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 152 place count 736 transition count 1133
Deduced a syphon composed of 68 places in 12 ms
Ensure Unique test removed 26 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 314 place count 642 transition count 1133
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 315 place count 642 transition count 1132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 641 transition count 1132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 321 place count 636 transition count 1112
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 327 place count 635 transition count 1112
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 4 with 6 rules applied. Total rules applied 333 place count 634 transition count 1107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 336 place count 631 transition count 1107
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 378 place count 610 transition count 1086
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 381 place count 610 transition count 1083
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 384 place count 607 transition count 1083
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 387 place count 607 transition count 1083
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 388 place count 606 transition count 1082
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 394 place count 600 transition count 1082
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 394 place count 600 transition count 1071
Deduced a syphon composed of 11 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 417 place count 588 transition count 1071
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 421 place count 584 transition count 1071
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 421 place count 584 transition count 1070
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 423 place count 583 transition count 1070
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 431 place count 579 transition count 1066
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 434 place count 576 transition count 1063
Iterating global reduction 9 with 3 rules applied. Total rules applied 437 place count 576 transition count 1063
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 440 place count 576 transition count 1060
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 443 place count 573 transition count 1060
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 446 place count 573 transition count 1060
Applied a total of 446 rules in 707 ms. Remains 573 /821 variables (removed 248) and now considering 1060/1268 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 573/821 places, 1060/1268 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 153394 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153394 steps, saw 66154 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1060 rows 573 cols
[2023-03-13 14:58:46] [INFO ] Computed 99 place invariants in 25 ms
[2023-03-13 14:58:46] [INFO ] [Real]Absence check using 24 positive place invariants in 6 ms returned sat
[2023-03-13 14:58:46] [INFO ] [Real]Absence check using 24 positive and 75 generalized place invariants in 23 ms returned sat
[2023-03-13 14:58:46] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 14:58:47] [INFO ] [Nat]Absence check using 24 positive place invariants in 92 ms returned sat
[2023-03-13 14:58:47] [INFO ] [Nat]Absence check using 24 positive and 75 generalized place invariants in 57 ms returned sat
[2023-03-13 14:58:53] [INFO ] After 5947ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-13 14:58:56] [INFO ] After 9557ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-13 14:58:57] [INFO ] After 10125ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ASLink-PT-03a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 1060/1060 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 573 transition count 1059
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 572 transition count 1059
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 572 transition count 1058
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 570 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 569 transition count 1049
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 569 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 568 transition count 1041
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 568 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 567 transition count 1033
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 567 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 566 transition count 1025
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 566 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 565 transition count 1017
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 565 transition count 1017
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 564 transition count 1009
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 564 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 563 transition count 1001
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 563 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 562 transition count 993
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 562 transition count 993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 561 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 561 transition count 985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 560 transition count 977
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 560 transition count 977
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 559 transition count 969
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 559 transition count 969
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 558 transition count 961
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 558 transition count 961
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 557 transition count 953
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 557 transition count 953
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 556 transition count 945
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 556 transition count 945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 555 transition count 937
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 555 transition count 937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 554 transition count 929
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 554 transition count 929
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 553 transition count 921
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 553 transition count 921
Applied a total of 39 rules in 551 ms. Remains 553 /573 variables (removed 20) and now considering 921/1060 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 553/573 places, 921/1060 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 207859 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207859 steps, saw 87448 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 921 rows 553 cols
[2023-03-13 14:59:00] [INFO ] Computed 98 place invariants in 10 ms
[2023-03-13 14:59:01] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-13 14:59:01] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 19 ms returned sat
[2023-03-13 14:59:01] [INFO ] After 904ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 14:59:02] [INFO ] [Nat]Absence check using 25 positive place invariants in 21 ms returned sat
[2023-03-13 14:59:02] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 47 ms returned sat
[2023-03-13 14:59:02] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 14:59:03] [INFO ] After 1742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3169 ms.
[2023-03-13 14:59:07] [INFO ] After 5173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 281 ms.
Support contains 5 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 921/921 transitions.
Applied a total of 0 rules in 28 ms. Remains 553 /553 variables (removed 0) and now considering 921/921 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 553/553 places, 921/921 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 921/921 transitions.
Applied a total of 0 rules in 15 ms. Remains 553 /553 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2023-03-13 14:59:07] [INFO ] Invariant cache hit.
[2023-03-13 14:59:08] [INFO ] Implicit Places using invariants in 873 ms returned [0, 18, 19, 30, 48, 66, 141, 150, 151, 152, 170, 188, 257, 261, 262, 273, 274, 275, 293, 311, 380, 384, 385, 388, 399, 400, 401, 419, 421, 424, 442, 443, 444, 445, 457, 463, 469, 475, 481, 487, 493, 499, 505, 511, 517]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 877 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/553 places, 921/921 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 508 transition count 851
Reduce places removed 70 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 73 rules applied. Total rules applied 143 place count 438 transition count 848
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 146 place count 435 transition count 848
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 146 place count 435 transition count 829
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 185 place count 415 transition count 829
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 3 with 12 rules applied. Total rules applied 197 place count 411 transition count 821
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 205 place count 403 transition count 821
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 220 place count 388 transition count 806
Iterating global reduction 5 with 15 rules applied. Total rules applied 235 place count 388 transition count 806
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 238 place count 388 transition count 803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 238 place count 388 transition count 802
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 240 place count 387 transition count 802
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 243 place count 384 transition count 799
Iterating global reduction 6 with 3 rules applied. Total rules applied 246 place count 384 transition count 799
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 247 place count 383 transition count 798
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 383 transition count 798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 382 transition count 797
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 382 transition count 797
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 316 place count 349 transition count 764
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 318 place count 349 transition count 762
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 320 place count 347 transition count 760
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 347 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 324 place count 347 transition count 758
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 330 place count 347 transition count 752
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 337 place count 340 transition count 752
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 347 place count 340 transition count 752
Applied a total of 347 rules in 193 ms. Remains 340 /508 variables (removed 168) and now considering 752/921 (removed 169) transitions.
// Phase 1: matrix 752 rows 340 cols
[2023-03-13 14:59:08] [INFO ] Computed 47 place invariants in 15 ms
[2023-03-13 14:59:08] [INFO ] Implicit Places using invariants in 286 ms returned [90, 96, 99, 101, 110, 111, 163, 180, 186, 189, 191, 196, 197, 249, 266, 272, 275, 277]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 289 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 322/553 places, 752/921 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 313 transition count 743
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 313 transition count 743
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 310 transition count 740
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 310 transition count 740
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 305 transition count 735
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 43 place count 305 transition count 726
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 52 place count 296 transition count 726
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 296 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 294 transition count 724
Applied a total of 56 rules in 60 ms. Remains 294 /322 variables (removed 28) and now considering 724/752 (removed 28) transitions.
// Phase 1: matrix 724 rows 294 cols
[2023-03-13 14:59:08] [INFO ] Computed 29 place invariants in 5 ms
[2023-03-13 14:59:08] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-13 14:59:08] [INFO ] Invariant cache hit.
[2023-03-13 14:59:09] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 294/553 places, 724/921 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2362 ms. Remains : 294/553 places, 724/921 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 237125 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237125 steps, saw 174056 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 14:59:13] [INFO ] Invariant cache hit.
[2023-03-13 14:59:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:59:13] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-13 14:59:13] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 14:59:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:59:13] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-13 14:59:18] [INFO ] After 5214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 14:59:19] [INFO ] After 5574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-13 14:59:19] [INFO ] After 5903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 16 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 294/294 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 11 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2023-03-13 14:59:19] [INFO ] Invariant cache hit.
[2023-03-13 14:59:19] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-13 14:59:19] [INFO ] Invariant cache hit.
[2023-03-13 14:59:20] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2023-03-13 14:59:20] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-13 14:59:20] [INFO ] Invariant cache hit.
[2023-03-13 14:59:20] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1472 ms. Remains : 294/294 places, 724/724 transitions.
Applied a total of 0 rules in 8 ms. Remains 294 /294 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-13 14:59:20] [INFO ] Invariant cache hit.
[2023-03-13 14:59:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:59:20] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-13 14:59:21] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 14:59:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 14:59:21] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 26 ms returned sat
[2023-03-13 14:59:27] [INFO ] After 5605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 14:59:27] [INFO ] After 5874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-13 14:59:27] [INFO ] After 6478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 14:59:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-13 14:59:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 294 places, 724 transitions and 2930 arcs took 9 ms.
[2023-03-13 14:59:28] [INFO ] Flatten gal took : 90 ms
Total runtime 73806 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 03a
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 294 places, 724 transitions, 2930 arcs.
Final Score: 9730.296
Took : 35 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678719603942

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 3966:
syntax error

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-03a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ASLink-PT-03a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-oct2-167813599700047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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