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-167813599800143.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-09a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599800143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:09 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.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 839K 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-09a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678727676402

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-09a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 17:14:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:14:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:14:38] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-13 17:14:38] [INFO ] Transformed 1991 places.
[2023-03-13 17:14:39] [INFO ] Transformed 2919 transitions.
[2023-03-13 17:14:39] [INFO ] Found NUPN structural information;
[2023-03-13 17:14:39] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 16) seen :5
FORMULA ASLink-PT-09a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2888 rows 1991 cols
[2023-03-13 17:14:40] [INFO ] Computed 384 place invariants in 179 ms
[2023-03-13 17:14:41] [INFO ] After 1174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 17:14:42] [INFO ] [Nat]Absence check using 93 positive place invariants in 78 ms returned sat
[2023-03-13 17:14:42] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 117 ms returned sat
[2023-03-13 17:15:06] [INFO ] After 23496ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-13 17:15:06] [INFO ] After 23501ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 17:15:06] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
FORMULA ASLink-PT-09a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 430 ms.
Support contains 179 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 215 rules applied. Total rules applied 215 place count 1937 transition count 2727
Reduce places removed 161 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 167 rules applied. Total rules applied 382 place count 1776 transition count 2721
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 388 place count 1770 transition count 2721
Performed 177 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 177 Pre rules applied. Total rules applied 388 place count 1770 transition count 2544
Deduced a syphon composed of 177 places in 7 ms
Ensure Unique test removed 67 places
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 3 with 421 rules applied. Total rules applied 809 place count 1526 transition count 2544
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 810 place count 1526 transition count 2543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 811 place count 1525 transition count 2543
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 820 place count 1516 transition count 2496
Ensure Unique test removed 1 places
Iterating global reduction 5 with 10 rules applied. Total rules applied 830 place count 1515 transition count 2496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 5 rules applied. Total rules applied 835 place count 1514 transition count 2492
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 837 place count 1512 transition count 2492
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 838 place count 1511 transition count 2484
Iterating global reduction 7 with 1 rules applied. Total rules applied 839 place count 1511 transition count 2484
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 9 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 939 place count 1461 transition count 2434
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 940 place count 1461 transition count 2433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 941 place count 1460 transition count 2433
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 947 place count 1460 transition count 2427
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 953 place count 1454 transition count 2427
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 963 place count 1454 transition count 2427
Applied a total of 963 rules in 851 ms. Remains 1454 /1991 variables (removed 537) and now considering 2427/2888 (removed 461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 851 ms. Remains : 1454/1991 places, 2427/2888 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 8) seen :1
FORMULA ASLink-PT-09a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2427 rows 1454 cols
[2023-03-13 17:15:08] [INFO ] Computed 261 place invariants in 26 ms
[2023-03-13 17:15:09] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 17:15:09] [INFO ] [Nat]Absence check using 72 positive place invariants in 36 ms returned sat
[2023-03-13 17:15:09] [INFO ] [Nat]Absence check using 72 positive and 189 generalized place invariants in 109 ms returned sat
[2023-03-13 17:15:30] [INFO ] After 20525ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-13 17:15:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 17:15:34] [INFO ] After 3548ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-13 17:15:34] [INFO ] After 3560ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:15:34] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA ASLink-PT-09a-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 172 ms.
Support contains 78 out of 1454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1454/1454 places, 2427/2427 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1454 transition count 2415
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1442 transition count 2415
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 24 place count 1442 transition count 2409
Deduced a syphon composed of 6 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 40 place count 1432 transition count 2409
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1430 transition count 2397
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1430 transition count 2397
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 1424 transition count 2391
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 1424 transition count 2389
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 1422 transition count 2389
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 1422 transition count 2387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 1420 transition count 2387
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 1420 transition count 2387
Applied a total of 66 rules in 581 ms. Remains 1420 /1454 variables (removed 34) and now considering 2387/2427 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 581 ms. Remains : 1420/1454 places, 2387/2427 transitions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 133724 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133724 steps, saw 42123 distinct states, run finished after 3005 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2387 rows 1420 cols
[2023-03-13 17:15:38] [INFO ] Computed 257 place invariants in 52 ms
[2023-03-13 17:15:38] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 17:15:39] [INFO ] [Nat]Absence check using 70 positive place invariants in 21 ms returned sat
[2023-03-13 17:15:39] [INFO ] [Nat]Absence check using 70 positive and 187 generalized place invariants in 62 ms returned sat
[2023-03-13 17:16:01] [INFO ] After 22074ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 17:16:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 17:16:03] [INFO ] After 2070ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-13 17:16:03] [INFO ] After 2426ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:16:03] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-09a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 201 ms.
Support contains 76 out of 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2387/2387 transitions.
Applied a total of 0 rules in 68 ms. Remains 1420 /1420 variables (removed 0) and now considering 2387/2387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1420/1420 places, 2387/2387 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 139832 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139832 steps, saw 44923 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 17:16:07] [INFO ] Invariant cache hit.
[2023-03-13 17:16:07] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 17:16:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2023-03-13 17:16:08] [INFO ] [Nat]Absence check using 70 positive and 187 generalized place invariants in 50 ms returned sat
[2023-03-13 17:16:18] [INFO ] After 10540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 17:16:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 17:16:22] [INFO ] After 3306ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 17:16:23] [INFO ] After 4914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4783 ms.
[2023-03-13 17:16:28] [INFO ] After 20705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 182 ms.
Support contains 76 out of 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2387/2387 transitions.
Applied a total of 0 rules in 42 ms. Remains 1420 /1420 variables (removed 0) and now considering 2387/2387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1420/1420 places, 2387/2387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2387/2387 transitions.
Applied a total of 0 rules in 39 ms. Remains 1420 /1420 variables (removed 0) and now considering 2387/2387 (removed 0) transitions.
[2023-03-13 17:16:28] [INFO ] Invariant cache hit.
[2023-03-13 17:16:30] [INFO ] Implicit Places using invariants in 1298 ms returned [1, 19, 20, 22, 32, 50, 68, 106, 150, 163, 164, 165, 166, 167, 185, 203, 283, 296, 297, 298, 299, 319, 337, 405, 419, 432, 433, 434, 435, 436, 454, 472, 525, 555, 570, 571, 572, 573, 574, 610, 691, 704, 705, 706, 707, 708, 726, 744, 826, 839, 840, 841, 842, 843, 861, 879, 952, 965, 978, 979, 980, 982, 1000, 1018, 1099, 1112, 1113, 1114, 1115, 1116, 1134, 1152, 1233, 1238, 1249, 1250, 1251, 1252, 1253, 1286, 1288, 1309, 1310, 1311, 1312, 1324, 1330, 1336, 1342, 1348, 1354, 1360, 1366, 1372, 1378, 1384]
Discarding 96 places :
Implicit Place search using SMT only with invariants took 1315 ms to find 96 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1324/1420 places, 2387/2387 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1324 transition count 2267
Reduce places removed 120 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 136 rules applied. Total rules applied 256 place count 1204 transition count 2251
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 272 place count 1188 transition count 2251
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 272 place count 1188 transition count 2186
Deduced a syphon composed of 65 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 403 place count 1122 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 43 rules applied. Total rules applied 446 place count 1101 transition count 2164
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 23 rules applied. Total rules applied 469 place count 1079 transition count 2163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 470 place count 1078 transition count 2163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 470 place count 1078 transition count 2162
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 472 place count 1077 transition count 2162
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 487 place count 1062 transition count 2147
Iterating global reduction 6 with 15 rules applied. Total rules applied 502 place count 1062 transition count 2147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 506 place count 1062 transition count 2143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 506 place count 1062 transition count 2142
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 508 place count 1061 transition count 2142
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 516 place count 1053 transition count 2134
Iterating global reduction 7 with 8 rules applied. Total rules applied 524 place count 1053 transition count 2134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 525 place count 1053 transition count 2133
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 526 place count 1052 transition count 2132
Iterating global reduction 8 with 1 rules applied. Total rules applied 527 place count 1052 transition count 2132
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 528 place count 1051 transition count 2131
Iterating global reduction 8 with 1 rules applied. Total rules applied 529 place count 1051 transition count 2131
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 8 with 132 rules applied. Total rules applied 661 place count 985 transition count 2065
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 667 place count 979 transition count 2059
Iterating global reduction 8 with 6 rules applied. Total rules applied 673 place count 979 transition count 2059
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 678 place count 979 transition count 2054
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 679 place count 979 transition count 2053
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 681 place count 978 transition count 2052
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 689 place count 978 transition count 2044
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 703 place count 970 transition count 2038
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 10 with 26 rules applied. Total rules applied 729 place count 970 transition count 2012
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 756 place count 943 transition count 2012
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 11 with 23 rules applied. Total rules applied 779 place count 943 transition count 2012
Applied a total of 779 rules in 632 ms. Remains 943 /1324 variables (removed 381) and now considering 2012/2387 (removed 375) transitions.
// Phase 1: matrix 2012 rows 943 cols
[2023-03-13 17:16:30] [INFO ] Computed 138 place invariants in 15 ms
[2023-03-13 17:16:31] [INFO ] Implicit Places using invariants in 710 ms returned [92, 98, 101, 103, 109, 161, 178, 184, 187, 189, 190, 195, 196, 251, 272, 278, 281, 286, 290, 295, 296, 348, 373, 376, 378, 379, 384, 385, 438, 459, 468, 474, 475, 480, 481, 534, 563, 566, 568, 575, 580, 581, 633, 666, 675, 680, 681, 734, 752, 758, 761, 763, 764, 769, 770, 822, 839, 846, 849, 851, 852]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 726 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 882/1420 places, 2012/2387 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 882 transition count 2011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 881 transition count 2011
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 865 transition count 1995
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 865 transition count 1995
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 860 transition count 1990
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 860 transition count 1990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 859 transition count 1989
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 859 transition count 1989
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 80 place count 842 transition count 1972
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 841 transition count 1970
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 841 transition count 1970
Free-agglomeration rule applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 104 place count 841 transition count 1948
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 126 place count 819 transition count 1948
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 819 transition count 1943
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 814 transition count 1943
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 814 transition count 1943
Applied a total of 137 rules in 187 ms. Remains 814 /882 variables (removed 68) and now considering 1943/2012 (removed 69) transitions.
// Phase 1: matrix 1943 rows 814 cols
[2023-03-13 17:16:31] [INFO ] Computed 77 place invariants in 16 ms
[2023-03-13 17:16:32] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-13 17:16:32] [INFO ] Invariant cache hit.
[2023-03-13 17:16:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 17:16:35] [INFO ] Implicit Places using invariants and state equation in 3382 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 814/1420 places, 1943/2387 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6761 ms. Remains : 814/1420 places, 1943/2387 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 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 21 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 194940 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194940 steps, saw 84585 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 17:16:38] [INFO ] Invariant cache hit.
[2023-03-13 17:16:38] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 17:16:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-13 17:16:39] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 38 ms returned sat
[2023-03-13 17:16:47] [INFO ] After 8761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 17:16:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 17:17:00] [INFO ] After 12546ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 17:17:03] [INFO ] After 16035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:17:03] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ASLink-PT-09a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 357 ms.
Support contains 9 out of 814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 814/814 places, 1943/1943 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 814 transition count 1932
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 26 place count 803 transition count 1928
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 799 transition count 1928
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 30 place count 799 transition count 1923
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 794 transition count 1923
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 793 transition count 1923
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 47 place count 787 transition count 1906
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 54 place count 786 transition count 1906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 786 transition count 1905
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 60 place count 781 transition count 1893
Iterating global reduction 5 with 5 rules applied. Total rules applied 65 place count 781 transition count 1893
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 781 transition count 1892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 67 place count 780 transition count 1892
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 68 place count 779 transition count 1884
Iterating global reduction 7 with 1 rules applied. Total rules applied 69 place count 779 transition count 1884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 70 place count 778 transition count 1876
Iterating global reduction 7 with 1 rules applied. Total rules applied 71 place count 778 transition count 1876
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 72 place count 777 transition count 1868
Iterating global reduction 7 with 1 rules applied. Total rules applied 73 place count 777 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 74 place count 776 transition count 1860
Iterating global reduction 7 with 1 rules applied. Total rules applied 75 place count 776 transition count 1860
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 76 place count 775 transition count 1852
Iterating global reduction 7 with 1 rules applied. Total rules applied 77 place count 775 transition count 1852
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 78 place count 774 transition count 1844
Iterating global reduction 7 with 1 rules applied. Total rules applied 79 place count 774 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 80 place count 773 transition count 1836
Iterating global reduction 7 with 1 rules applied. Total rules applied 81 place count 773 transition count 1836
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 82 place count 772 transition count 1828
Iterating global reduction 7 with 1 rules applied. Total rules applied 83 place count 772 transition count 1828
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 84 place count 771 transition count 1820
Iterating global reduction 7 with 1 rules applied. Total rules applied 85 place count 771 transition count 1820
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 86 place count 770 transition count 1812
Iterating global reduction 7 with 1 rules applied. Total rules applied 87 place count 770 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 88 place count 769 transition count 1804
Iterating global reduction 7 with 1 rules applied. Total rules applied 89 place count 769 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 90 place count 768 transition count 1796
Iterating global reduction 7 with 1 rules applied. Total rules applied 91 place count 768 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 92 place count 767 transition count 1788
Iterating global reduction 7 with 1 rules applied. Total rules applied 93 place count 767 transition count 1788
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 119 place count 754 transition count 1775
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 754 transition count 1774
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 754 transition count 1773
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 123 place count 753 transition count 1772
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 125 place count 753 transition count 1770
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 127 place count 751 transition count 1770
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 129 place count 751 transition count 1770
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 750 transition count 1769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 131 place count 749 transition count 1769
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 131 place count 749 transition count 1765
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 139 place count 745 transition count 1765
Applied a total of 139 rules in 475 ms. Remains 745 /814 variables (removed 69) and now considering 1765/1943 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 745/814 places, 1765/1943 transitions.
Incomplete random walk after 10000 steps, including 144 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 253376 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253376 steps, saw 183047 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1765 rows 745 cols
[2023-03-13 17:17:07] [INFO ] Computed 74 place invariants in 30 ms
[2023-03-13 17:17:08] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 17:17:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-13 17:17:08] [INFO ] [Nat]Absence check using 17 positive and 57 generalized place invariants in 58 ms returned sat
[2023-03-13 17:17:11] [INFO ] After 3143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 17:17:11] [INFO ] After 3447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9142 ms.
[2023-03-13 17:17:20] [INFO ] After 12757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 9 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 1765/1765 transitions.
Applied a total of 0 rules in 51 ms. Remains 745 /745 variables (removed 0) and now considering 1765/1765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 745/745 places, 1765/1765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 1765/1765 transitions.
Applied a total of 0 rules in 27 ms. Remains 745 /745 variables (removed 0) and now considering 1765/1765 (removed 0) transitions.
[2023-03-13 17:17:20] [INFO ] Invariant cache hit.
[2023-03-13 17:17:21] [INFO ] Implicit Places using invariants in 492 ms returned [92, 162, 308, 334, 460, 534, 540]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 506 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 738/745 places, 1765/1765 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 738 transition count 1761
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 734 transition count 1760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 733 transition count 1760
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 14 place count 729 transition count 1756
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 729 transition count 1756
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 21 place count 726 transition count 1753
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 726 transition count 1753
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 3 with 14 rules applied. Total rules applied 38 place count 719 transition count 1746
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 719 transition count 1742
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 46 place count 715 transition count 1742
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 715 transition count 1741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 714 transition count 1741
Applied a total of 48 rules in 154 ms. Remains 714 /738 variables (removed 24) and now considering 1741/1765 (removed 24) transitions.
// Phase 1: matrix 1741 rows 714 cols
[2023-03-13 17:17:21] [INFO ] Computed 67 place invariants in 20 ms
[2023-03-13 17:17:22] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-13 17:17:22] [INFO ] Invariant cache hit.
[2023-03-13 17:17:23] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2174 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 714/745 places, 1741/1765 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2874 ms. Remains : 714/745 places, 1741/1765 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 204949 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204949 steps, saw 133605 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 17:17:26] [INFO ] Invariant cache hit.
[2023-03-13 17:17:27] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 17:17:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-13 17:17:27] [INFO ] [Nat]Absence check using 14 positive and 53 generalized place invariants in 46 ms returned sat
[2023-03-13 17:17:28] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 17:17:30] [INFO ] After 3067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9076 ms.
[2023-03-13 17:17:39] [INFO ] After 12390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 70 ms.
Support contains 9 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1741/1741 transitions.
Applied a total of 0 rules in 21 ms. Remains 714 /714 variables (removed 0) and now considering 1741/1741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 714/714 places, 1741/1741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1741/1741 transitions.
Applied a total of 0 rules in 19 ms. Remains 714 /714 variables (removed 0) and now considering 1741/1741 (removed 0) transitions.
[2023-03-13 17:17:39] [INFO ] Invariant cache hit.
[2023-03-13 17:17:40] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-13 17:17:40] [INFO ] Invariant cache hit.
[2023-03-13 17:17:41] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2023-03-13 17:17:41] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-13 17:17:41] [INFO ] Invariant cache hit.
[2023-03-13 17:17:42] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2978 ms. Remains : 714/714 places, 1741/1741 transitions.
Applied a total of 0 rules in 20 ms. Remains 714 /714 variables (removed 0) and now considering 1741/1741 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 17:17:42] [INFO ] Invariant cache hit.
[2023-03-13 17:17:42] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 17:17:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 17:17:42] [INFO ] [Nat]Absence check using 14 positive and 53 generalized place invariants in 17 ms returned sat
[2023-03-13 17:17:43] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 17:17:49] [INFO ] After 6751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 393 ms.
[2023-03-13 17:17:49] [INFO ] After 7304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 17:17:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-13 17:17:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 714 places, 1741 transitions and 7068 arcs took 15 ms.
[2023-03-13 17:17:50] [INFO ] Flatten gal took : 184 ms
Total runtime 191883 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 09a
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: 714 places, 1741 transitions, 7068 arcs.
Final Score: 29511.56
Took : 77 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678727948241

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 9559:
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-09a"
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-09a, 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-167813599800143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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