Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697100599.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BusinessProcesses-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697100599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K 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 BusinessProcesses-PT-19-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678795366893

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=BusinessProcesses-PT-19
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 12:02:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 12:02:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:02:48] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-14 12:02:48] [INFO ] Transformed 772 places.
[2023-03-14 12:02:48] [INFO ] Transformed 685 transitions.
[2023-03-14 12:02:48] [INFO ] Found NUPN structural information;
[2023-03-14 12:02:48] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 19 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 670 rows 757 cols
[2023-03-14 12:02:50] [INFO ] Computed 125 place invariants in 37 ms
[2023-03-14 12:02:50] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-14 12:02:50] [INFO ] [Nat]Absence check using 78 positive place invariants in 26 ms returned sat
[2023-03-14 12:02:50] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2023-03-14 12:02:52] [INFO ] After 1222ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-14 12:02:53] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 8 ms to minimize.
[2023-03-14 12:02:53] [INFO ] Deduced a trap composed of 14 places in 295 ms of which 1 ms to minimize.
[2023-03-14 12:02:53] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 1 ms to minimize.
[2023-03-14 12:02:53] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 2 ms to minimize.
[2023-03-14 12:02:54] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 0 ms to minimize.
[2023-03-14 12:02:54] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2023-03-14 12:02:54] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2023-03-14 12:02:55] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 1 ms to minimize.
[2023-03-14 12:02:55] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 1 ms to minimize.
[2023-03-14 12:02:55] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 1 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 1 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 1 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 1 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 164 places in 139 ms of which 1 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 0 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 1 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 0 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 0 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 0 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 0 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 159 places in 120 ms of which 0 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 0 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 1 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 0 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 1 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 0 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 172 places in 144 ms of which 1 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 176 places in 130 ms of which 1 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 179 places in 150 ms of which 2 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 178 places in 123 ms of which 1 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 172 places in 179 ms of which 1 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 176 places in 163 ms of which 1 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 180 places in 151 ms of which 1 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 2 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 169 places in 195 ms of which 1 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 1 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 1 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 0 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 1 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 0 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 10265 ms
[2023-03-14 12:03:03] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-14 12:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-14 12:03:03] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-14 12:03:03] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2023-03-14 12:03:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2023-03-14 12:03:04] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2023-03-14 12:03:04] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 0 ms to minimize.
[2023-03-14 12:03:04] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 1 ms to minimize.
[2023-03-14 12:03:04] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 1 ms to minimize.
[2023-03-14 12:03:05] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 1 ms to minimize.
[2023-03-14 12:03:05] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 0 ms to minimize.
[2023-03-14 12:03:05] [INFO ] Deduced a trap composed of 160 places in 138 ms of which 1 ms to minimize.
[2023-03-14 12:03:05] [INFO ] Deduced a trap composed of 150 places in 122 ms of which 1 ms to minimize.
[2023-03-14 12:03:05] [INFO ] Deduced a trap composed of 157 places in 120 ms of which 0 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 0 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 1 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 1 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 1 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 159 places in 131 ms of which 1 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 160 places in 142 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 160 places in 125 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 181 places in 132 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 167 places in 103 ms of which 0 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 176 places in 131 ms of which 0 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 0 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 171 places in 135 ms of which 1 ms to minimize.
[2023-03-14 12:03:09] [INFO ] Deduced a trap composed of 167 places in 100 ms of which 1 ms to minimize.
[2023-03-14 12:03:09] [INFO ] Deduced a trap composed of 163 places in 165 ms of which 1 ms to minimize.
[2023-03-14 12:03:09] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 1 ms to minimize.
[2023-03-14 12:03:09] [INFO ] Deduced a trap composed of 172 places in 126 ms of which 1 ms to minimize.
[2023-03-14 12:03:09] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 0 ms to minimize.
[2023-03-14 12:03:10] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 1 ms to minimize.
[2023-03-14 12:03:10] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 0 ms to minimize.
[2023-03-14 12:03:10] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 0 ms to minimize.
[2023-03-14 12:03:10] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2023-03-14 12:03:10] [INFO ] Deduced a trap composed of 157 places in 133 ms of which 0 ms to minimize.
[2023-03-14 12:03:11] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
[2023-03-14 12:03:11] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 0 ms to minimize.
[2023-03-14 12:03:11] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-14 12:03:11] [INFO ] Deduced a trap composed of 181 places in 204 ms of which 1 ms to minimize.
[2023-03-14 12:03:11] [INFO ] Deduced a trap composed of 177 places in 159 ms of which 0 ms to minimize.
[2023-03-14 12:03:12] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 0 ms to minimize.
[2023-03-14 12:03:12] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
[2023-03-14 12:03:12] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 1 ms to minimize.
[2023-03-14 12:03:12] [INFO ] Deduced a trap composed of 181 places in 211 ms of which 0 ms to minimize.
[2023-03-14 12:03:13] [INFO ] Deduced a trap composed of 182 places in 183 ms of which 1 ms to minimize.
[2023-03-14 12:03:13] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-14 12:03:13] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 0 ms to minimize.
[2023-03-14 12:03:13] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 1 ms to minimize.
[2023-03-14 12:03:13] [INFO ] Deduced a trap composed of 171 places in 142 ms of which 0 ms to minimize.
[2023-03-14 12:03:14] [INFO ] Deduced a trap composed of 172 places in 186 ms of which 1 ms to minimize.
[2023-03-14 12:03:14] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 1 ms to minimize.
[2023-03-14 12:03:14] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 0 ms to minimize.
[2023-03-14 12:03:14] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 0 ms to minimize.
[2023-03-14 12:03:14] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 0 ms to minimize.
[2023-03-14 12:03:15] [INFO ] Deduced a trap composed of 157 places in 187 ms of which 1 ms to minimize.
[2023-03-14 12:03:15] [INFO ] Deduced a trap composed of 155 places in 139 ms of which 0 ms to minimize.
[2023-03-14 12:03:15] [INFO ] Deduced a trap composed of 160 places in 163 ms of which 1 ms to minimize.
[2023-03-14 12:03:15] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 12:03:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 12:03:15] [INFO ] After 25169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 134 ms.
Support contains 122 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 748 transition count 590
Reduce places removed 79 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 90 rules applied. Total rules applied 170 place count 669 transition count 579
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 181 place count 658 transition count 579
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 181 place count 658 transition count 462
Deduced a syphon composed of 117 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 424 place count 532 transition count 462
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 498 place count 458 transition count 388
Iterating global reduction 3 with 74 rules applied. Total rules applied 572 place count 458 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 572 place count 458 transition count 386
Deduced a syphon composed of 2 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 577 place count 455 transition count 386
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 757 place count 364 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 759 place count 363 transition count 300
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 760 place count 363 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 761 place count 362 transition count 299
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 762 place count 362 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 763 place count 361 transition count 298
Applied a total of 763 rules in 202 ms. Remains 361 /757 variables (removed 396) and now considering 298/670 (removed 372) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 361/757 places, 298/670 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 298 rows 361 cols
[2023-03-14 12:03:16] [INFO ] Computed 105 place invariants in 6 ms
[2023-03-14 12:03:16] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 12:03:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 9 ms returned sat
[2023-03-14 12:03:16] [INFO ] [Nat]Absence check using 70 positive and 35 generalized place invariants in 6 ms returned sat
[2023-03-14 12:03:17] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 12:03:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 12:03:17] [INFO ] After 329ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-14 12:03:17] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 1 ms to minimize.
[2023-03-14 12:03:17] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 0 ms to minimize.
[2023-03-14 12:03:17] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2023-03-14 12:03:17] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 0 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 0 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-14 12:03:18] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1480 ms
[2023-03-14 12:03:19] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2023-03-14 12:03:19] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2023-03-14 12:03:19] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2023-03-14 12:03:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2023-03-14 12:03:19] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-14 12:03:19] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2023-03-14 12:03:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-14 12:03:19] [INFO ] After 2271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-14 12:03:19] [INFO ] After 2985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 68 ms.
Support contains 82 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 298/298 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 361 transition count 295
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 358 transition count 295
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 6 place count 358 transition count 285
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 28 place count 346 transition count 285
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 339 transition count 278
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 339 transition count 278
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 314 transition count 253
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 314 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 313 transition count 251
Applied a total of 94 rules in 80 ms. Remains 313 /361 variables (removed 48) and now considering 251/298 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 313/361 places, 251/298 transitions.
Incomplete random walk after 10000 steps, including 248 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1163822 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 1163822 steps, saw 196938 distinct states, run finished after 3002 ms. (steps per millisecond=387 ) properties seen :5
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 251 rows 313 cols
[2023-03-14 12:03:23] [INFO ] Computed 103 place invariants in 13 ms
[2023-03-14 12:03:23] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:03:23] [INFO ] [Nat]Absence check using 71 positive place invariants in 9 ms returned sat
[2023-03-14 12:03:23] [INFO ] [Nat]Absence check using 71 positive and 32 generalized place invariants in 7 ms returned sat
[2023-03-14 12:03:23] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 12:03:23] [INFO ] After 80ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:23] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-14 12:03:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-14 12:03:23] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-14 12:03:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-14 12:03:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 301 ms
[2023-03-14 12:03:24] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-14 12:03:24] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 45 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 251/251 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 313 transition count 248
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 310 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 309 transition count 247
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 8 place count 309 transition count 232
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 35 rules applied. Total rules applied 43 place count 289 transition count 232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 285 transition count 228
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 285 transition count 228
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 92 place count 264 transition count 208
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 264 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 263 transition count 207
Applied a total of 94 rules in 83 ms. Remains 263 /313 variables (removed 50) and now considering 207/251 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 263/313 places, 207/251 transitions.
Incomplete random walk after 10000 steps, including 329 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1483523 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :{}
Probabilistic random walk after 1483523 steps, saw 252887 distinct states, run finished after 3001 ms. (steps per millisecond=494 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 263 cols
[2023-03-14 12:03:27] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-14 12:03:27] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:03:27] [INFO ] [Nat]Absence check using 71 positive place invariants in 12 ms returned sat
[2023-03-14 12:03:27] [INFO ] [Nat]Absence check using 71 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-14 12:03:27] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 12:03:27] [INFO ] After 99ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:27] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2023-03-14 12:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-14 12:03:27] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-14 12:03:28] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 18 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 263/263 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 15 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-14 12:03:28] [INFO ] Invariant cache hit.
[2023-03-14 12:03:28] [INFO ] Implicit Places using invariants in 152 ms returned [14, 23, 24, 84, 203, 207, 217]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 154 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/263 places, 207/207 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 178 ms. Remains : 256/263 places, 207/207 transitions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1431074 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :{}
Probabilistic random walk after 1431074 steps, saw 250225 distinct states, run finished after 3002 ms. (steps per millisecond=476 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 256 cols
[2023-03-14 12:03:31] [INFO ] Computed 90 place invariants in 15 ms
[2023-03-14 12:03:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:03:31] [INFO ] [Nat]Absence check using 69 positive place invariants in 9 ms returned sat
[2023-03-14 12:03:31] [INFO ] [Nat]Absence check using 69 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-14 12:03:31] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 12:03:31] [INFO ] After 125ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:31] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-14 12:03:31] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2023-03-14 12:03:31] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-14 12:03:31] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2023-03-14 12:03:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 195 ms
[2023-03-14 12:03:31] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-14 12:03:32] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 45 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 12 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 256/256 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 11 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-14 12:03:32] [INFO ] Invariant cache hit.
[2023-03-14 12:03:32] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-14 12:03:32] [INFO ] Invariant cache hit.
[2023-03-14 12:03:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 12:03:32] [INFO ] Implicit Places using invariants and state equation in 405 ms returned [93, 165, 168, 170, 172, 173, 175, 178, 179, 181, 184]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 573 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/256 places, 207/207 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 203
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 241 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 240 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 240 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 237 transition count 199
Applied a total of 16 rules in 21 ms. Remains 237 /245 variables (removed 8) and now considering 199/207 (removed 8) transitions.
// Phase 1: matrix 199 rows 237 cols
[2023-03-14 12:03:32] [INFO ] Computed 79 place invariants in 3 ms
[2023-03-14 12:03:32] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-14 12:03:32] [INFO ] Invariant cache hit.
[2023-03-14 12:03:32] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-14 12:03:33] [INFO ] Implicit Places using invariants and state equation in 352 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 482 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/256 places, 199/207 transitions.
Applied a total of 0 rules in 10 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1098 ms. Remains : 235/256 places, 199/207 transitions.
Incomplete random walk after 10000 steps, including 355 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1416509 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1416509 steps, saw 247632 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 199 rows 235 cols
[2023-03-14 12:03:36] [INFO ] Computed 77 place invariants in 5 ms
[2023-03-14 12:03:36] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:03:36] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2023-03-14 12:03:36] [INFO ] [Nat]Absence check using 57 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-14 12:03:36] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 12:03:36] [INFO ] After 56ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:36] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-14 12:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-14 12:03:36] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-14 12:03:36] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 45 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 10 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 235/235 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-14 12:03:36] [INFO ] Invariant cache hit.
[2023-03-14 12:03:36] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-14 12:03:36] [INFO ] Invariant cache hit.
[2023-03-14 12:03:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 12:03:37] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-14 12:03:37] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-14 12:03:37] [INFO ] Invariant cache hit.
[2023-03-14 12:03:37] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 235/235 places, 199/199 transitions.
Graph (complete) has 758 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 231 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 231 transition count 198
Applied a total of 3 rules in 7 ms. Remains 231 /235 variables (removed 4) and now considering 198/199 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 231 cols
[2023-03-14 12:03:37] [INFO ] Computed 74 place invariants in 12 ms
[2023-03-14 12:03:37] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:03:37] [INFO ] [Nat]Absence check using 56 positive place invariants in 7 ms returned sat
[2023-03-14 12:03:37] [INFO ] [Nat]Absence check using 56 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 12:03:37] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:37] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-14 12:03:37] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2023-03-14 12:03:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2023-03-14 12:03:37] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-14 12:03:37] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 12:03:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 199 transitions and 937 arcs took 1 ms.
[2023-03-14 12:03:38] [INFO ] Flatten gal took : 65 ms
Total runtime 49671 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 19
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: 235 places, 199 transitions, 937 arcs.
Final Score: 5433.053
Took : 11 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678795430394

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 1380:
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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r043-tajo-167813697100599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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