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.r057-tajo-167813708100328.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-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r057-tajo-167813708100328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679050521047

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 10:55:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-17 10:55:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:55:23] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-17 10:55:23] [INFO ] Transformed 518 places.
[2023-03-17 10:55:23] [INFO ] Transformed 471 transitions.
[2023-03-17 10:55:23] [INFO ] Found NUPN structural information;
[2023-03-17 10:55:23] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 126 ms.
Graph (trivial) has 296 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Structural test allowed to assert that 162 places are NOT stable. Took 11 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 356) seen :91
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 265) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 265) seen :0
Running SMT prover for 265 properties.
// Phase 1: matrix 464 rows 512 cols
[2023-03-17 10:55:23] [INFO ] Computed 85 place invariants in 28 ms
[2023-03-17 10:55:26] [INFO ] After 2351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:265
[2023-03-17 10:55:27] [INFO ] [Nat]Absence check using 46 positive place invariants in 14 ms returned sat
[2023-03-17 10:55:27] [INFO ] [Nat]Absence check using 46 positive and 39 generalized place invariants in 9 ms returned sat
[2023-03-17 10:55:33] [INFO ] After 4009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :265
[2023-03-17 10:55:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 10:55:36] [INFO ] After 3449ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :265
[2023-03-17 10:55:37] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 7 ms to minimize.
[2023-03-17 10:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-17 10:55:37] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 2 ms to minimize.
[2023-03-17 10:55:38] [INFO ] Deduced a trap composed of 127 places in 218 ms of which 23 ms to minimize.
[2023-03-17 10:55:38] [INFO ] Deduced a trap composed of 124 places in 297 ms of which 2 ms to minimize.
[2023-03-17 10:55:38] [INFO ] Deduced a trap composed of 133 places in 225 ms of which 1 ms to minimize.
[2023-03-17 10:55:38] [INFO ] Deduced a trap composed of 130 places in 237 ms of which 1 ms to minimize.
[2023-03-17 10:55:39] [INFO ] Deduced a trap composed of 114 places in 193 ms of which 1 ms to minimize.
[2023-03-17 10:55:39] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 2 ms to minimize.
[2023-03-17 10:55:39] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 1 ms to minimize.
[2023-03-17 10:55:39] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 1 ms to minimize.
[2023-03-17 10:55:39] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 1 ms to minimize.
[2023-03-17 10:55:39] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2023-03-17 10:55:40] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 0 ms to minimize.
[2023-03-17 10:55:40] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 1 ms to minimize.
[2023-03-17 10:55:40] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 1 ms to minimize.
[2023-03-17 10:55:40] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-17 10:55:40] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2023-03-17 10:55:40] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 0 ms to minimize.
[2023-03-17 10:55:40] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 0 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 112 places in 104 ms of which 1 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-17 10:55:41] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-17 10:55:42] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2023-03-17 10:55:42] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2023-03-17 10:55:42] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4502 ms
[2023-03-17 10:55:42] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2023-03-17 10:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-17 10:55:42] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 1 ms to minimize.
[2023-03-17 10:55:42] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 1 ms to minimize.
[2023-03-17 10:55:42] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 1 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 4 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 133 places in 100 ms of which 0 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 0 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 0 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 0 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 1 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 0 ms to minimize.
[2023-03-17 10:55:43] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 1 ms to minimize.
[2023-03-17 10:55:44] [INFO ] Deduced a trap composed of 124 places in 106 ms of which 0 ms to minimize.
[2023-03-17 10:55:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1699 ms
[2023-03-17 10:55:44] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 0 ms to minimize.
[2023-03-17 10:55:44] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 0 ms to minimize.
[2023-03-17 10:55:44] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 0 ms to minimize.
[2023-03-17 10:55:44] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 0 ms to minimize.
[2023-03-17 10:55:44] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 1 ms to minimize.
[2023-03-17 10:55:45] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2023-03-17 10:55:45] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 1 ms to minimize.
[2023-03-17 10:55:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 946 ms
[2023-03-17 10:55:45] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 2 ms to minimize.
[2023-03-17 10:55:45] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 1 ms to minimize.
[2023-03-17 10:55:45] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 0 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 1 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 1 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 3 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 847 ms
[2023-03-17 10:55:46] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 0 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 1 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 0 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Deduced a trap composed of 117 places in 104 ms of which 1 ms to minimize.
[2023-03-17 10:55:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 518 ms
[2023-03-17 10:55:47] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-03-17 10:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-17 10:55:47] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-03-17 10:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-17 10:55:48] [INFO ] Deduced a trap composed of 117 places in 145 ms of which 0 ms to minimize.
[2023-03-17 10:55:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-17 10:55:48] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 1 ms to minimize.
[2023-03-17 10:55:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-17 10:55:49] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
[2023-03-17 10:55:49] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 1 ms to minimize.
[2023-03-17 10:55:49] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 0 ms to minimize.
[2023-03-17 10:55:49] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 1 ms to minimize.
[2023-03-17 10:55:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 629 ms
[2023-03-17 10:55:51] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 10 ms to minimize.
[2023-03-17 10:55:51] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-17 10:55:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:55:51] [INFO ] After 25196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:265
Fused 265 Parikh solutions to 258 different solutions.
Parikh walk visited 140 properties in 4657 ms.
Support contains 125 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 464/464 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 510 transition count 389
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 437 transition count 389
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 148 place count 437 transition count 343
Deduced a syphon composed of 46 places in 5 ms
Ensure Unique test removed 8 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 248 place count 383 transition count 343
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 284 place count 347 transition count 307
Iterating global reduction 2 with 36 rules applied. Total rules applied 320 place count 347 transition count 307
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 320 place count 347 transition count 301
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 2 with 13 rules applied. Total rules applied 333 place count 340 transition count 301
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 494 place count 258 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 496 place count 257 transition count 225
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 498 place count 257 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 500 place count 255 transition count 223
Applied a total of 500 rules in 116 ms. Remains 255 /512 variables (removed 257) and now considering 223/464 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 255/512 places, 223/464 transitions.
Finished random walk after 1008 steps, including 15 resets, run visited all 125 properties in 24 ms. (steps per millisecond=42 )
Able to resolve query StableMarking after proving 358 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 33352 ms.
ITS solved all properties within timeout

BK_STOP 1679050556440

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r057-tajo-167813708100328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;