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-167813697100598.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697100598
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678795356075

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=ReachabilityCardinality
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:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 12:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:02:37] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-14 12:02:37] [INFO ] Transformed 772 places.
[2023-03-14 12:02:37] [INFO ] Transformed 685 transitions.
[2023-03-14 12:02:37] [INFO ] Found NUPN structural information;
[2023-03-14 12:02:37] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 13) seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 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 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 670 rows 757 cols
[2023-03-14 12:02:38] [INFO ] Computed 125 place invariants in 26 ms
[2023-03-14 12:02:39] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-14 12:02:39] [INFO ] [Nat]Absence check using 78 positive place invariants in 24 ms returned sat
[2023-03-14 12:02:39] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2023-03-14 12:02:40] [INFO ] After 770ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-14 12:02:40] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 8 ms to minimize.
[2023-03-14 12:02:41] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2023-03-14 12:02:41] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 2 ms to minimize.
[2023-03-14 12:02:41] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 2 ms to minimize.
[2023-03-14 12:02:41] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 1 ms to minimize.
[2023-03-14 12:02:42] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2023-03-14 12:02:42] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 1 ms to minimize.
[2023-03-14 12:02:42] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 1 ms to minimize.
[2023-03-14 12:02:42] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-14 12:02:43] [INFO ] Deduced a trap composed of 159 places in 193 ms of which 0 ms to minimize.
[2023-03-14 12:02:43] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2023-03-14 12:02:43] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-14 12:02:43] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2023-03-14 12:02:44] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 1 ms to minimize.
[2023-03-14 12:02:44] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-14 12:02:44] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 1 ms to minimize.
[2023-03-14 12:02:44] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 1 ms to minimize.
[2023-03-14 12:02:44] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2023-03-14 12:02:45] [INFO ] Deduced a trap composed of 155 places in 177 ms of which 1 ms to minimize.
[2023-03-14 12:02:45] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 1 ms to minimize.
[2023-03-14 12:02:45] [INFO ] Deduced a trap composed of 161 places in 207 ms of which 1 ms to minimize.
[2023-03-14 12:02:45] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2023-03-14 12:02:46] [INFO ] Deduced a trap composed of 169 places in 180 ms of which 1 ms to minimize.
[2023-03-14 12:02:46] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 0 ms to minimize.
[2023-03-14 12:02:46] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 1 ms to minimize.
[2023-03-14 12:02:46] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2023-03-14 12:02:46] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 1 ms to minimize.
[2023-03-14 12:02:46] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 1 ms to minimize.
[2023-03-14 12:02:47] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 1 ms to minimize.
[2023-03-14 12:02:47] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 1 ms to minimize.
[2023-03-14 12:02:47] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 0 ms to minimize.
[2023-03-14 12:02:47] [INFO ] Deduced a trap composed of 163 places in 152 ms of which 1 ms to minimize.
[2023-03-14 12:02:48] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 1 ms to minimize.
[2023-03-14 12:02:48] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 0 ms to minimize.
[2023-03-14 12:02:48] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 1 ms to minimize.
[2023-03-14 12:02:48] [INFO ] Deduced a trap composed of 159 places in 179 ms of which 1 ms to minimize.
[2023-03-14 12:02:49] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 1 ms to minimize.
[2023-03-14 12:02:49] [INFO ] Deduced a trap composed of 153 places in 200 ms of which 1 ms to minimize.
[2023-03-14 12:02:49] [INFO ] Deduced a trap composed of 155 places in 187 ms of which 1 ms to minimize.
[2023-03-14 12:02:49] [INFO ] Deduced a trap composed of 163 places in 171 ms of which 1 ms to minimize.
[2023-03-14 12:02:50] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 1 ms to minimize.
[2023-03-14 12:02:50] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 0 ms to minimize.
[2023-03-14 12:02:50] [INFO ] Deduced a trap composed of 171 places in 187 ms of which 1 ms to minimize.
[2023-03-14 12:02:50] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-14 12:02:50] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 0 ms to minimize.
[2023-03-14 12:02:51] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 1 ms to minimize.
[2023-03-14 12:02:51] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 1 ms to minimize.
[2023-03-14 12:02:51] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 0 ms to minimize.
[2023-03-14 12:02:51] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2023-03-14 12:02:52] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2023-03-14 12:02:52] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 10 ms to minimize.
[2023-03-14 12:02:52] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2023-03-14 12:02:52] [INFO ] Deduced a trap composed of 150 places in 195 ms of which 1 ms to minimize.
[2023-03-14 12:02:53] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-14 12:02:53] [INFO ] Deduced a trap composed of 187 places in 205 ms of which 0 ms to minimize.
[2023-03-14 12:02:53] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 3 ms to minimize.
[2023-03-14 12:02:54] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 1 ms to minimize.
[2023-03-14 12:02:54] [INFO ] Deduced a trap composed of 157 places in 195 ms of which 1 ms to minimize.
[2023-03-14 12:02:54] [INFO ] Deduced a trap composed of 174 places in 221 ms of which 1 ms to minimize.
[2023-03-14 12:02:54] [INFO ] Deduced a trap composed of 153 places in 203 ms of which 0 ms to minimize.
[2023-03-14 12:02:55] [INFO ] Deduced a trap composed of 159 places in 226 ms of which 1 ms to minimize.
[2023-03-14 12:02:55] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 0 ms to minimize.
[2023-03-14 12:02:55] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2023-03-14 12:02:55] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 1 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 3 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 2 ms to minimize.
[2023-03-14 12:02:56] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 2 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 161 places in 210 ms of which 1 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 157 places in 203 ms of which 1 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 153 places in 205 ms of which 1 ms to minimize.
[2023-03-14 12:02:57] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 1 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 1 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 1 ms to minimize.
[2023-03-14 12:02:58] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 0 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 174 places in 215 ms of which 1 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 1 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 1 ms to minimize.
[2023-03-14 12:02:59] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 157 places in 196 ms of which 0 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 155 places in 208 ms of which 0 ms to minimize.
[2023-03-14 12:03:00] [INFO ] Deduced a trap composed of 157 places in 201 ms of which 1 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 0 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 1 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 157 places in 196 ms of which 1 ms to minimize.
[2023-03-14 12:03:01] [INFO ] Deduced a trap composed of 159 places in 198 ms of which 0 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 152 places in 209 ms of which 1 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2023-03-14 12:03:02] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2023-03-14 12:03:03] [INFO ] Deduced a trap composed of 159 places in 217 ms of which 5 ms to minimize.
[2023-03-14 12:03:03] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 1 ms to minimize.
[2023-03-14 12:03:03] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 1 ms to minimize.
[2023-03-14 12:03:03] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 1 ms to minimize.
[2023-03-14 12:03:04] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 0 ms to minimize.
[2023-03-14 12:03:04] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-14 12:03:04] [INFO ] Deduced a trap composed of 168 places in 219 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:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 12:03:04] [INFO ] After 25180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 251 ms.
Support contains 90 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 345 edges and 757 vertex of which 4 / 757 are part of one of the 1 SCC in 15 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1516 edges and 754 vertex of which 747 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 747 transition count 538
Reduce places removed 127 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 146 rules applied. Total rules applied 275 place count 620 transition count 519
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 294 place count 601 transition count 519
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 294 place count 601 transition count 434
Deduced a syphon composed of 85 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 476 place count 504 transition count 434
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 547 place count 433 transition count 363
Iterating global reduction 3 with 71 rules applied. Total rules applied 618 place count 433 transition count 363
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 618 place count 433 transition count 357
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 631 place count 426 transition count 357
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 835 place count 323 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 837 place count 322 transition count 258
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 839 place count 322 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 841 place count 320 transition count 256
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 845 place count 320 transition count 256
Applied a total of 845 rules in 196 ms. Remains 320 /757 variables (removed 437) and now considering 256/670 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 320/757 places, 256/670 transitions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :4
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 256 rows 320 cols
[2023-03-14 12:03:05] [INFO ] Computed 104 place invariants in 18 ms
[2023-03-14 12:03:05] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:03:06] [INFO ] [Nat]Absence check using 72 positive place invariants in 13 ms returned sat
[2023-03-14 12:03:06] [INFO ] [Nat]Absence check using 72 positive and 32 generalized place invariants in 6 ms returned sat
[2023-03-14 12:03:06] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:03:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:03:06] [INFO ] After 97ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2023-03-14 12:03:06] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1139 ms
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2023-03-14 12:03:07] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 0 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 0 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 0 ms to minimize.
[2023-03-14 12:03:08] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 1 ms to minimize.
[2023-03-14 12:03:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1417 ms
[2023-03-14 12:03:09] [INFO ] After 2904ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-14 12:03:09] [INFO ] After 3278ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 38 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 256/256 transitions.
Graph (complete) has 995 edges and 320 vertex of which 319 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 319 transition count 243
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 306 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 304 transition count 241
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 31 place count 304 transition count 227
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 63 place count 286 transition count 227
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 281 transition count 222
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 281 transition count 222
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 140 place count 247 transition count 189
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 247 transition count 189
Applied a total of 141 rules in 71 ms. Remains 247 /320 variables (removed 73) and now considering 189/256 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 247/320 places, 189/256 transitions.
Incomplete random walk after 10000 steps, including 528 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 615204 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 615204 steps, saw 144625 distinct states, run finished after 3002 ms. (steps per millisecond=204 ) properties seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 189 rows 247 cols
[2023-03-14 12:03:12] [INFO ] Computed 98 place invariants in 8 ms
[2023-03-14 12:03:12] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:03:12] [INFO ] [Nat]Absence check using 71 positive place invariants in 15 ms returned sat
[2023-03-14 12:03:12] [INFO ] [Nat]Absence check using 71 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 12:03:12] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:03:12] [INFO ] After 10ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 12:03:12] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-14 12:03:12] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 189/189 transitions.
Graph (trivial) has 34 edges and 247 vertex of which 2 / 247 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 888 edges and 246 vertex of which 245 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 5 place count 245 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 242 transition count 184
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 8 place count 242 transition count 169
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 47 place count 218 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 215 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 215 transition count 166
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 82 place count 200 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 199 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 199 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 198 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 198 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 197 transition count 150
Applied a total of 88 rules in 47 ms. Remains 197 /247 variables (removed 50) and now considering 150/189 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 197/247 places, 150/189 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11475 steps, run visited all 1 properties in 58 ms. (steps per millisecond=197 )
Probabilistic random walk after 11475 steps, saw 5466 distinct states, run finished after 58 ms. (steps per millisecond=197 ) properties seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 35287 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 19
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 772 places, 685 transitions, 1981 arcs.
Final Score: 51856.66
Took : 22 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-00 (reachable &!potential( ( ( (! ( ( 1 ) <= (tk(P46)) )) | ( ( (! ( ( (tk(P544)) <= (tk(P284)) ) & (! ( ( (tk(P215)) <= ( 0 ) ) & ( (tk(P92)) <= ( 0 ) ) )) )) | ( (! ( ( (tk(P278)) <= (tk(P192)) ) & ( (! ( (tk(P249)) <= (tk(P311)) )) | ( ( ( 1 ) <= (tk(P216)) ) & ( ( 1 ) <= (tk(P124)) ) ) ) )) | ( ( 1 ) <= (tk(P448)) ) ) ) | ( (! ( ( ( ( 1 ) <= (tk(P204)) ) | ( ( ( 1 ) <= (tk(P57)) ) & ( ( (tk(P556)) <= ( 1 ) ) & ( (tk(P533)) <= ( 0 ) ) ) ) ) | ( ( (tk(P48)) <= ( 1 ) ) & (! ( (tk(P619)) <= (tk(P689)) )) ) )) | ( ( 1 ) <= (tk(P638)) ) ) ) ) | ( (tk(P168)) <= (tk(P411)) ) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-01 (reachable &!potential( ( ( ( (tk(P410)) <= (tk(P518)) ) & ( ( (tk(P547)) <= (tk(P60)) ) & ( (! ( (! ( (! ( (tk(P476)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P445)) ) & ( (tk(P250)) <= ( 1 ) ) ) )) & ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P53)) ) ) )) & (! ( (! ( (tk(P498)) <= (tk(P482)) )) & ( ( (! ( (tk(P314)) <= ( 1 ) )) & ( ( (tk(P434)) <= (tk(P44)) ) | ( ( 1 ) <= (tk(P749)) ) ) ) & ( (! ( ( 1 ) <= (tk(P161)) )) | ( ( (tk(P668)) <= (tk(P163)) ) | ( (tk(P275)) <= ( 1 ) ) ) ) ) )) ) ) ) | ( ( ( ( 1 ) <= (tk(P295)) ) & ( (tk(P748)) <= ( 1 ) ) ) & (! ( ( ( (tk(P231)) <= (tk(P626)) ) & ( (! ( (tk(P53)) <= ( 1 ) )) | ( (! ( ( (tk(P525)) <= (tk(P339)) ) | ( ( 1 ) <= (tk(P87)) ) )) & (! ( ( ( 1 ) <= (tk(P739)) ) & ( (tk(P355)) <= ( 0 ) ) )) ) ) ) | ( ( ( 1 ) <= (tk(P546)) ) & ( ( (tk(P613)) <= ( 0 ) ) | (! ( ( ( 1 ) <= (tk(P211)) ) & ( (tk(P683)) <= ( 1 ) ) )) ) ) )) ) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-02 (reachable & potential(( ( ( (tk(P649)) <= ( 0 ) ) & ( (! ( (! ( (tk(P770)) <= ( 0 ) )) & (! ( (tk(P179)) <= (tk(P366)) )) )) | ( ( (! ( (! ( ( 1 ) <= (tk(P49)) )) | ( ( ( ( 1 ) <= (tk(P744)) ) | ( (tk(P505)) <= (tk(P581)) ) ) & (! ( ( 1 ) <= (tk(P380)) )) ) )) | ( ( 1 ) <= (tk(P444)) ) ) & ( ( ( (tk(P98)) <= ( 0 ) ) & ( (! ( ( (tk(P216)) <= (tk(P208)) ) & ( (tk(P392)) <= (tk(P359)) ) )) & ( ( 1 ) <= (tk(P593)) ) ) ) | (! ( (! ( (tk(P364)) <= (tk(P656)) )) & ( ( ( (tk(P122)) <= (tk(P593)) ) & ( (tk(P655)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P516)) ) | ( (tk(P329)) <= (tk(P656)) ) ) ) )) ) ) ) ) & ( ( (tk(P478)) <= (tk(P248)) ) & ( (! ( (tk(P709)) <= (tk(P299)) )) & (! ( (tk(P322)) <= ( 1 ) )) ) ) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-03 (reachable & potential((! ( (tk(P690)) <= ( 1 ) ))))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-04 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P740)) ) | ( ( (! ( (! ( (! ( ( 1 ) <= (tk(P614)) )) & ( ( 1 ) <= (tk(P259)) ) )) | ( ( ( ( (tk(P493)) <= (tk(P387)) ) & ( (tk(P490)) <= ( 0 ) ) ) | (! ( ( 1 ) <= (tk(P52)) )) ) & ( ( ( (tk(P99)) <= ( 1 ) ) | ( (tk(P362)) <= (tk(P184)) ) ) | (! ( ( 1 ) <= (tk(P120)) )) ) ) )) | ( ( (! ( ( ( ( 1 ) <= (tk(P436)) ) | ( (tk(P302)) <= ( 1 ) ) ) & ( ( (tk(P13)) <= ( 0 ) ) & ( (tk(P191)) <= ( 0 ) ) ) )) | ( (! ( (tk(P432)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P286)) ) | (! ( ( 1 ) <= (tk(P94)) )) ) ) ) & (! ( (tk(P51)) <= ( 1 ) )) ) ) | ( ( ( ( ( 1 ) <= (tk(P317)) ) & (! ( ( (tk(P35)) <= ( 0 ) ) & ( ( (tk(P707)) <= ( 1 ) ) & ( (tk(P653)) <= ( 0 ) ) ) )) ) | (! ( ( (tk(P361)) <= (tk(P501)) ) & ( (tk(P189)) <= ( 1 ) ) )) ) & ( ( 1 ) <= (tk(P734)) ) ) ) ))))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-05 (reachable & potential(( (! ( (tk(P730)) <= ( 0 ) )) & ( (! ( ( ( ( (! ( ( (tk(P646)) <= ( 1 ) ) | ( (tk(P391)) <= ( 0 ) ) )) | ( (tk(P428)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P618)) ) ) & ( ( ( 1 ) <= (tk(P702)) ) & ( (! ( (tk(P713)) <= ( 0 ) )) | ( (! ( (tk(P719)) <= ( 0 ) )) | ( ( (tk(P365)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P29)) ) ) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P60)) ) | (! ( ( (tk(P656)) <= (tk(P106)) ) | ( (tk(P345)) <= ( 1 ) ) )) ) & (! ( ( ( ( 1 ) <= (tk(P217)) ) | ( (tk(P440)) <= (tk(P578)) ) ) & (! ( ( (tk(P20)) <= ( 1 ) ) & ( (tk(P283)) <= (tk(P41)) ) )) )) ) )) | ( (tk(P260)) <= (tk(P552)) ) ) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-06 (reachable & potential((! ( (tk(P408)) <= (tk(P732)) ))))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P140)) <= (tk(P651)) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-08 (reachable &!potential( (! ( ( (! ( ( (! ( ( ( (tk(P131)) <= ( 0 ) ) & ( (tk(P535)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P70)) ) )) | ( ( 1 ) <= (tk(P49)) ) ) & (! ( (! ( (tk(P753)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P695)) ) )) )) & (! ( ( ( ( ( (tk(P338)) <= (tk(P305)) ) & ( ( 1 ) <= (tk(P7)) ) ) & ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P392)) ) ) ) | (! ( ( (tk(P209)) <= ( 1 ) ) | ( (tk(P207)) <= (tk(P619)) ) )) ) | ( ( (! ( (tk(P99)) <= (tk(P687)) )) & ( ( ( 1 ) <= (tk(P10)) ) & ( ( 1 ) <= (tk(P328)) ) ) ) | ( ( 1 ) <= (tk(P743)) ) ) )) ) & (! ( ( (tk(P14)) <= ( 1 ) ) | ( (tk(P417)) <= (tk(P602)) ) )) ))))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-09 (reachable & potential(( ( 1 ) <= (tk(P689)) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( (! ( ( ( ( ( ( 1 ) <= (tk(P34)) ) & ( (tk(P657)) <= (tk(P200)) ) ) & ( ( (tk(P767)) <= (tk(P125)) ) & ( (tk(P38)) <= ( 0 ) ) ) ) | (! ( ( 1 ) <= (tk(P359)) )) ) & ( ( ( 1 ) <= (tk(P146)) ) & ( ( ( (tk(P129)) <= (tk(P691)) ) & ( ( 1 ) <= (tk(P234)) ) ) | ( ( 1 ) <= (tk(P75)) ) ) ) )) & ( ( 1 ) <= (tk(P701)) ) ) | ( (tk(P190)) <= ( 1 ) ) ) & ( ( ( ( (tk(P596)) <= ( 0 ) ) & ( ( ( ( ( (tk(P409)) <= ( 1 ) ) & ( (tk(P575)) <= (tk(P764)) ) ) | ( ( 1 ) <= (tk(P257)) ) ) | (! ( ( (tk(P772)) <= (tk(P439)) ) | ( (tk(P500)) <= ( 0 ) ) )) ) & ( ( 1 ) <= (tk(P199)) ) ) ) | (! ( ( ( (tk(P703)) <= ( 1 ) ) | ( (tk(P664)) <= ( 0 ) ) ) & (! ( (tk(P577)) <= ( 1 ) )) )) ) & ( (! ( ( (! ( ( (tk(P597)) <= (tk(P628)) ) & ( ( 1 ) <= (tk(P61)) ) )) & (! ( ( 1 ) <= (tk(P294)) )) ) & ( ( (! ( ( 1 ) <= (tk(P335)) )) | ( (tk(P308)) <= ( 1 ) ) ) | ( (tk(P660)) <= ( 0 ) ) ) )) | ( ( ( (tk(P637)) <= (tk(P257)) ) | (! ( ( ( (tk(P744)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P433)) ) ) | ( ( ( 1 ) <= (tk(P560)) ) & ( (tk(P478)) <= (tk(P258)) ) ) )) ) | ( ( 1 ) <= (tk(P1)) ) ) ) ) ) | (! ( ( ( ( ( ( 1 ) <= (tk(P79)) ) & ( ( (! ( (tk(P90)) <= ( 1 ) )) & ( ( (tk(P613)) <= ( 1 ) ) | ( (tk(P444)) <= (tk(P573)) ) ) ) & ( (tk(P137)) <= (tk(P613)) ) ) ) | ( (tk(P566)) <= (tk(P63)) ) ) & ( (tk(P170)) <= (tk(P204)) ) ) & ( (tk(P439)) <= (tk(P190)) ) )) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-11 (reachable &!potential( (! ( ( ( ( ( 1 ) <= (tk(P253)) ) | ( (! ( (tk(P719)) <= (tk(P229)) )) | ( ( 1 ) <= (tk(P643)) ) ) ) & ( ( ( 1 ) <= (tk(P406)) ) | (! ( ( (tk(P423)) <= (tk(P504)) ) | ( ( 1 ) <= (tk(P290)) ) )) ) ) | ( ( 1 ) <= (tk(P209)) ) ))))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-12 (reachable &!potential( (! ( ( 1 ) <= (tk(P655)) ))))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-13 (reachable & potential(( (! ( ( ( ( (tk(P754)) <= (tk(P105)) ) | ( ( ( (! ( (tk(P335)) <= (tk(P614)) )) & ( (tk(P182)) <= ( 0 ) ) ) | (! ( (tk(P230)) <= ( 0 ) )) ) & (! ( (tk(P714)) <= (tk(P580)) )) ) ) | ( ( ( (tk(P531)) <= ( 0 ) ) | ( ( (! ( (tk(P108)) <= ( 1 ) )) & ( ( (tk(P670)) <= ( 0 ) ) | ( (tk(P309)) <= (tk(P30)) ) ) ) & ( (tk(P586)) <= ( 0 ) ) ) ) | ( (! ( (! ( ( 1 ) <= (tk(P144)) )) | ( ( (tk(P458)) <= (tk(P201)) ) & ( (tk(P737)) <= ( 0 ) ) ) )) | ( (tk(P544)) <= (tk(P236)) ) ) ) ) | ( ( 1 ) <= (tk(P191)) ) )) & ( (tk(P619)) <= (tk(P399)) ) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-14 (reachable & potential(( ( ( ( 1 ) <= (tk(P348)) ) | ( ( 1 ) <= (tk(P291)) ) ) & ( ( 1 ) <= (tk(P424)) ) )))
PROPERTY: BusinessProcesses-PT-19-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( ( (tk(P58)) <= (tk(P356)) ) | (! ( ( ( (tk(P436)) <= ( 1 ) ) & (! ( ( 1 ) <= (tk(P40)) )) ) | (! ( ( (tk(P451)) <= (tk(P520)) ) | ( ( (tk(P419)) <= ( 0 ) ) | ( (tk(P770)) <= ( 1 ) ) ) )) )) ) & ( ( ( 1 ) <= (tk(P77)) ) | (! ( (tk(P292)) <= ( 0 ) )) ) ) | ( (! ( ( (tk(P234)) <= ( 1 ) ) | ( ( ( (tk(P384)) <= (tk(P294)) ) & ( ( ( ( 1 ) <= (tk(P311)) ) & ( (tk(P166)) <= (tk(P347)) ) ) & ( ( ( 1 ) <= (tk(P169)) ) & ( (tk(P766)) <= ( 0 ) ) ) ) ) & ( ( ( ( (tk(P318)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P108)) ) ) & ( ( (tk(P651)) <= (tk(P453)) ) | ( ( 1 ) <= (tk(P337)) ) ) ) & (! ( ( ( 1 ) <= (tk(P744)) ) & ( (tk(P383)) <= ( 0 ) ) )) ) ) )) | ( ( ( (tk(P316)) <= (tk(P519)) ) | ( ( (! ( (tk(P504)) <= (tk(P319)) )) & ( ( ( ( 1 ) <= (tk(P59)) ) & ( ( 1 ) <= (tk(P767)) ) ) | ( (tk(P124)) <= ( 1 ) ) ) ) | ( (! ( ( ( 1 ) <= (tk(P669)) ) | ( ( 1 ) <= (tk(P309)) ) )) & ( (tk(P420)) <= (tk(P591)) ) ) ) ) & ( (tk(P339)) <= ( 1 ) ) ) ) ) | (! ( (! ( ( ( 1 ) <= (tk(P41)) ) & (! ( ( ( (tk(P305)) <= ( 0 ) ) | ( (tk(P151)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P372)) )) )) )) | ( ( 1 ) <= (tk(P322)) ) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 9029940 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16108448 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167813697100598"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;