Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620415000379.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:42 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-20-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716651642967

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:40:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:40:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:40:44] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-25 15:40:44] [INFO ] Transformed 782 places.
[2024-05-25 15:40:44] [INFO ] Transformed 697 transitions.
[2024-05-25 15:40:44] [INFO ] Found NUPN structural information;
[2024-05-25 15:40:44] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 21 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 638 rows 719 cols
[2024-05-25 15:40:45] [INFO ] Computed 121 invariants in 35 ms
[2024-05-25 15:40:46] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:40:46] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-05-25 15:40:46] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-25 15:40:47] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 9 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 2 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 2 ms to minimize.
[2024-05-25 15:40:48] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 2 ms to minimize.
[2024-05-25 15:40:48] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 2 ms to minimize.
[2024-05-25 15:40:48] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2024-05-25 15:40:48] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2024-05-25 15:40:49] [INFO ] Deduced a trap composed of 181 places in 171 ms of which 0 ms to minimize.
[2024-05-25 15:40:49] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 0 ms to minimize.
[2024-05-25 15:40:49] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:40:49] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 2 ms to minimize.
[2024-05-25 15:40:49] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 153 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 0 ms to minimize.
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 153 places in 174 ms of which 0 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 58 places in 206 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 154 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2024-05-25 15:40:53] [INFO ] Deduced a trap composed of 174 places in 252 ms of which 1 ms to minimize.
[2024-05-25 15:40:53] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:40:53] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:40:53] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 0 ms to minimize.
[2024-05-25 15:40:53] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 1 ms to minimize.
[2024-05-25 15:40:54] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:40:54] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:40:54] [INFO ] Deduced a trap composed of 169 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:40:54] [INFO ] Deduced a trap composed of 175 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 1 ms to minimize.
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 0 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 1 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 182 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 0 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 148 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 0 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 154 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 148 places in 135 ms of which 2 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 154 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 14 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 156 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 156 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 149 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:41:00] [INFO ] Deduced a trap composed of 157 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:41:00] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:41:00] [INFO ] Deduced a trap composed of 152 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:41:00] [INFO ] Deduced a trap composed of 155 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:41:00] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 13529 ms
[2024-05-25 15:41:00] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:41:01] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-05-25 15:41:01] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:41:01] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-25 15:41:01] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:41:01] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-25 15:41:01] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2024-05-25 15:41:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1163 ms
[2024-05-25 15:41:02] [INFO ] Deduced a trap composed of 160 places in 243 ms of which 1 ms to minimize.
[2024-05-25 15:41:02] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 1 ms to minimize.
[2024-05-25 15:41:02] [INFO ] Deduced a trap composed of 152 places in 212 ms of which 1 ms to minimize.
[2024-05-25 15:41:03] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 1 ms to minimize.
[2024-05-25 15:41:03] [INFO ] Deduced a trap composed of 134 places in 220 ms of which 1 ms to minimize.
[2024-05-25 15:41:03] [INFO ] Deduced a trap composed of 135 places in 204 ms of which 1 ms to minimize.
[2024-05-25 15:41:03] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:41:03] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:41:04] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:41:04] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 0 ms to minimize.
[2024-05-25 15:41:04] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 1 ms to minimize.
[2024-05-25 15:41:04] [INFO ] Deduced a trap composed of 157 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:41:05] [INFO ] Deduced a trap composed of 159 places in 191 ms of which 1 ms to minimize.
[2024-05-25 15:41:05] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:41:05] [INFO ] Deduced a trap composed of 155 places in 210 ms of which 1 ms to minimize.
[2024-05-25 15:41:05] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:41:05] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:41:06] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 1 ms to minimize.
[2024-05-25 15:41:06] [INFO ] Deduced a trap composed of 150 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:41:06] [INFO ] Deduced a trap composed of 155 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:41:06] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:41:07] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:41:07] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:41:07] [INFO ] Deduced a trap composed of 149 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:41:07] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:41:07] [INFO ] Deduced a trap composed of 152 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:41:08] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:41:08] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:41:08] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:41:08] [INFO ] Deduced a trap composed of 148 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:41:08] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:41:09] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:41:09] [INFO ] Deduced a trap composed of 149 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:41:09] [INFO ] Deduced a trap composed of 155 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:41:09] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:41:09] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:41:09] [INFO ] Deduced a trap composed of 157 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:41:10] [INFO ] Deduced a trap composed of 148 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:41:10] [INFO ] Deduced a trap composed of 151 places in 158 ms of which 0 ms to minimize.
[2024-05-25 15:41:10] [INFO ] Deduced a trap composed of 152 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:41:10] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:41:11] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 0 ms to minimize.
[2024-05-25 15:41:11] [INFO ] Deduced a trap composed of 151 places in 163 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 15:41:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:41:11] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 59 ms.
Support contains 35 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 377 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 686 transition count 469
Reduce places removed 148 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 157 rules applied. Total rules applied 307 place count 538 transition count 460
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 316 place count 529 transition count 460
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 316 place count 529 transition count 363
Deduced a syphon composed of 97 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 527 place count 415 transition count 363
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 605 place count 337 transition count 285
Iterating global reduction 3 with 78 rules applied. Total rules applied 683 place count 337 transition count 285
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 683 place count 337 transition count 279
Deduced a syphon composed of 6 places in 1 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 696 place count 330 transition count 279
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 898 place count 228 transition count 179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 902 place count 226 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 903 place count 226 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 904 place count 225 transition count 185
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 908 place count 225 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 909 place count 224 transition count 184
Applied a total of 909 rules in 190 ms. Remains 224 /719 variables (removed 495) and now considering 184/638 (removed 454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 224/719 places, 184/638 transitions.
Incomplete random walk after 10000 steps, including 481 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:41:11] [INFO ] Flow matrix only has 183 transitions (discarded 1 similar events)
// Phase 1: matrix 183 rows 224 cols
[2024-05-25 15:41:11] [INFO ] Computed 87 invariants in 12 ms
[2024-05-25 15:41:11] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:41:11] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2024-05-25 15:41:11] [INFO ] [Nat]Absence check using 63 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-25 15:41:11] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:41:11] [INFO ] After 82ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:12] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 5 ms to minimize.
[2024-05-25 15:41:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-25 15:41:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:41:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
[2024-05-25 15:41:12] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-25 15:41:12] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 28 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 184/184 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 224 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 222 transition count 182
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 222 transition count 178
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 15 place count 215 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 213 transition count 176
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 213 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 21 place count 212 transition count 175
Applied a total of 21 rules in 31 ms. Remains 212 /224 variables (removed 12) and now considering 175/184 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 212/224 places, 175/184 transitions.
Incomplete random walk after 10000 steps, including 502 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 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982687 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982687 steps, saw 281212 distinct states, run finished after 3002 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:41:15] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
// Phase 1: matrix 174 rows 212 cols
[2024-05-25 15:41:15] [INFO ] Computed 84 invariants in 10 ms
[2024-05-25 15:41:15] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:41:15] [INFO ] [Nat]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-05-25 15:41:15] [INFO ] [Nat]Absence check using 63 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-25 15:41:15] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:41:15] [INFO ] After 73ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:15] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:41:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:41:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-05-25 15:41:15] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-25 15:41:16] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 175/175 transitions.
Applied a total of 0 rules in 19 ms. Remains 212 /212 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 212/212 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 175/175 transitions.
Applied a total of 0 rules in 15 ms. Remains 212 /212 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-25 15:41:16] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2024-05-25 15:41:16] [INFO ] Invariant cache hit.
[2024-05-25 15:41:16] [INFO ] Implicit Places using invariants in 219 ms returned [20, 22, 24, 26, 28, 30, 45, 46, 60, 167]
Discarding 10 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 223 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/212 places, 173/175 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 165
Applied a total of 4 rules in 13 ms. Remains 200 /202 variables (removed 2) and now considering 165/173 (removed 8) transitions.
[2024-05-25 15:41:16] [INFO ] Flow matrix only has 164 transitions (discarded 1 similar events)
// Phase 1: matrix 164 rows 200 cols
[2024-05-25 15:41:16] [INFO ] Computed 76 invariants in 3 ms
[2024-05-25 15:41:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 15:41:16] [INFO ] Flow matrix only has 164 transitions (discarded 1 similar events)
[2024-05-25 15:41:16] [INFO ] Invariant cache hit.
[2024-05-25 15:41:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:41:16] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [60, 123, 125, 127, 131, 134, 135, 137]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 453 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 192/212 places, 165/175 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 191 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 190 transition count 163
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 190 transition count 159
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 186 transition count 159
Applied a total of 12 rules in 43 ms. Remains 186 /192 variables (removed 6) and now considering 159/165 (removed 6) transitions.
[2024-05-25 15:41:16] [INFO ] Flow matrix only has 158 transitions (discarded 1 similar events)
// Phase 1: matrix 158 rows 186 cols
[2024-05-25 15:41:16] [INFO ] Computed 68 invariants in 17 ms
[2024-05-25 15:41:17] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-25 15:41:17] [INFO ] Flow matrix only has 158 transitions (discarded 1 similar events)
[2024-05-25 15:41:17] [INFO ] Invariant cache hit.
[2024-05-25 15:41:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 15:41:17] [INFO ] Implicit Places using invariants and state equation in 255 ms returned [7, 50, 51, 52]
Discarding 4 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 515 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 182/212 places, 158/175 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 180 transition count 150
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 180 transition count 150
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 180 transition count 150
Applied a total of 10 rules in 20 ms. Remains 180 /182 variables (removed 2) and now considering 150/158 (removed 8) transitions.
[2024-05-25 15:41:17] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 180 cols
[2024-05-25 15:41:17] [INFO ] Computed 65 invariants in 2 ms
[2024-05-25 15:41:17] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-25 15:41:17] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
[2024-05-25 15:41:17] [INFO ] Invariant cache hit.
[2024-05-25 15:41:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 15:41:17] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 180/212 places, 150/175 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1687 ms. Remains : 180/212 places, 150/175 transitions.
Incomplete random walk after 10000 steps, including 516 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1143686 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1143686 steps, saw 327642 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:41:20] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
[2024-05-25 15:41:20] [INFO ] Invariant cache hit.
[2024-05-25 15:41:20] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:41:21] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2024-05-25 15:41:21] [INFO ] [Nat]Absence check using 52 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 15:41:21] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 15:41:21] [INFO ] After 64ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2024-05-25 15:41:21] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:41:22] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:41:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 782 ms
[2024-05-25 15:41:22] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-25 15:41:22] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 28 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 150/150 transitions.
Applied a total of 0 rules in 11 ms. Remains 180 /180 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 180/180 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 150/150 transitions.
Applied a total of 0 rules in 10 ms. Remains 180 /180 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-25 15:41:22] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
[2024-05-25 15:41:22] [INFO ] Invariant cache hit.
[2024-05-25 15:41:22] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-25 15:41:22] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
[2024-05-25 15:41:22] [INFO ] Invariant cache hit.
[2024-05-25 15:41:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 15:41:22] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-25 15:41:22] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-25 15:41:22] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
[2024-05-25 15:41:22] [INFO ] Invariant cache hit.
[2024-05-25 15:41:22] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 180/180 places, 150/150 transitions.
Graph (complete) has 537 edges and 180 vertex of which 177 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 177 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 177 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 175 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 175 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 174 transition count 146
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 174 transition count 146
Applied a total of 11 rules in 19 ms. Remains 174 /180 variables (removed 6) and now considering 146/150 (removed 4) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 174 cols
[2024-05-25 15:41:22] [INFO ] Computed 62 invariants in 2 ms
[2024-05-25 15:41:22] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:41:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 8 ms returned sat
[2024-05-25 15:41:22] [INFO ] [Nat]Absence check using 49 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 15:41:22] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 15:41:22] [INFO ] After 30ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-25 15:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-25 15:41:22] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-25 15:41:22] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:41:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-25 15:41:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 180 places, 150 transitions and 777 arcs took 3 ms.
[2024-05-25 15:41:23] [INFO ] Flatten gal took : 76 ms
Total runtime 38576 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-20
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityCardinality

FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716651683595

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
lola: result : true
lola: markings : 680
lola: fired transitions : 705
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 4 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 7 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-2024-09 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-ReachabilityCardinality-2024-09: EF true tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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-20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-20, 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 r065-tajo-171620415000379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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