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.r023-oct2-167813610400288.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 ltsminxred
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 r023-oct2-167813610400288
=====================================================================

--------------------
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 1678988110066

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 17:35:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 17:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:35:13] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-16 17:35:13] [INFO ] Transformed 574 places.
[2023-03-16 17:35:13] [INFO ] Transformed 572 transitions.
[2023-03-16 17:35:13] [INFO ] Found NUPN structural information;
[2023-03-16 17:35:13] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 165 ms.
Structural test allowed to assert that 341 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 233) seen :109
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) 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 124) seen :0
Running SMT prover for 124 properties.
// Phase 1: matrix 572 rows 574 cols
[2023-03-16 17:35:14] [INFO ] Computed 40 place invariants in 15 ms
[2023-03-16 17:35:18] [INFO ] After 4338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:124
[2023-03-16 17:35:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 133 ms returned sat
[2023-03-16 17:35:20] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-16 17:35:28] [INFO ] After 5540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :124
[2023-03-16 17:35:29] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 26 ms to minimize.
[2023-03-16 17:35:29] [INFO ] Deduced a trap composed of 31 places in 662 ms of which 28 ms to minimize.
[2023-03-16 17:35:31] [INFO ] Deduced a trap composed of 72 places in 1386 ms of which 1 ms to minimize.
[2023-03-16 17:35:31] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 15 ms to minimize.
[2023-03-16 17:35:32] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 13 ms to minimize.
[2023-03-16 17:35:32] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 1 ms to minimize.
[2023-03-16 17:35:32] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 7 ms to minimize.
[2023-03-16 17:35:32] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 0 ms to minimize.
[2023-03-16 17:35:33] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 1 ms to minimize.
[2023-03-16 17:35:33] [INFO ] Deduced a trap composed of 90 places in 255 ms of which 0 ms to minimize.
[2023-03-16 17:35:34] [INFO ] Deduced a trap composed of 89 places in 907 ms of which 1 ms to minimize.
[2023-03-16 17:35:34] [INFO ] Deduced a trap composed of 83 places in 526 ms of which 1 ms to minimize.
[2023-03-16 17:35:35] [INFO ] Deduced a trap composed of 77 places in 320 ms of which 2 ms to minimize.
[2023-03-16 17:35:35] [INFO ] Deduced a trap composed of 83 places in 248 ms of which 0 ms to minimize.
[2023-03-16 17:35:35] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2023-03-16 17:35:35] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 1 ms to minimize.
[2023-03-16 17:35:36] [INFO ] Deduced a trap composed of 67 places in 478 ms of which 1 ms to minimize.
[2023-03-16 17:35:36] [INFO ] Deduced a trap composed of 84 places in 210 ms of which 1 ms to minimize.
[2023-03-16 17:35:36] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7763 ms
[2023-03-16 17:35:37] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 1 ms to minimize.
[2023-03-16 17:35:37] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 1 ms to minimize.
[2023-03-16 17:35:37] [INFO ] Deduced a trap composed of 81 places in 275 ms of which 4 ms to minimize.
[2023-03-16 17:35:37] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 13 ms to minimize.
[2023-03-16 17:35:37] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 14 ms to minimize.
[2023-03-16 17:35:38] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 0 ms to minimize.
[2023-03-16 17:35:38] [INFO ] Deduced a trap composed of 80 places in 610 ms of which 1 ms to minimize.
[2023-03-16 17:35:38] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 0 ms to minimize.
[2023-03-16 17:35:39] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2023-03-16 17:35:39] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 0 ms to minimize.
[2023-03-16 17:35:39] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 20 ms to minimize.
[2023-03-16 17:35:39] [INFO ] Deduced a trap composed of 100 places in 165 ms of which 1 ms to minimize.
[2023-03-16 17:35:39] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 0 ms to minimize.
[2023-03-16 17:35:40] [INFO ] Deduced a trap composed of 76 places in 362 ms of which 1 ms to minimize.
[2023-03-16 17:35:40] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 0 ms to minimize.
[2023-03-16 17:35:40] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 14 ms to minimize.
[2023-03-16 17:35:41] [INFO ] Deduced a trap composed of 85 places in 637 ms of which 28 ms to minimize.
[2023-03-16 17:35:41] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2023-03-16 17:35:41] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 0 ms to minimize.
[2023-03-16 17:35:41] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 0 ms to minimize.
[2023-03-16 17:35:41] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 0 ms to minimize.
[2023-03-16 17:35:42] [INFO ] Deduced a trap composed of 59 places in 475 ms of which 1 ms to minimize.
[2023-03-16 17:35:42] [INFO ] Deduced a trap composed of 55 places in 181 ms of which 0 ms to minimize.
[2023-03-16 17:35:44] [INFO ] Deduced a trap composed of 84 places in 1520 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 17:35:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 17:35:44] [INFO ] After 25767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:124
Fused 124 Parikh solutions to 121 different solutions.
Parikh walk visited 19 properties in 3974 ms.
Support contains 105 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 185 place count 574 transition count 387
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 222 rules applied. Total rules applied 407 place count 389 transition count 350
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 419 place count 377 transition count 350
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 419 place count 377 transition count 290
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 539 place count 317 transition count 290
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 563 place count 293 transition count 266
Iterating global reduction 3 with 24 rules applied. Total rules applied 587 place count 293 transition count 266
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 587 place count 293 transition count 254
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 611 place count 281 transition count 254
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 727 place count 223 transition count 196
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 732 place count 223 transition count 191
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 756 place count 223 transition count 167
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 780 place count 199 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 781 place count 198 transition count 166
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 19 rules applied. Total rules applied 800 place count 185 transition count 160
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 806 place count 179 transition count 160
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 806 place count 179 transition count 146
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 834 place count 165 transition count 146
Applied a total of 834 rules in 84 ms. Remains 165 /574 variables (removed 409) and now considering 146/572 (removed 426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 165/574 places, 146/572 transitions.
Finished random walk after 402 steps, including 0 resets, run visited all 105 properties in 16 ms. (steps per millisecond=25 )
Able to resolve query StableMarking after proving 234 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 35189 ms.
ITS solved all properties within timeout

BK_STOP 1678988148415

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="AutoFlight-PT-06b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
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 r023-oct2-167813610400288"
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 ;