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.r024-oct2-167813611100288.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-06b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-oct2-167813611100288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 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:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 134K 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 1679000269818

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=AutoFlight-PT-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 20:57:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 20:57:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:57:52] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-16 20:57:52] [INFO ] Transformed 574 places.
[2023-03-16 20:57:52] [INFO ] Transformed 572 transitions.
[2023-03-16 20:57:52] [INFO ] Found NUPN structural information;
[2023-03-16 20:57:52] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 189 ms.
Structural test allowed to assert that 341 places are NOT stable. Took 9 ms.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 233) seen :88
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) 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 145) 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 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) 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 145) 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 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 145) 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 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 145) 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 145) 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 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 145) 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 145) 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 145) 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 145) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 145) 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 145) 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 145) seen :0
Running SMT prover for 145 properties.
// Phase 1: matrix 572 rows 574 cols
[2023-03-16 20:57:53] [INFO ] Computed 40 place invariants in 24 ms
[2023-03-16 20:57:56] [INFO ] After 3396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:145
[2023-03-16 20:57:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 47 ms returned sat
[2023-03-16 20:57:59] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-16 20:58:07] [INFO ] After 5663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :145
[2023-03-16 20:58:07] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 19 ms to minimize.
[2023-03-16 20:58:07] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2023-03-16 20:58:07] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2023-03-16 20:58:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2023-03-16 20:58:08] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 1 ms to minimize.
[2023-03-16 20:58:08] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 1 ms to minimize.
[2023-03-16 20:58:08] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 3 ms to minimize.
[2023-03-16 20:58:10] [INFO ] Deduced a trap composed of 92 places in 1972 ms of which 13 ms to minimize.
[2023-03-16 20:58:10] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 0 ms to minimize.
[2023-03-16 20:58:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2937 ms
[2023-03-16 20:58:11] [INFO ] Deduced a trap composed of 80 places in 655 ms of which 1 ms to minimize.
[2023-03-16 20:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2023-03-16 20:58:12] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 1 ms to minimize.
[2023-03-16 20:58:12] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2023-03-16 20:58:13] [INFO ] Deduced a trap composed of 80 places in 887 ms of which 1 ms to minimize.
[2023-03-16 20:58:13] [INFO ] Deduced a trap composed of 105 places in 564 ms of which 1 ms to minimize.
[2023-03-16 20:58:13] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 1 ms to minimize.
[2023-03-16 20:58:13] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 0 ms to minimize.
[2023-03-16 20:58:14] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 10 ms to minimize.
[2023-03-16 20:58:14] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 1 ms to minimize.
[2023-03-16 20:58:14] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2023-03-16 20:58:14] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 0 ms to minimize.
[2023-03-16 20:58:14] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 1 ms to minimize.
[2023-03-16 20:58:14] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 1 ms to minimize.
[2023-03-16 20:58:15] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 0 ms to minimize.
[2023-03-16 20:58:15] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 0 ms to minimize.
[2023-03-16 20:58:15] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 0 ms to minimize.
[2023-03-16 20:58:15] [INFO ] Deduced a trap composed of 103 places in 188 ms of which 1 ms to minimize.
[2023-03-16 20:58:15] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 1 ms to minimize.
[2023-03-16 20:58:15] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 0 ms to minimize.
[2023-03-16 20:58:16] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 0 ms to minimize.
[2023-03-16 20:58:16] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 1 ms to minimize.
[2023-03-16 20:58:16] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 1 ms to minimize.
[2023-03-16 20:58:16] [INFO ] Deduced a trap composed of 82 places in 239 ms of which 0 ms to minimize.
[2023-03-16 20:58:16] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 1 ms to minimize.
[2023-03-16 20:58:16] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 1 ms to minimize.
[2023-03-16 20:58:16] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 0 ms to minimize.
[2023-03-16 20:58:17] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 12 ms to minimize.
[2023-03-16 20:58:17] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 1 ms to minimize.
[2023-03-16 20:58:17] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 0 ms to minimize.
[2023-03-16 20:58:17] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 0 ms to minimize.
[2023-03-16 20:58:17] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 0 ms to minimize.
[2023-03-16 20:58:17] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 14 ms to minimize.
[2023-03-16 20:58:17] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6094 ms
[2023-03-16 20:58:18] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2023-03-16 20:58:18] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2023-03-16 20:58:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2023-03-16 20:58:18] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 1 ms to minimize.
[2023-03-16 20:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-16 20:58:19] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 0 ms to minimize.
[2023-03-16 20:58:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-16 20:58:19] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2023-03-16 20:58:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-16 20:58:20] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 0 ms to minimize.
[2023-03-16 20:58:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-16 20:58:20] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 1 ms to minimize.
[2023-03-16 20:58:20] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2023-03-16 20:58:20] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 0 ms to minimize.
[2023-03-16 20:58:20] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 0 ms to minimize.
[2023-03-16 20:58:21] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 0 ms to minimize.
[2023-03-16 20:58:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 744 ms
[2023-03-16 20:58:21] [INFO ] Deduced a trap composed of 63 places in 139 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-16 20:58:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:58:21] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:145
Fused 145 Parikh solutions to 141 different solutions.
Parikh walk visited 138 properties in 31041 ms.
Support contains 7 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 223 place count 574 transition count 349
Reduce places removed 223 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 264 rules applied. Total rules applied 487 place count 351 transition count 308
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 499 place count 339 transition count 308
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 499 place count 339 transition count 233
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 649 place count 264 transition count 233
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 702 place count 211 transition count 180
Iterating global reduction 3 with 53 rules applied. Total rules applied 755 place count 211 transition count 180
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 755 place count 211 transition count 162
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 791 place count 193 transition count 162
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 885 place count 146 transition count 115
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 886 place count 146 transition count 114
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 910 place count 146 transition count 90
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 934 place count 122 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 935 place count 121 transition count 89
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 53 rules applied. Total rules applied 988 place count 99 transition count 58
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 1019 place count 68 transition count 58
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 1019 place count 68 transition count 41
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1053 place count 51 transition count 41
Applied a total of 1053 rules in 79 ms. Remains 51 /574 variables (removed 523) and now considering 41/572 (removed 531) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 51/574 places, 41/572 transitions.
Finished random walk after 87 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=29 )
Able to resolve query StableMarking after proving 234 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 60510 ms.
ITS solved all properties within timeout

BK_STOP 1679000332856

--------------------
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="AutoFlight-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 AutoFlight-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 r024-oct2-167813611100288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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