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-167813610300268.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-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r023-oct2-167813610300268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 18:11 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 91K 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 1678988060425

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-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 17:34:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 17:34:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:34:24] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-16 17:34:24] [INFO ] Transformed 390 places.
[2023-03-16 17:34:24] [INFO ] Transformed 388 transitions.
[2023-03-16 17:34:24] [INFO ] Found NUPN structural information;
[2023-03-16 17:34:24] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 255 ms.
Structural test allowed to assert that 231 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 159) seen :82
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Running SMT prover for 77 properties.
// Phase 1: matrix 388 rows 390 cols
[2023-03-16 17:34:25] [INFO ] Computed 28 place invariants in 11 ms
[2023-03-16 17:34:26] [INFO ] After 1611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:77
[2023-03-16 17:34:27] [INFO ] [Nat]Absence check using 27 positive place invariants in 92 ms returned sat
[2023-03-16 17:34:27] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 25 ms returned sat
[2023-03-16 17:34:32] [INFO ] After 2780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :77
[2023-03-16 17:34:32] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 21 ms to minimize.
[2023-03-16 17:34:33] [INFO ] Deduced a trap composed of 55 places in 1087 ms of which 22 ms to minimize.
[2023-03-16 17:34:33] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 13 ms to minimize.
[2023-03-16 17:34:34] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 0 ms to minimize.
[2023-03-16 17:34:34] [INFO ] Deduced a trap composed of 53 places in 446 ms of which 1 ms to minimize.
[2023-03-16 17:34:34] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2023-03-16 17:34:35] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2023-03-16 17:34:36] [INFO ] Deduced a trap composed of 51 places in 1514 ms of which 13 ms to minimize.
[2023-03-16 17:34:36] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 1 ms to minimize.
[2023-03-16 17:34:37] [INFO ] Deduced a trap composed of 57 places in 432 ms of which 13 ms to minimize.
[2023-03-16 17:34:37] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 1 ms to minimize.
[2023-03-16 17:34:37] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 26 ms to minimize.
[2023-03-16 17:34:37] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 0 ms to minimize.
[2023-03-16 17:34:38] [INFO ] Deduced a trap composed of 64 places in 525 ms of which 1 ms to minimize.
[2023-03-16 17:34:39] [INFO ] Deduced a trap composed of 82 places in 787 ms of which 1 ms to minimize.
[2023-03-16 17:34:39] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 0 ms to minimize.
[2023-03-16 17:34:39] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 0 ms to minimize.
[2023-03-16 17:34:39] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2023-03-16 17:34:40] [INFO ] Deduced a trap composed of 69 places in 391 ms of which 1 ms to minimize.
[2023-03-16 17:34:40] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 0 ms to minimize.
[2023-03-16 17:34:42] [INFO ] Deduced a trap composed of 74 places in 1764 ms of which 1 ms to minimize.
[2023-03-16 17:34:43] [INFO ] Deduced a trap composed of 80 places in 1220 ms of which 1 ms to minimize.
[2023-03-16 17:34:43] [INFO ] Deduced a trap composed of 61 places in 201 ms of which 0 ms to minimize.
[2023-03-16 17:34:44] [INFO ] Deduced a trap composed of 36 places in 628 ms of which 3 ms to minimize.
[2023-03-16 17:34:45] [INFO ] Deduced a trap composed of 42 places in 536 ms of which 2 ms to minimize.
[2023-03-16 17:34:45] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 1 ms to minimize.
[2023-03-16 17:34:46] [INFO ] Deduced a trap composed of 35 places in 1027 ms of which 1 ms to minimize.
[2023-03-16 17:34:46] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 1 ms to minimize.
[2023-03-16 17:34:46] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 0 ms to minimize.
[2023-03-16 17:34:47] [INFO ] Deduced a trap composed of 39 places in 568 ms of which 0 ms to minimize.
[2023-03-16 17:34:47] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 1 ms to minimize.
[2023-03-16 17:34:47] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 1 ms to minimize.
[2023-03-16 17:34:48] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 0 ms to minimize.
[2023-03-16 17:34:48] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 13 ms to minimize.
[2023-03-16 17:34:48] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 38 ms to minimize.
[2023-03-16 17:34:48] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 0 ms to minimize.
[2023-03-16 17:34:48] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 1 ms to minimize.
[2023-03-16 17:34:48] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2023-03-16 17:34:49] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 0 ms to minimize.
[2023-03-16 17:34:49] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 14 ms to minimize.
[2023-03-16 17:34:49] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 17131 ms
[2023-03-16 17:34:50] [INFO ] Deduced a trap composed of 24 places in 724 ms of which 0 ms to minimize.
[2023-03-16 17:34:50] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2023-03-16 17:34:50] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2023-03-16 17:34:50] [INFO ] Deduced a trap composed of 40 places in 496 ms of which 0 ms to minimize.
[2023-03-16 17:34:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1435 ms
[2023-03-16 17:34:51] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 1 ms to minimize.
[2023-03-16 17:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-16 17:34:51] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 16 ms to minimize.
[2023-03-16 17:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-16 17:34:51] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 1 ms to minimize.
[2023-03-16 17:34:51] [INFO ] Deduced a trap composed of 71 places in 151 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:34:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 17:34:51] [INFO ] After 25132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:77
Fused 77 Parikh solutions to 70 different solutions.
Parikh walk visited 10 properties in 6951 ms.
Support contains 67 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 390 transition count 258
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 156 rules applied. Total rules applied 286 place count 260 transition count 232
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 294 place count 252 transition count 232
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 294 place count 252 transition count 194
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 370 place count 214 transition count 194
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 386 place count 198 transition count 178
Iterating global reduction 3 with 16 rules applied. Total rules applied 402 place count 198 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 402 place count 198 transition count 168
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 422 place count 188 transition count 168
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 506 place count 146 transition count 126
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 508 place count 146 transition count 124
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 524 place count 146 transition count 108
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 540 place count 130 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 541 place count 129 transition count 107
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 552 place count 121 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 555 place count 118 transition count 104
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 555 place count 118 transition count 95
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 573 place count 109 transition count 95
Applied a total of 573 rules in 55 ms. Remains 109 /390 variables (removed 281) and now considering 95/388 (removed 293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 109/390 places, 95/388 transitions.
Finished random walk after 265 steps, including 0 resets, run visited all 67 properties in 17 ms. (steps per millisecond=15 )
Able to resolve query StableMarking after proving 160 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 35005 ms.
ITS solved all properties within timeout

BK_STOP 1678988099114

--------------------
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="AutoFlight-PT-04b"
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-04b, 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-167813610300268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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