Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180100081.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutoFlight-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180100081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 113K May 18 16:42 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-05b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716278945771

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 08:09:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 08:09:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:09:08] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-21 08:09:08] [INFO ] Transformed 482 places.
[2024-05-21 08:09:08] [INFO ] Transformed 480 transitions.
[2024-05-21 08:09:08] [INFO ] Found NUPN structural information;
[2024-05-21 08:09:08] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 480 rows 482 cols
[2024-05-21 08:09:09] [INFO ] Computed 34 invariants in 27 ms
Incomplete random walk after 10000 steps, including 40 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :13
FORMULA AutoFlight-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
[2024-05-21 08:09:09] [INFO ] Invariant cache hit.
[2024-05-21 08:09:09] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-21 08:09:09] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 08:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 08:09:09] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-05-21 08:09:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:09:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2024-05-21 08:09:10] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 08:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 08:09:10] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-21 08:09:10] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 7 ms to minimize.
[2024-05-21 08:09:10] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 1 ms to minimize.
[2024-05-21 08:09:11] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2024-05-21 08:09:11] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 2 ms to minimize.
[2024-05-21 08:09:11] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 1 ms to minimize.
[2024-05-21 08:09:11] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 1 ms to minimize.
[2024-05-21 08:09:11] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 1 ms to minimize.
[2024-05-21 08:09:12] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 1 ms to minimize.
[2024-05-21 08:09:12] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 0 ms to minimize.
[2024-05-21 08:09:12] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 1 ms to minimize.
[2024-05-21 08:09:12] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 1 ms to minimize.
[2024-05-21 08:09:12] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 2 ms to minimize.
[2024-05-21 08:09:13] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 1 ms to minimize.
[2024-05-21 08:09:13] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 1 ms to minimize.
[2024-05-21 08:09:13] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 0 ms to minimize.
[2024-05-21 08:09:13] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 1 ms to minimize.
[2024-05-21 08:09:13] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 0 ms to minimize.
[2024-05-21 08:09:14] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2024-05-21 08:09:14] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 1 ms to minimize.
[2024-05-21 08:09:14] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 1 ms to minimize.
[2024-05-21 08:09:14] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 0 ms to minimize.
[2024-05-21 08:09:14] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 1 ms to minimize.
[2024-05-21 08:09:14] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 0 ms to minimize.
[2024-05-21 08:09:15] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 1 ms to minimize.
[2024-05-21 08:09:15] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-21 08:09:15] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2024-05-21 08:09:15] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 08:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 08:09:15] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-21 08:09:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:09:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2024-05-21 08:09:15] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 08:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 08:09:15] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2024-05-21 08:09:16] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 58 ms.
[2024-05-21 08:09:19] [INFO ] Added : 420 causal constraints over 85 iterations in 3652 ms. Result :sat
Minimization took 159 ms.
[2024-05-21 08:09:20] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-21 08:09:20] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 08:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 08:09:20] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2024-05-21 08:09:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:09:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2024-05-21 08:09:20] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 08:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 08:09:20] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-21 08:09:20] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2024-05-21 08:09:21] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 1 ms to minimize.
[2024-05-21 08:09:21] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 1 ms to minimize.
[2024-05-21 08:09:21] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 1 ms to minimize.
[2024-05-21 08:09:21] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 1 ms to minimize.
[2024-05-21 08:09:22] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 1 ms to minimize.
[2024-05-21 08:09:22] [INFO ] Deduced a trap composed of 88 places in 175 ms of which 0 ms to minimize.
[2024-05-21 08:09:22] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 1 ms to minimize.
[2024-05-21 08:09:22] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2024-05-21 08:09:22] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 2 ms to minimize.
[2024-05-21 08:09:23] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 4 ms to minimize.
[2024-05-21 08:09:23] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 0 ms to minimize.
[2024-05-21 08:09:23] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 0 ms to minimize.
[2024-05-21 08:09:23] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 0 ms to minimize.
[2024-05-21 08:09:23] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 1 ms to minimize.
[2024-05-21 08:09:23] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 1 ms to minimize.
[2024-05-21 08:09:24] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 1 ms to minimize.
[2024-05-21 08:09:24] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 1 ms to minimize.
[2024-05-21 08:09:24] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2024-05-21 08:09:24] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2024-05-21 08:09:24] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 1 ms to minimize.
[2024-05-21 08:09:25] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 1 ms to minimize.
[2024-05-21 08:09:25] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 1 ms to minimize.
[2024-05-21 08:09:25] [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 2
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA AutoFlight-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 482 transition count 291
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 224 rules applied. Total rules applied 413 place count 293 transition count 256
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 423 place count 283 transition count 256
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 423 place count 283 transition count 190
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 555 place count 217 transition count 190
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 602 place count 170 transition count 143
Iterating global reduction 3 with 47 rules applied. Total rules applied 649 place count 170 transition count 143
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 649 place count 170 transition count 128
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 679 place count 155 transition count 128
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 753 place count 118 transition count 91
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 773 place count 118 transition count 71
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 793 place count 98 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 794 place count 97 transition count 70
Reduce places removed 20 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 51 rules applied. Total rules applied 845 place count 77 transition count 39
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 876 place count 46 transition count 39
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 876 place count 46 transition count 27
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 900 place count 34 transition count 27
Applied a total of 900 rules in 189 ms. Remains 34 /482 variables (removed 448) and now considering 27/480 (removed 453) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 34/482 places, 27/480 transitions.
// Phase 1: matrix 27 rows 34 cols
[2024-05-21 08:09:25] [INFO ] Computed 14 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1330 ms. (steps per millisecond=751 ) properties (out of 2) seen :2
FORMULA AutoFlight-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18459 ms.

BK_STOP 1716278968188

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-05b, 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 r043-smll-171620180100081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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