Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r184-tall-167838871100293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FlexibleBarrier-PT-06b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-167838871100293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K 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 1678551131356

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=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 16:12:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-11 16:12:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:12:12] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-11 16:12:12] [INFO ] Transformed 542 places.
[2023-03-11 16:12:12] [INFO ] Transformed 621 transitions.
[2023-03-11 16:12:12] [INFO ] Found NUPN structural information;
[2023-03-11 16:12:13] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 135 ms.
Graph (trivial) has 522 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 5 ms
Free SCC test removed 32 places
Structural test allowed to assert that 164 places are NOT stable. Took 15 ms.
Ensure Unique test removed 33 transitions
Reduce redundant transitions removed 33 transitions.
Incomplete random walk after 10000 steps, including 248 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 378) seen :106
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 272) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) 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 272) seen :0
Running SMT prover for 272 properties.
[2023-03-11 16:12:13] [INFO ] Flow matrix only has 583 transitions (discarded 5 similar events)
// Phase 1: matrix 583 rows 510 cols
[2023-03-11 16:12:13] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-11 16:12:17] [INFO ] After 3197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:272
[2023-03-11 16:12:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-11 16:12:26] [INFO ] After 5855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :272
[2023-03-11 16:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 16:12:32] [INFO ] After 5674ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :272
[2023-03-11 16:12:32] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 6 ms to minimize.
[2023-03-11 16:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-11 16:12:33] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2023-03-11 16:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-11 16:12:33] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 1 ms to minimize.
[2023-03-11 16:12:33] [INFO ] Deduced a trap composed of 175 places in 140 ms of which 1 ms to minimize.
[2023-03-11 16:12:33] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2023-03-11 16:12:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 520 ms
[2023-03-11 16:12:33] [INFO ] Deduced a trap composed of 185 places in 140 ms of which 0 ms to minimize.
[2023-03-11 16:12:34] [INFO ] Deduced a trap composed of 203 places in 151 ms of which 1 ms to minimize.
[2023-03-11 16:12:34] [INFO ] Deduced a trap composed of 123 places in 95 ms of which 1 ms to minimize.
[2023-03-11 16:12:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2023-03-11 16:12:34] [INFO ] Deduced a trap composed of 182 places in 138 ms of which 1 ms to minimize.
[2023-03-11 16:12:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-11 16:12:35] [INFO ] Deduced a trap composed of 150 places in 147 ms of which 1 ms to minimize.
[2023-03-11 16:12:35] [INFO ] Deduced a trap composed of 155 places in 128 ms of which 1 ms to minimize.
[2023-03-11 16:12:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2023-03-11 16:12:35] [INFO ] Deduced a trap composed of 211 places in 133 ms of which 0 ms to minimize.
[2023-03-11 16:12:35] [INFO ] Deduced a trap composed of 180 places in 120 ms of which 1 ms to minimize.
[2023-03-11 16:12:36] [INFO ] Deduced a trap composed of 184 places in 120 ms of which 0 ms to minimize.
[2023-03-11 16:12:36] [INFO ] Deduced a trap composed of 157 places in 120 ms of which 1 ms to minimize.
[2023-03-11 16:12:36] [INFO ] Deduced a trap composed of 184 places in 119 ms of which 0 ms to minimize.
[2023-03-11 16:12:36] [INFO ] Deduced a trap composed of 182 places in 121 ms of which 0 ms to minimize.
[2023-03-11 16:12:36] [INFO ] Deduced a trap composed of 186 places in 118 ms of which 0 ms to minimize.
[2023-03-11 16:12:36] [INFO ] Deduced a trap composed of 205 places in 118 ms of which 1 ms to minimize.
[2023-03-11 16:12:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1187 ms
[2023-03-11 16:12:37] [INFO ] Deduced a trap composed of 170 places in 88 ms of which 0 ms to minimize.
[2023-03-11 16:12:37] [INFO ] Deduced a trap composed of 170 places in 89 ms of which 0 ms to minimize.
[2023-03-11 16:12:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-11 16:12:37] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 0 ms to minimize.
[2023-03-11 16:12:37] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 0 ms to minimize.
[2023-03-11 16:12:37] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 0 ms to minimize.
[2023-03-11 16:12:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2023-03-11 16:12:38] [INFO ] Deduced a trap composed of 178 places in 147 ms of which 0 ms to minimize.
[2023-03-11 16:12:38] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 0 ms to minimize.
[2023-03-11 16:12:38] [INFO ] Deduced a trap composed of 162 places in 126 ms of which 1 ms to minimize.
[2023-03-11 16:12:39] [INFO ] Deduced a trap composed of 123 places in 53 ms of which 0 ms to minimize.
[2023-03-11 16:12:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 587 ms
[2023-03-11 16:12:39] [INFO ] Deduced a trap composed of 169 places in 135 ms of which 1 ms to minimize.
[2023-03-11 16:12:39] [INFO ] Deduced a trap composed of 196 places in 141 ms of which 0 ms to minimize.
[2023-03-11 16:12:39] [INFO ] Deduced a trap composed of 184 places in 134 ms of which 1 ms to minimize.
[2023-03-11 16:12:39] [INFO ] Deduced a trap composed of 213 places in 95 ms of which 0 ms to minimize.
[2023-03-11 16:12:39] [INFO ] Deduced a trap composed of 216 places in 90 ms of which 0 ms to minimize.
[2023-03-11 16:12:40] [INFO ] Deduced a trap composed of 227 places in 144 ms of which 1 ms to minimize.
[2023-03-11 16:12:40] [INFO ] Deduced a trap composed of 182 places in 147 ms of which 4 ms to minimize.
[2023-03-11 16:12:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1076 ms
[2023-03-11 16:12:40] [INFO ] Deduced a trap composed of 157 places in 148 ms of which 1 ms to minimize.
[2023-03-11 16:12:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-11 16:12:40] [INFO ] Deduced a trap composed of 172 places in 141 ms of which 1 ms to minimize.
[2023-03-11 16:12:40] [INFO ] Deduced a trap composed of 171 places in 127 ms of which 0 ms to minimize.
[2023-03-11 16:12:40] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 1 ms to minimize.
[2023-03-11 16:12:41] [INFO ] Deduced a trap composed of 173 places in 72 ms of which 1 ms to minimize.
[2023-03-11 16:12:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 595 ms
[2023-03-11 16:12:41] [INFO ] Deduced a trap composed of 196 places in 146 ms of which 0 ms to minimize.
[2023-03-11 16:12:41] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 1 ms to minimize.
[2023-03-11 16:12:41] [INFO ] Deduced a trap composed of 206 places in 131 ms of which 0 ms to minimize.
[2023-03-11 16:12:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 501 ms
[2023-03-11 16:12:41] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 0 ms to minimize.
[2023-03-11 16:12:41] [INFO ] Deduced a trap composed of 120 places in 64 ms of which 0 ms to minimize.
[2023-03-11 16:12:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-11 16:12:42] [INFO ] Deduced a trap composed of 14 places in 157 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.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-11 16:12:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 16:12:42] [INFO ] After 25170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:272
Parikh walk visited 10 properties in 1671 ms.
Support contains 262 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 588/588 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 510 transition count 513
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 144 place count 441 transition count 513
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 171 place count 414 transition count 486
Iterating global reduction 2 with 27 rules applied. Total rules applied 198 place count 414 transition count 486
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 203 place count 409 transition count 481
Iterating global reduction 2 with 5 rules applied. Total rules applied 208 place count 409 transition count 481
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 270 place count 378 transition count 450
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 276 place count 378 transition count 444
Free-agglomeration rule applied 87 times.
Iterating global reduction 3 with 87 rules applied. Total rules applied 363 place count 378 transition count 357
Reduce places removed 87 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 93 rules applied. Total rules applied 456 place count 291 transition count 351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 457 place count 290 transition count 350
Applied a total of 457 rules in 123 ms. Remains 290 /510 variables (removed 220) and now considering 350/588 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 290/510 places, 350/588 transitions.
Finished random walk after 30852 steps, including 0 resets, run visited all 262 properties in 856 ms. (steps per millisecond=36 )
Able to resolve query StableMarking after proving 380 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 32186 ms.
ITS solved all properties within timeout

BK_STOP 1678551166059

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is FlexibleBarrier-PT-06b, 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 r184-tall-167838871100293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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