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.r041-tajo-167813694900567.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 ltsminxred
Input is BusinessProcesses-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 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 157K 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-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678646296359

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:38:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:38:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:38:18] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-12 18:38:18] [INFO ] Transformed 630 places.
[2023-03-12 18:38:18] [INFO ] Transformed 566 transitions.
[2023-03-12 18:38:18] [INFO ] Found NUPN structural information;
[2023-03-12 18:38:18] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 562 rows 626 cols
[2023-03-12 18:38:19] [INFO ] Computed 102 place invariants in 32 ms
[2023-03-12 18:38:20] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 18:38:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 34 ms returned sat
[2023-03-12 18:38:20] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-12 18:38:22] [INFO ] After 1512ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 18:38:22] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 7 ms to minimize.
[2023-03-12 18:38:22] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2023-03-12 18:38:23] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 1 ms to minimize.
[2023-03-12 18:38:23] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 1 ms to minimize.
[2023-03-12 18:38:23] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 1 ms to minimize.
[2023-03-12 18:38:23] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 1 ms to minimize.
[2023-03-12 18:38:24] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 1 ms to minimize.
[2023-03-12 18:38:24] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 1 ms to minimize.
[2023-03-12 18:38:24] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 0 ms to minimize.
[2023-03-12 18:38:24] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 0 ms to minimize.
[2023-03-12 18:38:24] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 0 ms to minimize.
[2023-03-12 18:38:25] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 1 ms to minimize.
[2023-03-12 18:38:25] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 1 ms to minimize.
[2023-03-12 18:38:25] [INFO ] Deduced a trap composed of 142 places in 218 ms of which 1 ms to minimize.
[2023-03-12 18:38:25] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 1 ms to minimize.
[2023-03-12 18:38:26] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 0 ms to minimize.
[2023-03-12 18:38:26] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 1 ms to minimize.
[2023-03-12 18:38:26] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 1 ms to minimize.
[2023-03-12 18:38:26] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 1 ms to minimize.
[2023-03-12 18:38:26] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 1 ms to minimize.
[2023-03-12 18:38:27] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 0 ms to minimize.
[2023-03-12 18:38:27] [INFO ] Deduced a trap composed of 142 places in 195 ms of which 2 ms to minimize.
[2023-03-12 18:38:27] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 1 ms to minimize.
[2023-03-12 18:38:27] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 0 ms to minimize.
[2023-03-12 18:38:28] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 1 ms to minimize.
[2023-03-12 18:38:28] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 1 ms to minimize.
[2023-03-12 18:38:28] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 1 ms to minimize.
[2023-03-12 18:38:28] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 0 ms to minimize.
[2023-03-12 18:38:28] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 1 ms to minimize.
[2023-03-12 18:38:28] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6629 ms
[2023-03-12 18:38:29] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-12 18:38:29] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 0 ms to minimize.
[2023-03-12 18:38:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-03-12 18:38:29] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:38:29] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2023-03-12 18:38:29] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2023-03-12 18:38:31] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2023-03-12 18:38:31] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 0 ms to minimize.
[2023-03-12 18:38:31] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 0 ms to minimize.
[2023-03-12 18:38:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1972 ms
[2023-03-12 18:38:31] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:38:31] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 0 ms to minimize.
[2023-03-12 18:38:31] [INFO ] Deduced a trap composed of 142 places in 139 ms of which 0 ms to minimize.
[2023-03-12 18:38:32] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 0 ms to minimize.
[2023-03-12 18:38:32] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 0 ms to minimize.
[2023-03-12 18:38:32] [INFO ] Deduced a trap composed of 145 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:38:32] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 1 ms to minimize.
[2023-03-12 18:38:32] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 0 ms to minimize.
[2023-03-12 18:38:32] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:38:33] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 1 ms to minimize.
[2023-03-12 18:38:33] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:38:33] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 3 ms to minimize.
[2023-03-12 18:38:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2022 ms
[2023-03-12 18:38:33] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-12 18:38:33] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2023-03-12 18:38:34] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2023-03-12 18:38:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 487 ms
[2023-03-12 18:38:34] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:38:34] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-12 18:38:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 369 ms
[2023-03-12 18:38:35] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2023-03-12 18:38:35] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 1 ms to minimize.
[2023-03-12 18:38:35] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 1 ms to minimize.
[2023-03-12 18:38:36] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 0 ms to minimize.
[2023-03-12 18:38:36] [INFO ] Deduced a trap composed of 118 places in 192 ms of which 4 ms to minimize.
[2023-03-12 18:38:36] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 0 ms to minimize.
[2023-03-12 18:38:36] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 0 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 1 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 2 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 1 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 1 ms to minimize.
[2023-03-12 18:38:38] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 0 ms to minimize.
[2023-03-12 18:38:38] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 0 ms to minimize.
[2023-03-12 18:38:38] [INFO ] Deduced a trap composed of 115 places in 174 ms of which 1 ms to minimize.
[2023-03-12 18:38:38] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 0 ms to minimize.
[2023-03-12 18:38:39] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 1 ms to minimize.
[2023-03-12 18:38:39] [INFO ] Deduced a trap composed of 133 places in 165 ms of which 1 ms to minimize.
[2023-03-12 18:38:39] [INFO ] Deduced a trap composed of 129 places in 187 ms of which 1 ms to minimize.
[2023-03-12 18:38:39] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 1 ms to minimize.
[2023-03-12 18:38:39] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 0 ms to minimize.
[2023-03-12 18:38:40] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:38:40] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2023-03-12 18:38:40] [INFO ] Deduced a trap composed of 135 places in 189 ms of which 0 ms to minimize.
[2023-03-12 18:38:40] [INFO ] Deduced a trap composed of 120 places in 173 ms of which 1 ms to minimize.
[2023-03-12 18:38:41] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 1 ms to minimize.
[2023-03-12 18:38:41] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:38:41] [INFO ] Deduced a trap composed of 120 places in 163 ms of which 0 ms to minimize.
[2023-03-12 18:38:41] [INFO ] Deduced a trap composed of 135 places in 172 ms of which 0 ms to minimize.
[2023-03-12 18:38:42] [INFO ] Deduced a trap composed of 143 places in 188 ms of which 0 ms to minimize.
[2023-03-12 18:38:42] [INFO ] Deduced a trap composed of 141 places in 179 ms of which 1 ms to minimize.
[2023-03-12 18:38:42] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 1 ms to minimize.
[2023-03-12 18:38:42] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:38:42] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:38:43] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:38:43] [INFO ] Deduced a trap composed of 150 places in 158 ms of which 1 ms to minimize.
[2023-03-12 18:38:43] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 0 ms to minimize.
[2023-03-12 18:38:43] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 0 ms to minimize.
[2023-03-12 18:38:44] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 1 ms to minimize.
[2023-03-12 18:38:44] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 1 ms to minimize.
[2023-03-12 18:38:44] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:38:44] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 0 ms to minimize.
[2023-03-12 18:38:44] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:38:45] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 1 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-12 18:38:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 18:38:45] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 122 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 623 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 623 transition count 508
Reduce places removed 54 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 72 rules applied. Total rules applied 127 place count 569 transition count 490
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 145 place count 551 transition count 490
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 145 place count 551 transition count 389
Deduced a syphon composed of 101 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 359 place count 438 transition count 389
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 421 place count 376 transition count 327
Iterating global reduction 3 with 62 rules applied. Total rules applied 483 place count 376 transition count 327
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 483 place count 376 transition count 324
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 490 place count 372 transition count 324
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 604 place count 315 transition count 267
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 605 place count 315 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 606 place count 314 transition count 266
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 610 place count 314 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 611 place count 313 transition count 265
Applied a total of 611 rules in 233 ms. Remains 313 /626 variables (removed 313) and now considering 265/562 (removed 297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 313/626 places, 265/562 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 265 rows 313 cols
[2023-03-12 18:38:46] [INFO ] Computed 86 place invariants in 5 ms
[2023-03-12 18:38:46] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 18:38:46] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-12 18:38:46] [INFO ] [Nat]Absence check using 58 positive and 28 generalized place invariants in 5 ms returned sat
[2023-03-12 18:38:46] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 18:38:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 18:38:46] [INFO ] After 213ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 9 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 671 ms
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2023-03-12 18:38:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2023-03-12 18:38:48] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 0 ms to minimize.
[2023-03-12 18:38:48] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:38:48] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2023-03-12 18:38:48] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 0 ms to minimize.
[2023-03-12 18:38:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 390 ms
[2023-03-12 18:38:48] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2023-03-12 18:38:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-12 18:38:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-12 18:38:48] [INFO ] After 1857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-03-12 18:38:48] [INFO ] After 2624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 54 ms.
Support contains 28 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 265/265 transitions.
Graph (trivial) has 79 edges and 313 vertex of which 5 / 313 are part of one of the 1 SCC in 7 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 864 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 308 transition count 239
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 289 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 287 transition count 237
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 44 place count 287 transition count 216
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 91 place count 261 transition count 216
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 98 place count 254 transition count 209
Iterating global reduction 3 with 7 rules applied. Total rules applied 105 place count 254 transition count 209
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 200 place count 205 transition count 163
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 205 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 204 place count 203 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 203 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 201 transition count 159
Applied a total of 207 rules in 94 ms. Remains 201 /313 variables (removed 112) and now considering 159/265 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 201/313 places, 159/265 transitions.
Finished random walk after 682 steps, including 8 resets, run visited all 2 properties in 7 ms. (steps per millisecond=97 )
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30890 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/849/inv_0_ --invariant=/tmp/849/inv_1_ --invariant=/tmp/849/inv_2_ --invariant=/tmp/849/inv_3_ --invariant=/tmp/849/inv_4_ --invariant=/tmp/849/inv_5_ --invariant=/tmp/849/inv_6_ --invariant=/tmp/849/inv_7_ --invariant=/tmp/849/inv_8_ --invariant=/tmp/849/inv_9_ --invariant=/tmp/849/inv_10_ --invariant=/tmp/849/inv_11_ --invariant=/tmp/849/inv_12_ --invariant=/tmp/849/inv_13_ --invariant=/tmp/849/inv_14_ --invariant=/tmp/849/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 1358420 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16244496 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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-15"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-15, 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 r041-tajo-167813694900567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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