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.r010-oct2-167813599000429.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-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000429
=====================================================================

--------------------
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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678688722392

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 06:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:25:25] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-13 06:25:25] [INFO ] Transformed 390 places.
[2023-03-13 06:25:25] [INFO ] Transformed 388 transitions.
[2023-03-13 06:25:25] [INFO ] Found NUPN structural information;
[2023-03-13 06:25:25] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 388 rows 390 cols
[2023-03-13 06:25:25] [INFO ] Computed 28 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 49 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :13
FORMULA AutoFlight-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
[2023-03-13 06:25:25] [INFO ] Invariant cache hit.
[2023-03-13 06:25:26] [INFO ] [Real]Absence check using 27 positive place invariants in 15 ms returned sat
[2023-03-13 06:25:26] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 06:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:25:26] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-13 06:25:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:25:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2023-03-13 06:25:26] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 06:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:25:27] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-13 06:25:27] [INFO ] Deduced a trap composed of 15 places in 543 ms of which 4 ms to minimize.
[2023-03-13 06:25:27] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2023-03-13 06:25:27] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-13 06:25:28] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 2 ms to minimize.
[2023-03-13 06:25:28] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 13 ms to minimize.
[2023-03-13 06:25:28] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 1 ms to minimize.
[2023-03-13 06:25:28] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 17 ms to minimize.
[2023-03-13 06:25:29] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 13 ms to minimize.
[2023-03-13 06:25:29] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 0 ms to minimize.
[2023-03-13 06:25:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2052 ms
[2023-03-13 06:25:29] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 114 ms.
[2023-03-13 06:25:31] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 1 ms to minimize.
[2023-03-13 06:25:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-13 06:25:32] [INFO ] [Real]Absence check using 27 positive place invariants in 73 ms returned sat
[2023-03-13 06:25:32] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-13 06:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:25:32] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-13 06:25:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:25:32] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2023-03-13 06:25:32] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 06:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:25:32] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-13 06:25:32] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 0 ms to minimize.
[2023-03-13 06:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-13 06:25:32] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-13 06:25:36] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 1 ms to minimize.
[2023-03-13 06:25:36] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 1 ms to minimize.
[2023-03-13 06:25:37] [INFO ] Deduced a trap composed of 49 places in 588 ms of which 1 ms to minimize.
[2023-03-13 06:25:37] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 1 ms to minimize.
[2023-03-13 06:25:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-13 06:25:37] [INFO ] [Real]Absence check using 27 positive place invariants in 33 ms returned sat
[2023-03-13 06:25:37] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 06:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:25:37] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-13 06:25:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:25:38] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2023-03-13 06:25:38] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 06:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:25:38] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2023-03-13 06:25:38] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 1 ms to minimize.
[2023-03-13 06:25:38] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2023-03-13 06:25:38] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 0 ms to minimize.
[2023-03-13 06:25:38] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 0 ms to minimize.
[2023-03-13 06:25:39] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2023-03-13 06:25:39] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2023-03-13 06:25:39] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 13 ms to minimize.
[2023-03-13 06:25:39] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 0 ms to minimize.
[2023-03-13 06:25:39] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 1 ms to minimize.
[2023-03-13 06:25:39] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 1 ms to minimize.
[2023-03-13 06:25:40] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 1 ms to minimize.
[2023-03-13 06:25:40] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 0 ms to minimize.
[2023-03-13 06:25:40] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 8 ms to minimize.
[2023-03-13 06:25:40] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 0 ms to minimize.
[2023-03-13 06:25:40] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 1 ms to minimize.
[2023-03-13 06:25:40] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2510 ms
[2023-03-13 06:25:40] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-13 06:25:42] [INFO ] Added : 220 causal constraints over 44 iterations in 2119 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA AutoFlight-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 390 transition count 238
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 177 rules applied. Total rules applied 327 place count 240 transition count 211
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 336 place count 232 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 337 place count 231 transition count 210
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 337 place count 231 transition count 157
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 443 place count 178 transition count 157
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 479 place count 142 transition count 121
Iterating global reduction 4 with 36 rules applied. Total rules applied 515 place count 142 transition count 121
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 515 place count 142 transition count 109
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 539 place count 130 transition count 109
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 603 place count 98 transition count 77
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 98 transition count 76
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 620 place count 98 transition count 60
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 636 place count 82 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 637 place count 81 transition count 59
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 30 rules applied. Total rules applied 667 place count 67 transition count 43
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 683 place count 51 transition count 43
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 683 place count 51 transition count 29
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 711 place count 37 transition count 29
Applied a total of 711 rules in 122 ms. Remains 37 /390 variables (removed 353) and now considering 29/388 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 37/390 places, 29/388 transitions.
// Phase 1: matrix 29 rows 37 cols
[2023-03-13 06:25:43] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 2) seen :2
FORMULA AutoFlight-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18609 ms.
ITS solved all properties within timeout

BK_STOP 1678688744438

--------------------
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 UpperBounds -timeout 360 -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="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-04b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599000429"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;