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.r235-tall-167856422300775.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422300775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678694306022

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=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 07:58:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:58:27] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2023-03-13 07:58:27] [INFO ] Transformed 4914 places.
[2023-03-13 07:58:27] [INFO ] Transformed 6913 transitions.
[2023-03-13 07:58:27] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 192 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-13 07:58:29] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-13 07:58:30] [INFO ] Computed 535 place invariants in 356 ms
[2023-03-13 07:58:31] [INFO ] [Real]Absence check using 48 positive place invariants in 31 ms returned sat
[2023-03-13 07:58:31] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 212 ms returned sat
[2023-03-13 07:58:36] [INFO ] After 3912ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:9
[2023-03-13 07:58:36] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-13 07:58:36] [INFO ] After 550ms SMT Verify possible using 1906 Read/Feed constraints in real domain returned unsat :2 sat :0 real:10
[2023-03-13 07:58:36] [INFO ] After 6498ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2023-03-13 07:58:37] [INFO ] [Nat]Absence check using 48 positive place invariants in 20 ms returned sat
[2023-03-13 07:58:38] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 220 ms returned sat
[2023-03-13 07:58:52] [INFO ] After 13597ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-03-13 07:59:01] [INFO ] After 9500ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2023-03-13 07:59:01] [INFO ] After 9503ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 07:59:01] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 91 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.22 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1273 transitions
Trivial Post-agglo rules discarded 1273 transitions
Performed 1273 trivial Post agglomeration. Transition count delta: 1273
Iterating post reduction 0 with 1273 rules applied. Total rules applied 1274 place count 4884 transition count 5640
Reduce places removed 1273 places and 0 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Iterating post reduction 1 with 1344 rules applied. Total rules applied 2618 place count 3611 transition count 5569
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 2689 place count 3540 transition count 5569
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 2689 place count 3540 transition count 5409
Deduced a syphon composed of 160 places in 4 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 3009 place count 3380 transition count 5409
Discarding 1165 places :
Symmetric choice reduction at 3 with 1165 rule applications. Total rules 4174 place count 2215 transition count 4244
Iterating global reduction 3 with 1165 rules applied. Total rules applied 5339 place count 2215 transition count 4244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5339 place count 2215 transition count 4243
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5341 place count 2214 transition count 4243
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 5543 place count 2012 transition count 3233
Iterating global reduction 3 with 202 rules applied. Total rules applied 5745 place count 2012 transition count 3233
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 5771 place count 1999 transition count 3220
Free-agglomeration rule (complex) applied 118 times.
Iterating global reduction 3 with 118 rules applied. Total rules applied 5889 place count 1999 transition count 3102
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 3 with 118 rules applied. Total rules applied 6007 place count 1881 transition count 3102
Partial Free-agglomeration rule applied 144 times.
Drop transitions removed 144 transitions
Iterating global reduction 4 with 144 rules applied. Total rules applied 6151 place count 1881 transition count 3102
Applied a total of 6151 rules in 1737 ms. Remains 1881 /4914 variables (removed 3033) and now considering 3102/6913 (removed 3811) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1738 ms. Remains : 1881/4914 places, 3102/6913 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 07:59:04] [INFO ] Flow matrix only has 2712 transitions (discarded 390 similar events)
// Phase 1: matrix 2712 rows 1881 cols
[2023-03-13 07:59:04] [INFO ] Computed 505 place invariants in 33 ms
[2023-03-13 07:59:04] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-13 07:59:04] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 94 ms returned sat
[2023-03-13 07:59:05] [INFO ] After 747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 07:59:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-13 07:59:05] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 95 ms returned sat
[2023-03-13 07:59:08] [INFO ] After 2702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 07:59:08] [INFO ] State equation strengthened by 1098 read => feed constraints.
[2023-03-13 07:59:12] [INFO ] After 4371ms SMT Verify possible using 1098 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-13 07:59:14] [INFO ] Deduced a trap composed of 300 places in 1012 ms of which 4 ms to minimize.
[2023-03-13 07:59:15] [INFO ] Deduced a trap composed of 303 places in 1021 ms of which 2 ms to minimize.
[2023-03-13 07:59:16] [INFO ] Deduced a trap composed of 263 places in 1051 ms of which 2 ms to minimize.
[2023-03-13 07:59:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3616 ms
[2023-03-13 07:59:18] [INFO ] Deduced a trap composed of 129 places in 1030 ms of which 3 ms to minimize.
[2023-03-13 07:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1393 ms
[2023-03-13 07:59:22] [INFO ] Deduced a trap composed of 226 places in 1073 ms of which 2 ms to minimize.
[2023-03-13 07:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1588 ms
[2023-03-13 07:59:24] [INFO ] Deduced a trap composed of 269 places in 1051 ms of which 2 ms to minimize.
[2023-03-13 07:59:25] [INFO ] Deduced a trap composed of 368 places in 1069 ms of which 2 ms to minimize.
[2023-03-13 07:59:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2396 ms
[2023-03-13 07:59:27] [INFO ] Deduced a trap composed of 246 places in 1094 ms of which 5 ms to minimize.
[2023-03-13 07:59:28] [INFO ] Deduced a trap composed of 240 places in 1105 ms of which 2 ms to minimize.
[2023-03-13 07:59:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2474 ms
[2023-03-13 07:59:28] [INFO ] After 19908ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 1707 ms.
[2023-03-13 07:59:30] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 69 out of 1881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1881/1881 places, 3102/3102 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1881 transition count 3099
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1878 transition count 3098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1877 transition count 3098
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 1877 transition count 3095
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 1874 transition count 3095
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 22 place count 1866 transition count 3071
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 1866 transition count 3071
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 1866 transition count 3070
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 1865 transition count 3070
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 1862 transition count 3055
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 1862 transition count 3055
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 43 place count 1862 transition count 3055
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 46 place count 1859 transition count 3052
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 1859 transition count 3052
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 1857 transition count 3042
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 1857 transition count 3042
Applied a total of 53 rules in 399 ms. Remains 1857 /1881 variables (removed 24) and now considering 3042/3102 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 1857/1881 places, 3042/3102 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 07:59:31] [INFO ] Flow matrix only has 2652 transitions (discarded 390 similar events)
// Phase 1: matrix 2652 rows 1857 cols
[2023-03-13 07:59:31] [INFO ] Computed 505 place invariants in 73 ms
[2023-03-13 07:59:31] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-13 07:59:31] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 104 ms returned sat
[2023-03-13 07:59:31] [INFO ] After 627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 07:59:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-13 07:59:32] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 99 ms returned sat
[2023-03-13 07:59:34] [INFO ] After 2206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 07:59:34] [INFO ] State equation strengthened by 1062 read => feed constraints.
[2023-03-13 07:59:36] [INFO ] After 1859ms SMT Verify possible using 1062 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 07:59:38] [INFO ] Deduced a trap composed of 257 places in 955 ms of which 1 ms to minimize.
[2023-03-13 07:59:40] [INFO ] Deduced a trap composed of 257 places in 1065 ms of which 1 ms to minimize.
[2023-03-13 07:59:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2424 ms
[2023-03-13 07:59:41] [INFO ] Deduced a trap composed of 220 places in 1053 ms of which 2 ms to minimize.
[2023-03-13 07:59:42] [INFO ] Deduced a trap composed of 207 places in 1030 ms of which 2 ms to minimize.
[2023-03-13 07:59:43] [INFO ] Deduced a trap composed of 265 places in 1064 ms of which 2 ms to minimize.
[2023-03-13 07:59:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3495 ms
[2023-03-13 07:59:45] [INFO ] Deduced a trap composed of 240 places in 1012 ms of which 1 ms to minimize.
[2023-03-13 07:59:46] [INFO ] Deduced a trap composed of 234 places in 962 ms of which 2 ms to minimize.
[2023-03-13 07:59:47] [INFO ] Deduced a trap composed of 390 places in 1000 ms of which 2 ms to minimize.
[2023-03-13 07:59:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3343 ms
[2023-03-13 07:59:47] [INFO ] After 12832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1397 ms.
[2023-03-13 07:59:48] [INFO ] After 17040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 3 ms.
Support contains 51 out of 1857 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1857/1857 places, 3042/3042 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1857 transition count 3036
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1851 transition count 3036
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 1851 transition count 3035
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1850 transition count 3035
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 1845 transition count 3018
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 1845 transition count 3018
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 1843 transition count 3008
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 1843 transition count 3008
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 1842 transition count 3007
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 1842 transition count 3004
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 1839 transition count 3004
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 1838 transition count 3003
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 1838 transition count 3003
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 1837 transition count 2998
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 1837 transition count 2998
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 45 place count 1837 transition count 2998
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 1833 transition count 2994
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 1833 transition count 2994
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 1829 transition count 2974
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 1829 transition count 2974
Applied a total of 61 rules in 533 ms. Remains 1829 /1857 variables (removed 28) and now considering 2974/3042 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 534 ms. Remains : 1829/1857 places, 2974/3042 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 57696 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57696 steps, saw 26341 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 07:59:52] [INFO ] Flow matrix only has 2582 transitions (discarded 392 similar events)
// Phase 1: matrix 2582 rows 1829 cols
[2023-03-13 07:59:53] [INFO ] Computed 505 place invariants in 35 ms
[2023-03-13 07:59:53] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-13 07:59:53] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 95 ms returned sat
[2023-03-13 07:59:54] [INFO ] After 1624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 07:59:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-13 07:59:55] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 97 ms returned sat
[2023-03-13 07:59:57] [INFO ] After 2052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 07:59:57] [INFO ] State equation strengthened by 1022 read => feed constraints.
[2023-03-13 08:00:00] [INFO ] After 3143ms SMT Verify possible using 1022 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 08:00:02] [INFO ] Deduced a trap composed of 235 places in 981 ms of which 2 ms to minimize.
[2023-03-13 08:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1178 ms
[2023-03-13 08:00:03] [INFO ] Deduced a trap composed of 229 places in 973 ms of which 2 ms to minimize.
[2023-03-13 08:00:05] [INFO ] Deduced a trap composed of 263 places in 995 ms of which 2 ms to minimize.
[2023-03-13 08:00:06] [INFO ] Deduced a trap composed of 260 places in 1008 ms of which 2 ms to minimize.
[2023-03-13 08:00:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3324 ms
[2023-03-13 08:00:07] [INFO ] Deduced a trap composed of 313 places in 959 ms of which 2 ms to minimize.
[2023-03-13 08:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1123 ms
[2023-03-13 08:00:07] [INFO ] After 10376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2076 ms.
[2023-03-13 08:00:09] [INFO ] After 15096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 6 ms.
Support contains 51 out of 1829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1829/1829 places, 2974/2974 transitions.
Applied a total of 0 rules in 68 ms. Remains 1829 /1829 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1829/1829 places, 2974/2974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1829/1829 places, 2974/2974 transitions.
Applied a total of 0 rules in 70 ms. Remains 1829 /1829 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
[2023-03-13 08:00:09] [INFO ] Flow matrix only has 2582 transitions (discarded 392 similar events)
[2023-03-13 08:00:09] [INFO ] Invariant cache hit.
[2023-03-13 08:00:11] [INFO ] Implicit Places using invariants in 2018 ms returned [4, 8, 11, 12, 13, 14, 15, 16, 21, 27, 35, 45, 57, 71, 86, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 161, 167, 170, 171, 173, 174, 175, 178, 182, 190, 198, 208, 220, 233, 246, 247, 248, 249, 250, 251, 261, 269, 275, 279, 281, 283, 297, 304, 307, 309, 311, 312, 315, 319, 323, 332, 340, 350, 361, 372, 373, 374, 375, 376, 377, 385, 391, 395, 397, 399, 401, 415, 421, 424, 425, 426, 427, 428, 429, 431, 433, 435, 439, 445, 453, 462, 471, 472, 473, 474, 475, 476, 482, 486, 488, 490, 492, 494, 507, 513, 516, 517, 518, 519, 521, 523, 525, 527, 530, 536, 542, 549, 556, 557, 558, 559, 560, 561, 565, 567, 569, 571, 573, 575, 589, 595, 598, 599, 600, 601, 602, 603, 605, 607, 609, 611, 613, 617, 622, 627, 628, 629, 630, 631, 632, 634, 636, 638, 640, 642, 644, 657, 663, 666, 667, 668, 669, 670, 671, 673, 675, 677, 679, 681, 683, 686, 689, 690, 691, 692, 693, 694, 696, 698, 700, 702, 704, 706, 719, 725, 728, 729, 730, 731, 732, 733, 735, 737, 739, 741, 743, 746, 748, 751, 752, 753, 755, 756, 758, 760, 762, 764, 768, 770, 784, 786, 789, 792, 793, 794, 795, 796, 797, 800, 802, 804, 806, 808, 810, 812, 815, 816, 817, 818, 819, 820, 822, 824, 826, 828, 830, 832, 851, 854, 855, 856, 857, 859, 861, 866, 868, 870, 872, 874, 876, 879, 881, 882, 883, 884, 886, 888, 890, 892, 894, 899, 912, 918, 921, 922, 923, 924, 925, 926, 928, 930, 932, 935, 937, 939, 941, 945, 946, 947, 948, 949, 950, 952, 954, 956, 958, 960, 962, 975, 981, 984, 986, 987, 988, 989, 991, 993, 995, 997, 999, 1003, 1007, 1013, 1014, 1015, 1016, 1017, 1018, 1022, 1024, 1026, 1028, 1030, 1032, 1047, 1053, 1056, 1057, 1058, 1059, 1060, 1061, 1064, 1066, 1068, 1070, 1072, 1076, 1091, 1092, 1093, 1094, 1096, 1102, 1106, 1108, 1110, 1112, 1117, 1130, 1136, 1139, 1140, 1141, 1142, 1144, 1149, 1151, 1153, 1155, 1159, 1165, 1173, 1183, 1184, 1185, 1186, 1187, 1188, 1196, 1202, 1206, 1208, 1210, 1212, 1225, 1231, 1234, 1235, 1236, 1237, 1238, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1286, 1287, 1288, 1289, 1290, 1300, 1308, 1314, 1318, 1320, 1322, 1335, 1341, 1344, 1345, 1346, 1347, 1349, 1351, 1357, 1361, 1367, 1375, 1385, 1397, 1411, 1412, 1413, 1414, 1415, 1416, 1429, 1439, 1447, 1453, 1457, 1459, 1472, 1474, 1478, 1481, 1482, 1483, 1484, 1485, 1486, 1488, 1493, 1499, 1507, 1517, 1529, 1543, 1559, 1560, 1561, 1562, 1563, 1564, 1578, 1590, 1600, 1608, 1614, 1618, 1631]
Discarding 449 places :
Implicit Place search using SMT only with invariants took 2025 ms to find 449 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1380/1829 places, 2974/2974 transitions.
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 149 place count 1231 transition count 2825
Iterating global reduction 0 with 149 rules applied. Total rules applied 298 place count 1231 transition count 2825
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 446 place count 1083 transition count 2677
Iterating global reduction 0 with 148 rules applied. Total rules applied 594 place count 1083 transition count 2677
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 616 place count 1061 transition count 2567
Iterating global reduction 0 with 22 rules applied. Total rules applied 638 place count 1061 transition count 2567
Applied a total of 638 rules in 131 ms. Remains 1061 /1380 variables (removed 319) and now considering 2567/2974 (removed 407) transitions.
[2023-03-13 08:00:12] [INFO ] Flow matrix only has 2175 transitions (discarded 392 similar events)
// Phase 1: matrix 2175 rows 1061 cols
[2023-03-13 08:00:12] [INFO ] Computed 56 place invariants in 32 ms
[2023-03-13 08:00:12] [INFO ] Implicit Places using invariants in 812 ms returned []
[2023-03-13 08:00:12] [INFO ] Flow matrix only has 2175 transitions (discarded 392 similar events)
[2023-03-13 08:00:12] [INFO ] Invariant cache hit.
[2023-03-13 08:00:13] [INFO ] State equation strengthened by 934 read => feed constraints.
[2023-03-13 08:00:25] [INFO ] Implicit Places using invariants and state equation in 12508 ms returned []
Implicit Place search using SMT with State Equation took 13324 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1061/1829 places, 2567/2974 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15551 ms. Remains : 1061/1829 places, 2567/2974 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 55 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 55 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 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 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 08:00:25] [INFO ] Flow matrix only has 2175 transitions (discarded 392 similar events)
[2023-03-13 08:00:25] [INFO ] Invariant cache hit.
[2023-03-13 08:00:25] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-13 08:00:25] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-13 08:00:25] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 08:00:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-13 08:00:26] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-13 08:00:27] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 08:00:27] [INFO ] State equation strengthened by 934 read => feed constraints.
[2023-03-13 08:00:29] [INFO ] After 1721ms SMT Verify possible using 934 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 08:00:31] [INFO ] Deduced a trap composed of 137 places in 430 ms of which 1 ms to minimize.
[2023-03-13 08:00:32] [INFO ] Deduced a trap composed of 122 places in 404 ms of which 1 ms to minimize.
[2023-03-13 08:00:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1021 ms
[2023-03-13 08:00:32] [INFO ] After 4637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1212 ms.
[2023-03-13 08:00:33] [INFO ] After 7442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 50 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 2567/2567 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 1061 transition count 2566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1060 transition count 2566
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1060 transition count 2566
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1059 transition count 2565
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1059 transition count 2565
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 1058 transition count 2560
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1058 transition count 2560
Applied a total of 7 rules in 149 ms. Remains 1058 /1061 variables (removed 3) and now considering 2560/2567 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 1058/1061 places, 2560/2567 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69137 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69137 steps, saw 29807 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 08:00:36] [INFO ] Flow matrix only has 2168 transitions (discarded 392 similar events)
// Phase 1: matrix 2168 rows 1058 cols
[2023-03-13 08:00:36] [INFO ] Computed 56 place invariants in 24 ms
[2023-03-13 08:00:37] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2023-03-13 08:00:37] [INFO ] [Real]Absence check using 31 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-13 08:00:37] [INFO ] After 1002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 08:00:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-13 08:00:38] [INFO ] [Nat]Absence check using 31 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-13 08:00:39] [INFO ] After 1248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 08:00:39] [INFO ] State equation strengthened by 930 read => feed constraints.
[2023-03-13 08:00:41] [INFO ] After 1984ms SMT Verify possible using 930 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 08:00:42] [INFO ] Deduced a trap composed of 153 places in 368 ms of which 1 ms to minimize.
[2023-03-13 08:00:42] [INFO ] Deduced a trap composed of 170 places in 368 ms of which 1 ms to minimize.
[2023-03-13 08:00:43] [INFO ] Deduced a trap composed of 167 places in 355 ms of which 0 ms to minimize.
[2023-03-13 08:00:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1507 ms
[2023-03-13 08:00:44] [INFO ] Deduced a trap composed of 118 places in 401 ms of which 1 ms to minimize.
[2023-03-13 08:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 841 ms
[2023-03-13 08:00:45] [INFO ] Deduced a trap composed of 185 places in 406 ms of which 1 ms to minimize.
[2023-03-13 08:00:45] [INFO ] Deduced a trap composed of 143 places in 375 ms of which 1 ms to minimize.
[2023-03-13 08:00:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1036 ms
[2023-03-13 08:00:46] [INFO ] Deduced a trap composed of 116 places in 409 ms of which 10 ms to minimize.
[2023-03-13 08:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
[2023-03-13 08:00:46] [INFO ] After 7363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1222 ms.
[2023-03-13 08:00:48] [INFO ] After 10104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 3 ms.
Support contains 50 out of 1058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 2560/2560 transitions.
Applied a total of 0 rules in 47 ms. Remains 1058 /1058 variables (removed 0) and now considering 2560/2560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1058/1058 places, 2560/2560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 2560/2560 transitions.
Applied a total of 0 rules in 56 ms. Remains 1058 /1058 variables (removed 0) and now considering 2560/2560 (removed 0) transitions.
[2023-03-13 08:00:48] [INFO ] Flow matrix only has 2168 transitions (discarded 392 similar events)
[2023-03-13 08:00:48] [INFO ] Invariant cache hit.
[2023-03-13 08:00:48] [INFO ] Implicit Places using invariants in 781 ms returned [527]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 785 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1057/1058 places, 2560/2560 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1056 transition count 2559
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1056 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1055 transition count 2558
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1055 transition count 2558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1054 transition count 2553
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1054 transition count 2553
Applied a total of 6 rules in 115 ms. Remains 1054 /1057 variables (removed 3) and now considering 2553/2560 (removed 7) transitions.
[2023-03-13 08:00:49] [INFO ] Flow matrix only has 2161 transitions (discarded 392 similar events)
// Phase 1: matrix 2161 rows 1054 cols
[2023-03-13 08:00:49] [INFO ] Computed 55 place invariants in 37 ms
[2023-03-13 08:00:49] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-13 08:00:49] [INFO ] Flow matrix only has 2161 transitions (discarded 392 similar events)
[2023-03-13 08:00:49] [INFO ] Invariant cache hit.
[2023-03-13 08:00:50] [INFO ] State equation strengthened by 926 read => feed constraints.
[2023-03-13 08:01:01] [INFO ] Implicit Places using invariants and state equation in 11684 ms returned []
Implicit Place search using SMT with State Equation took 12455 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1054/1058 places, 2553/2560 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13413 ms. Remains : 1054/1058 places, 2553/2560 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 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 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 65119 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65119 steps, saw 28060 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 08:01:04] [INFO ] Flow matrix only has 2161 transitions (discarded 392 similar events)
[2023-03-13 08:01:04] [INFO ] Invariant cache hit.
[2023-03-13 08:01:05] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-13 08:01:05] [INFO ] [Real]Absence check using 33 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-13 08:01:05] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 08:01:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-13 08:01:05] [INFO ] [Nat]Absence check using 33 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-13 08:01:06] [INFO ] After 1141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 08:01:06] [INFO ] State equation strengthened by 926 read => feed constraints.
[2023-03-13 08:01:08] [INFO ] After 2158ms SMT Verify possible using 926 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 08:01:09] [INFO ] Deduced a trap composed of 126 places in 396 ms of which 1 ms to minimize.
[2023-03-13 08:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 788 ms
[2023-03-13 08:01:10] [INFO ] Deduced a trap composed of 150 places in 374 ms of which 1 ms to minimize.
[2023-03-13 08:01:11] [INFO ] Deduced a trap composed of 97 places in 391 ms of which 1 ms to minimize.
[2023-03-13 08:01:11] [INFO ] Deduced a trap composed of 113 places in 431 ms of which 1 ms to minimize.
[2023-03-13 08:01:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1673 ms
[2023-03-13 08:01:12] [INFO ] Deduced a trap composed of 124 places in 403 ms of which 1 ms to minimize.
[2023-03-13 08:01:13] [INFO ] Deduced a trap composed of 123 places in 404 ms of which 1 ms to minimize.
[2023-03-13 08:01:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 997 ms
[2023-03-13 08:01:13] [INFO ] After 6718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1167 ms.
[2023-03-13 08:01:14] [INFO ] After 9274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 50 out of 1054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1054/1054 places, 2553/2553 transitions.
Applied a total of 0 rules in 55 ms. Remains 1054 /1054 variables (removed 0) and now considering 2553/2553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1054/1054 places, 2553/2553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1054/1054 places, 2553/2553 transitions.
Applied a total of 0 rules in 57 ms. Remains 1054 /1054 variables (removed 0) and now considering 2553/2553 (removed 0) transitions.
[2023-03-13 08:01:14] [INFO ] Flow matrix only has 2161 transitions (discarded 392 similar events)
[2023-03-13 08:01:14] [INFO ] Invariant cache hit.
[2023-03-13 08:01:15] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-13 08:01:15] [INFO ] Flow matrix only has 2161 transitions (discarded 392 similar events)
[2023-03-13 08:01:15] [INFO ] Invariant cache hit.
[2023-03-13 08:01:15] [INFO ] State equation strengthened by 926 read => feed constraints.
[2023-03-13 08:01:26] [INFO ] Implicit Places using invariants and state equation in 11091 ms returned []
Implicit Place search using SMT with State Equation took 11821 ms to find 0 implicit places.
[2023-03-13 08:01:26] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-13 08:01:26] [INFO ] Flow matrix only has 2161 transitions (discarded 392 similar events)
[2023-03-13 08:01:26] [INFO ] Invariant cache hit.
[2023-03-13 08:01:27] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12968 ms. Remains : 1054/1054 places, 2553/2553 transitions.
Graph (trivial) has 792 edges and 1054 vertex of which 14 / 1054 are part of one of the 1 SCC in 4 ms
Free SCC test removed 13 places
Drop transitions removed 234 transitions
Ensure Unique test removed 374 transitions
Reduce isomorphic transitions removed 608 transitions.
Graph (complete) has 3106 edges and 1041 vertex of which 1028 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 1012 transition count 1893
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 127 rules applied. Total rules applied 181 place count 962 transition count 1816
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 2 with 99 rules applied. Total rules applied 280 place count 924 transition count 1755
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 67 rules applied. Total rules applied 347 place count 901 transition count 1711
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 21 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 4 with 53 rules applied. Total rules applied 400 place count 880 transition count 1679
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 32 rules applied. Total rules applied 432 place count 869 transition count 1658
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 25 rules applied. Total rules applied 457 place count 859 transition count 1643
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 13 rules applied. Total rules applied 470 place count 854 transition count 1635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 8 with 7 rules applied. Total rules applied 477 place count 851 transition count 1631
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 9 with 5 rules applied. Total rules applied 482 place count 850 transition count 1627
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 486 place count 847 transition count 1626
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 19 Pre rules applied. Total rules applied 486 place count 847 transition count 1607
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 38 rules applied. Total rules applied 524 place count 828 transition count 1607
Discarding 196 places :
Symmetric choice reduction at 11 with 196 rule applications. Total rules 720 place count 632 transition count 1411
Iterating global reduction 11 with 196 rules applied. Total rules applied 916 place count 632 transition count 1411
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 11 with 109 rules applied. Total rules applied 1025 place count 632 transition count 1302
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 1 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 12 with 756 rules applied. Total rules applied 1781 place count 254 transition count 924
Drop transitions removed 323 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 345 transitions.
Iterating post reduction 12 with 345 rules applied. Total rules applied 2126 place count 254 transition count 579
Discarding 33 places :
Symmetric choice reduction at 13 with 33 rule applications. Total rules 2159 place count 221 transition count 498
Iterating global reduction 13 with 33 rules applied. Total rules applied 2192 place count 221 transition count 498
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 2204 place count 215 transition count 536
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 13 with 48 rules applied. Total rules applied 2252 place count 215 transition count 488
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 4 rules applied. Total rules applied 2256 place count 215 transition count 484
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 5 rules applied. Total rules applied 2261 place count 211 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2262 place count 210 transition count 483
Discarding 17 places :
Symmetric choice reduction at 16 with 17 rule applications. Total rules 2279 place count 193 transition count 450
Iterating global reduction 16 with 17 rules applied. Total rules applied 2296 place count 193 transition count 450
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 16 with 25 rules applied. Total rules applied 2321 place count 193 transition count 425
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 2325 place count 191 transition count 443
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 2328 place count 191 transition count 440
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 2331 place count 188 transition count 440
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 18 with 14 rules applied. Total rules applied 2345 place count 188 transition count 426
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 18 with 14 rules applied. Total rules applied 2359 place count 174 transition count 426
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 19 with 19 rules applied. Total rules applied 2378 place count 174 transition count 426
Partial Post-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 19 with 37 rules applied. Total rules applied 2415 place count 174 transition count 426
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 2417 place count 172 transition count 420
Iterating global reduction 19 with 2 rules applied. Total rules applied 2419 place count 172 transition count 420
Applied a total of 2419 rules in 606 ms. Remains 172 /1054 variables (removed 882) and now considering 420/2553 (removed 2133) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 420 rows 172 cols
[2023-03-13 08:01:28] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-13 08:01:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 08:01:28] [INFO ] [Real]Absence check using 4 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-13 08:01:28] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 08:01:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-13 08:01:28] [INFO ] [Nat]Absence check using 4 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-13 08:01:28] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 08:01:28] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2023-03-13 08:01:28] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2023-03-13 08:01:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-03-13 08:01:28] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2023-03-13 08:01:28] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 0 ms to minimize.
[2023-03-13 08:01:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-13 08:01:28] [INFO ] After 692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-13 08:01:28] [INFO ] After 876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 08:01:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-13 08:01:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1054 places, 2553 transitions and 11870 arcs took 17 ms.
[2023-03-13 08:01:29] [INFO ] Flatten gal took : 193 ms
Total runtime 181922 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S16C05
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: 1054 places, 2553 transitions, 11870 arcs.
Final Score: 406755.435
Took : 31 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678694521844

--------------------
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 15529:
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="MultiCrashLeafsetExtension-PT-S16C05"
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 MultiCrashLeafsetExtension-PT-S16C05, 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 r235-tall-167856422300775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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