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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 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 29K 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 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 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 161K 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-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678794559650

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-17
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:49:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 11:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:49:21] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-14 11:49:21] [INFO ] Transformed 650 places.
[2023-03-14 11:49:21] [INFO ] Transformed 580 transitions.
[2023-03-14 11:49:21] [INFO ] Found NUPN structural information;
[2023-03-14 11:49:21] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 65 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 14) seen :4
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 576 rows 646 cols
[2023-03-14 11:49:22] [INFO ] Computed 108 place invariants in 23 ms
[2023-03-14 11:49:22] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 11:49:23] [INFO ] [Nat]Absence check using 62 positive place invariants in 18 ms returned sat
[2023-03-14 11:49:23] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2023-03-14 11:49:23] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 138 places in 256 ms of which 8 ms to minimize.
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 2 ms to minimize.
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-14 11:49:25] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:49:25] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 0 ms to minimize.
[2023-03-14 11:49:25] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:49:25] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 1 ms to minimize.
[2023-03-14 11:49:25] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:49:26] [INFO ] Deduced a trap composed of 139 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:49:26] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 1 ms to minimize.
[2023-03-14 11:49:26] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:49:26] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:49:26] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:49:27] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 1 ms to minimize.
[2023-03-14 11:49:27] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 0 ms to minimize.
[2023-03-14 11:49:27] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 0 ms to minimize.
[2023-03-14 11:49:27] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-14 11:49:28] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 0 ms to minimize.
[2023-03-14 11:49:28] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 1 ms to minimize.
[2023-03-14 11:49:28] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 0 ms to minimize.
[2023-03-14 11:49:28] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:49:29] [INFO ] Deduced a trap composed of 134 places in 185 ms of which 1 ms to minimize.
[2023-03-14 11:49:29] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:49:29] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 0 ms to minimize.
[2023-03-14 11:49:29] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:49:29] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 0 ms to minimize.
[2023-03-14 11:49:30] [INFO ] Deduced a trap composed of 134 places in 173 ms of which 1 ms to minimize.
[2023-03-14 11:49:30] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 0 ms to minimize.
[2023-03-14 11:49:30] [INFO ] Deduced a trap composed of 139 places in 127 ms of which 1 ms to minimize.
[2023-03-14 11:49:30] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 0 ms to minimize.
[2023-03-14 11:49:30] [INFO ] Deduced a trap composed of 147 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:49:31] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 1 ms to minimize.
[2023-03-14 11:49:31] [INFO ] Deduced a trap composed of 148 places in 175 ms of which 0 ms to minimize.
[2023-03-14 11:49:31] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:49:31] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 1 ms to minimize.
[2023-03-14 11:49:31] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:49:32] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:49:32] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 2 ms to minimize.
[2023-03-14 11:49:32] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:49:32] [INFO ] Deduced a trap composed of 134 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:49:33] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:49:33] [INFO ] Deduced a trap composed of 130 places in 156 ms of which 1 ms to minimize.
[2023-03-14 11:49:33] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 1 ms to minimize.
[2023-03-14 11:49:33] [INFO ] Deduced a trap composed of 132 places in 169 ms of which 0 ms to minimize.
[2023-03-14 11:49:33] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 0 ms to minimize.
[2023-03-14 11:49:34] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:49:34] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:49:34] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:49:34] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 1 ms to minimize.
[2023-03-14 11:49:34] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 1 ms to minimize.
[2023-03-14 11:49:35] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 0 ms to minimize.
[2023-03-14 11:49:35] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 1 ms to minimize.
[2023-03-14 11:49:35] [INFO ] Deduced a trap composed of 145 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:49:36] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 0 ms to minimize.
[2023-03-14 11:49:36] [INFO ] Deduced a trap composed of 135 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:49:36] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:49:36] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 0 ms to minimize.
[2023-03-14 11:49:37] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2023-03-14 11:49:37] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 0 ms to minimize.
[2023-03-14 11:49:37] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:49:37] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:49:37] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 2 ms to minimize.
[2023-03-14 11:49:38] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2023-03-14 11:49:38] [INFO ] Deduced a trap composed of 151 places in 148 ms of which 1 ms to minimize.
[2023-03-14 11:49:38] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 0 ms to minimize.
[2023-03-14 11:49:38] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 4 ms to minimize.
[2023-03-14 11:49:39] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:49:39] [INFO ] Deduced a trap composed of 150 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:49:39] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 1 ms to minimize.
[2023-03-14 11:49:39] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 1 ms to minimize.
[2023-03-14 11:49:39] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 1 ms to minimize.
[2023-03-14 11:49:40] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 1 ms to minimize.
[2023-03-14 11:49:40] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2023-03-14 11:49:40] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 1 ms to minimize.
[2023-03-14 11:49:40] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 0 ms to minimize.
[2023-03-14 11:49:41] [INFO ] Deduced a trap composed of 150 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:49:41] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 0 ms to minimize.
[2023-03-14 11:49:41] [INFO ] Deduced a trap composed of 152 places in 180 ms of which 2 ms to minimize.
[2023-03-14 11:49:41] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:49:41] [INFO ] Deduced a trap composed of 144 places in 188 ms of which 1 ms to minimize.
[2023-03-14 11:49:42] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 0 ms to minimize.
[2023-03-14 11:49:42] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:49:42] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 0 ms to minimize.
[2023-03-14 11:49:42] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:49:42] [INFO ] Deduced a trap composed of 154 places in 158 ms of which 0 ms to minimize.
[2023-03-14 11:49:43] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 0 ms to minimize.
[2023-03-14 11:49:43] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:49:43] [INFO ] Deduced a trap composed of 157 places in 205 ms of which 1 ms to minimize.
[2023-03-14 11:49:43] [INFO ] Deduced a trap composed of 157 places in 177 ms of which 0 ms to minimize.
[2023-03-14 11:49:44] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2023-03-14 11:49:44] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 1 ms to minimize.
[2023-03-14 11:49:44] [INFO ] Deduced a trap composed of 153 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:49:44] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:49:45] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:49:45] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 0 ms to minimize.
[2023-03-14 11:49:45] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:49:45] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 0 ms to minimize.
[2023-03-14 11:49:45] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 0 ms to minimize.
[2023-03-14 11:49:46] [INFO ] Deduced a trap composed of 142 places in 177 ms of which 0 ms to minimize.
[2023-03-14 11:49:46] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 1 ms to minimize.
[2023-03-14 11:49:46] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:49:46] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 0 ms to minimize.
[2023-03-14 11:49:47] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:49:47] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2023-03-14 11:49:47] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 0 ms to minimize.
[2023-03-14 11:49:48] [INFO ] Deduced a trap composed of 40 places in 181 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 11:49:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 11:49:48] [INFO ] After 25193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 55 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 313 edges and 646 vertex of which 4 / 646 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1308 edges and 643 vertex of which 639 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 639 transition count 459
Reduce places removed 112 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 125 rules applied. Total rules applied 239 place count 527 transition count 446
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 252 place count 514 transition count 446
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 252 place count 514 transition count 357
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 443 place count 412 transition count 357
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 511 place count 344 transition count 289
Iterating global reduction 3 with 68 rules applied. Total rules applied 579 place count 344 transition count 289
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 579 place count 344 transition count 285
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 588 place count 339 transition count 285
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 779 place count 242 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 781 place count 241 transition count 195
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 783 place count 241 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 785 place count 239 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 786 place count 238 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 787 place count 237 transition count 192
Applied a total of 787 rules in 160 ms. Remains 237 /646 variables (removed 409) and now considering 192/576 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 237/646 places, 192/576 transitions.
Incomplete random walk after 10000 steps, including 489 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 192 rows 237 cols
[2023-03-14 11:49:48] [INFO ] Computed 87 place invariants in 8 ms
[2023-03-14 11:49:48] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 11:49:49] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-14 11:49:49] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-14 11:49:49] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 11:49:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:49:49] [INFO ] After 73ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 11:49:49] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 4 ms to minimize.
[2023-03-14 11:49:49] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2023-03-14 11:49:49] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 1 ms to minimize.
[2023-03-14 11:49:49] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 0 ms to minimize.
[2023-03-14 11:49:49] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 0 ms to minimize.
[2023-03-14 11:49:49] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 0 ms to minimize.
[2023-03-14 11:49:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 691 ms
[2023-03-14 11:49:50] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-14 11:49:50] [INFO ] After 1311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 45 ms.
Support contains 50 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 192/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 191
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 236 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 235 transition count 190
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 232 transition count 187
Applied a total of 10 rules in 30 ms. Remains 232 /237 variables (removed 5) and now considering 187/192 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 232/237 places, 187/192 transitions.
Incomplete random walk after 10000 steps, including 501 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 187 rows 232 cols
[2023-03-14 11:49:50] [INFO ] Computed 87 place invariants in 10 ms
[2023-03-14 11:49:50] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 11:49:50] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-14 11:49:50] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-14 11:49:51] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 11:49:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:49:51] [INFO ] After 186ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 11:49:51] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2023-03-14 11:49:51] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:49:51] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2023-03-14 11:49:51] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 0 ms to minimize.
[2023-03-14 11:49:51] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-14 11:49:51] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 0 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 0 ms to minimize.
[2023-03-14 11:49:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1666 ms
[2023-03-14 11:49:53] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 1 ms to minimize.
[2023-03-14 11:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-14 11:49:53] [INFO ] After 2128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-14 11:49:53] [INFO ] After 2593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 30 ms.
Support contains 49 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 187/187 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 186
Applied a total of 2 rules in 21 ms. Remains 231 /232 variables (removed 1) and now considering 186/187 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 231/232 places, 186/187 transitions.
Incomplete random walk after 10000 steps, including 504 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1240784 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1240784 steps, saw 200563 distinct states, run finished after 3002 ms. (steps per millisecond=413 ) properties seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 231 cols
[2023-03-14 11:49:56] [INFO ] Computed 87 place invariants in 9 ms
[2023-03-14 11:49:56] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:49:57] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-14 11:49:57] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-14 11:49:57] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:49:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:49:57] [INFO ] After 63ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 11:49:57] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2023-03-14 11:49:57] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2023-03-14 11:49:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-03-14 11:49:57] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-14 11:49:57] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 186/186 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 185
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 230 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 229 transition count 184
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4 place count 229 transition count 176
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 22 place count 219 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 216 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 216 transition count 173
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 209 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 207 transition count 164
Applied a total of 44 rules in 53 ms. Remains 207 /231 variables (removed 24) and now considering 164/186 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 207/231 places, 164/186 transitions.
Incomplete random walk after 10000 steps, including 717 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 164 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 452026 steps, run visited all 1 properties in 1157 ms. (steps per millisecond=390 )
Probabilistic random walk after 452026 steps, saw 84394 distinct states, run finished after 1158 ms. (steps per millisecond=390 ) properties seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 37653 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 17
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: 650 places, 580 transitions, 1709 arcs.
Final Score: 32114.681
Took : 21 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-00 (reachable &!potential( (! ( ( ( (! ( (! ( ( ( (tk(P99)) <= ( 1 ) ) & ( (tk(P427)) <= (tk(P199)) ) ) & (! ( (tk(P570)) <= (tk(P534)) )) )) | ( (tk(P156)) <= ( 0 ) ) )) | (! ( ( ( (tk(P366)) <= (tk(P39)) ) | ( (tk(P126)) <= ( 1 ) ) ) | ( (! ( ( ( 1 ) <= (tk(P120)) ) & ( (tk(P101)) <= (tk(P251)) ) )) | ( ( ( (tk(P450)) <= ( 0 ) ) | ( (tk(P429)) <= (tk(P243)) ) ) | ( ( ( 1 ) <= (tk(P432)) ) | ( (tk(P320)) <= ( 0 ) ) ) ) ) )) ) | ( ( (! ( (tk(P494)) <= (tk(P519)) )) | ( ( (tk(P249)) <= (tk(P325)) ) & ( ( ( ( ( 1 ) <= (tk(P60)) ) & ( (tk(P305)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P631)) ) | ( (tk(P633)) <= ( 0 ) ) ) ) & (! ( ( (tk(P620)) <= (tk(P296)) ) | ( ( 1 ) <= (tk(P155)) ) )) ) ) ) & (! ( (tk(P566)) <= (tk(P216)) )) ) ) & ( ( (tk(P542)) <= ( 0 ) ) | ( (tk(P407)) <= (tk(P88)) ) ) ))))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-01 (reachable & potential(( ( 1 ) <= (tk(P425)) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-02 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P154)) )) | ( ( ( ( ( 1 ) <= (tk(P455)) ) | ( ( 1 ) <= (tk(P167)) ) ) & ( ( 1 ) <= (tk(P351)) ) ) & ( ( 1 ) <= (tk(P350)) ) ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-03 (reachable & potential((! ( (tk(P298)) <= (tk(P424)) ))))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-04 (reachable & potential(( ( ( 1 ) <= (tk(P160)) ) & ( ( ( ( (tk(P569)) <= (tk(P640)) ) & (! ( ( ( ( (tk(P10)) <= (tk(P469)) ) & ( ( (tk(P61)) <= ( 0 ) ) | ( (tk(P341)) <= (tk(P1)) ) ) ) & (! ( ( (tk(P78)) <= (tk(P146)) ) & ( ( 1 ) <= (tk(P264)) ) )) ) | ( (tk(P70)) <= ( 1 ) ) )) ) & ( ( 1 ) <= (tk(P479)) ) ) & ( ( (tk(P458)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P436)) )) ) ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-05 (reachable & potential(( ( 1 ) <= (tk(P89)) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-06 (reachable & potential(( ( (! ( ( 1 ) <= (tk(P631)) )) & ( ( 1 ) <= (tk(P132)) ) ) & ( ( ( (! ( ( (! ( (tk(P241)) <= ( 0 ) )) | ( ( (tk(P31)) <= (tk(P371)) ) | ( ( 1 ) <= (tk(P555)) ) ) ) | ( ( ( ( 1 ) <= (tk(P258)) ) & ( ( 1 ) <= (tk(P578)) ) ) & (! ( ( 1 ) <= (tk(P374)) )) ) )) & ( (tk(P205)) <= (tk(P629)) ) ) & ( (tk(P265)) <= (tk(P322)) ) ) & ( ( ( 1 ) <= (tk(P576)) ) | (! ( (tk(P132)) <= (tk(P172)) )) ) ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-07 (reachable &!potential( ( ( ( (tk(P334)) <= ( 0 ) ) & ( ( (tk(P360)) <= ( 0 ) ) | (! ( (tk(P158)) <= ( 0 ) )) ) ) | ( (tk(P378)) <= (tk(P432)) ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P488)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-09 (reachable & potential(( ( ( (tk(P518)) <= (tk(P594)) ) | (! ( ( ( ( ( ( ( (tk(P324)) <= ( 1 ) ) | ( (tk(P563)) <= ( 0 ) ) ) | (! ( (tk(P380)) <= (tk(P198)) )) ) | ( (! ( (tk(P264)) <= (tk(P130)) )) | ( ( (tk(P591)) <= ( 1 ) ) & ( (tk(P168)) <= ( 0 ) ) ) ) ) | ( (tk(P56)) <= (tk(P443)) ) ) & (! ( (! ( ( (tk(P356)) <= (tk(P375)) ) & ( ( 1 ) <= (tk(P150)) ) )) | ( (! ( (tk(P493)) <= (tk(P576)) )) | ( ( 1 ) <= (tk(P198)) ) ) )) ) & ( ( (tk(P13)) <= (tk(P157)) ) | ( ( (! ( ( (tk(P208)) <= (tk(P125)) ) | ( ( 1 ) <= (tk(P372)) ) )) & ( ( (tk(P421)) <= ( 0 ) ) | ( (tk(P88)) <= (tk(P636)) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P462)) ) | ( ( 1 ) <= (tk(P542)) ) ) | ( (tk(P383)) <= (tk(P152)) ) ) & (! ( (tk(P167)) <= ( 1 ) )) ) ) ) )) ) & (! ( ( (tk(P615)) <= ( 0 ) ) | ( ( ( ( (tk(P85)) <= ( 0 ) ) & ( ( ( (tk(P220)) <= (tk(P491)) ) | ( (tk(P337)) <= (tk(P32)) ) ) | (! ( (tk(P313)) <= ( 1 ) )) ) ) | ( (tk(P94)) <= (tk(P469)) ) ) & ( (tk(P483)) <= (tk(P304)) ) ) )) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-10 (reachable &!potential( ( ( ( (tk(P429)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P175)) ) | ( ( (tk(P555)) <= ( 1 ) ) & (! ( (tk(P454)) <= (tk(P354)) )) ) ) ) | ( (tk(P115)) <= (tk(P538)) ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-11 (reachable & potential(( ( ( 1 ) <= (tk(P460)) ) & ( ( (tk(P591)) <= (tk(P369)) ) | ( (! ( (! ( ( ( 1 ) <= (tk(P507)) ) | ( (tk(P399)) <= ( 0 ) ) )) | (! ( (! ( (tk(P495)) <= (tk(P72)) )) & ( ( (tk(P89)) <= ( 1 ) ) | ( (tk(P52)) <= ( 0 ) ) ) )) )) | ( ( ( ( ( 1 ) <= (tk(P440)) ) & (! ( ( ( (tk(P469)) <= (tk(P52)) ) | ( ( 1 ) <= (tk(P622)) ) ) & ( (tk(P70)) <= ( 0 ) ) )) ) | ( ( 1 ) <= (tk(P88)) ) ) & ( ( (tk(P113)) <= (tk(P244)) ) | ( (! ( ( ( ( 1 ) <= (tk(P44)) ) & ( (tk(P120)) <= (tk(P556)) ) ) & ( ( (tk(P560)) <= (tk(P33)) ) | ( (tk(P633)) <= ( 0 ) ) ) )) & (! ( (tk(P621)) <= ( 1 ) )) ) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-12 (reachable &!potential( ( ( (tk(P84)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P357)) ) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-13 (reachable &!potential( ( (tk(P225)) <= (tk(P245)) )))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-14 (reachable &!potential( (! ( ( 1 ) <= (tk(P155)) ))))
PROPERTY: BusinessProcesses-PT-17-ReachabilityCardinality-15 (reachable &!potential( (! ( ( ( (tk(P217)) <= (tk(P535)) ) & (! ( (! ( ( 1 ) <= (tk(P509)) )) & ( (tk(P475)) <= ( 0 ) ) )) ) & ( ( ( 1 ) <= (tk(P501)) ) & (! ( ( 1 ) <= (tk(P601)) )) ) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12590528 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16107876 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-17"
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-17, 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-167813697000582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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